😇 README

All My Public Notebooks

{% embed url="https://gist.github.com/AbhyasKanaujia/b1aa2c5ba91e8a0b7796fecdbf52023a" %}

Homework

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

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

𝒜𝒷𝒽𝓎𝒶𝓈