> For the complete documentation index, see [llms.txt](https://abhyas-kanaujia.gitbook.io/lb-dsa-notes-and-homework-abhyas/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://abhyas-kanaujia.gitbook.io/lb-dsa-notes-and-homework-abhyas/readme.md).

# README

### All My Public Notebooks

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

### Homework

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

<details>

<summary>Doubt Sessions</summary>

Doubt Clearing Session Part I :white\_check\_mark:

Doubt Clearing Session Part II :white\_check\_mark:

Doubt Clearing Session Part III&#x20;

Doubt Clearing Session Part IV&#x20;

Doubt Clearing Session Part V

Doubt Clearing Session Part VI &#x20;

</details>

### Pending

#### Recursion Sheet

1. [Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/)
2. [Decode String](https://leetcode.com/problems/decode-string/)
3. [Predict the Winner](https://leetcode.com/problems/predict-the-winner/)
4. [Elimination Game](https://leetcode.com/problems/elimination-game/)
5. [K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar/)
6. [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)
7. [Count Good Numbers](https://leetcode.com/problems/count-good-numbers/)
8. [Minimum Non-Zero Product of the Array Elements](https://leetcode.com/problems/minimum-non-zero-product-of-the-array-elements/)
9. [Integer to English Words](https://leetcode.com/problems/integer-to-english-words/)
10. [Permutation Sequence](https://leetcode.com/problems/permutation-sequence/)
11. [Wildcard Matching](https://leetcode.com/problems/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.&#x20;**~~**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&#x20;

[![](https://img.icons8.com/color/48/000000/linkedin-circled--v3.png)](https://www.linkedin.com/in/abhyas/)[![](https://img.icons8.com/ios-filled/50/000000/github.png)](https://github.com/abhyasKanaujia/)[![](https://img.icons8.com/color/48/000000/discord-logo.png)](http://discordapp.com/users/520215009469661195)[![](https://img.icons8.com/color/48/000000/telegram-app--v1.png)](http://t.me/Abhyas29)

𝒜𝒷𝒽𝓎𝒶𝓈