Skip to content

AbhyasKanaujia/Love-Babbar-DSA-Unacademy-Homeworks

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

😇 README

All My Public Notebooks

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

Homework

ClassHomeworkNotesVideo
01 Introduction to Programmingtruetruetrue
02 Programming Basic Itruetruetrue
03 Programming Basic IItruetruetrue
04 Pattern Homeworktruetruetrue
05 Programming Basics IIItruetruetrue
06 Functions and arraytruetruetrue
07 Array Problems Itruetruetrue
08 Array Problem IItruetruetrue
09 2D Arrayfalsefalsefalse
10 Binary Searchfalsefalsefalse
11 Binary Search Problems Ifalsefalsefalse
12 Binary Search Problems IIfalsefalsefalse
13 Sorting Techniques falsefalsefalse
14 Character Arrays and String truetruetrue
15 Basic Mathematics for DSAtruetruetrue
16 Pointers Itruetruetrue
17 Pointers IItruetruetrue
18 Static and Dynamic Allocationtruetruetrue
19 Recursion Itruetruetrue
20 Recursion IItruetruetrue
21 Recursion IIItruetruetrue
22 Divide & Conquertruetruetrue
23 Backtracking Ifalsetruetrue
24 Backtracking IIfalsetruetrue
25 Backgracking IIIfalsetruetrue
26 Time Complexity of Recursive Algorithm & OOPs Ifalsetruetrue
27 OOSP IIfalsefalsefalse
28 OOPS IIIfalsefalsefalse
29 Linked List Ifalsetruetrue
30 Linked List IIfalsetruetrue
31 Linked List IIItruetruetrue
32 Linked List IVfalsefalsefalse
33 Stack Itruetruetrue
34 Stack IIfalsefalsefalse
35 Stack IIIfalsefalsefalse
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

𝒜𝒷𝒽𝓎𝒶𝓈

About

Love Babbar DSA Unacademy Course handwritten notes and homework

Topics

Resources

License

Code of conduct

Stars

Watchers

Forks

Languages