😇README

All My Public Notebooks

Homework

Class	Homework	Notes	Video
01 Introduction to Programming
02 Programming Basic I
03 Programming Basic II
04 Pattern Homework
05 Programming Basics III
06 Functions and array
07 Array Problems I
08 Array Problem II
09 2D Array
10 Binary Search
11 Binary Search Problems I
12 Binary Search Problems II
13 Sorting Techniques
14 Character Arrays and String
15 Basic Mathematics for DSA
16 Pointers I
17 Pointers II
18 Static and Dynamic Allocation
19 Recursion I
20 Recursion II
21 Recursion III
22 Divide & Conquer
23 Backtracking I
24 Backtracking II
25 Backgracking III
26 Time Complexity of Recursive Algorithm & OOPs I
27 OOSP II
28 OOPS III
29 Linked List I
30 Linked List II
31 Linked List III
32 Linked List IV
33 Stack I
34 Stack II
35 Stack III

Doubt Sessions

Doubt Clearing Session Part I ✅

Doubt Clearing Session Part II ✅

Doubt Clearing Session Part III

Doubt Clearing Session Part IV

Doubt Clearing Session Part V

Doubt Clearing Session Part VI

Pending

Recursion Sheet

1. Different Ways to Add Parentheses
2. Decode String
3. Predict the Winner
4. Elimination Game
5. K-th Symbol in Grammar
6. Add Two Numbers
7. Count Good Numbers
8. Minimum Non-Zero Product of the Array Elements
9. Integer to English Words
10. Permutation Sequence
11. Wildcard Matching

23. Backtracking Homework

1. Beautiful Arrangement

24. Backtracking II Homework

1. Combination Sum

2. Combination Sum II

3. Combination Sum III

25. Backtracking III Homework

1. Word Search

26. Time Complexity of Recursive Algorithm & OOPS I

1. Padding & Alignment

2. Does a class use space in C++? In Java?

3. Deep copy & Shallow cop

29. Linked List I

1. Singly

2. Doubly

3. Circular

4. Circular Doubly

30. Linked List II

1. Reverse a LL

2. Find Middle of LL

3. Check if LL is circular

4. Reverse LL in k Groups

5. Palindrome LL

6. Sort 0s, 1s and 2s

31. Linked List III

1. Print Kth Node from the end. 4 approaches

2. Detect and Delete Loop

3. Intersection Point of LL. 4 approaches

4. Flatten a LL (recursion)

5. Remove Duplicate from sorted/unsorted LL

6. Add 1 to LL

7. Add two LL

8. Clone LL with random pointer

9. Delete m nodes after n nodes

10. Reverse alternate k nodes

11. Why is quick sort preferred fore arrays, and why merge sort is preferred for LL?

Find me

𝒜𝒷𝒽𝓎𝒶𝓈