520 lines (452 loc) · 42.6 KB

The complete DSA for placement (Goal: Shh!🤫 It's a secret):

The topics covered have notes associated which will be published at the appropriate time.
All the topics have Easy, Medium & Hard level questions across various sites such as leetcode, geeksforgeeks, etc.

DP (Glorified Recursion with Caching):

0/1 KNAPSACK:

UNBOUNDED KNAPSACK:

COMMON SUBSEQUENCE:

MCM PATTERN:

GRID PROBLEMS:

ADJACENT PROBLEMS:

RANDOM PROBLEMS:

Try to solve DIGIT DP & BIT-MASKING FROM CP PRACTICE (cses).

Array (Contiguous Memory Allocation):

ALL ARE OF DIFFERENT TECHNIQUES

PART 1:

PART 2:

Linked List (Pointer to Next Location):

NORMAL LIST:

DOUBLY LINKED LIST:

Binary Tree(Baap And Do Bache):

BASIC:

CLASSIC:

Binary Search Trees(Left Jao Ya Right):

TOPIC NAHI SUJA:

Graphs(Ghumte Raho):

Road Pe Niklo, Raasta Apne Aap Banega:

Stack(Ek ke Upar Ek):

Khane Ki Plates:

Queue(Pehle Andar Pehle Bahar):

Line Mein Lago:

Matrix(3x3, 4x4):

Hamesha O(n^2):

Backtracking (U Turn Le Lo):

Rasta Nahi Hai...:

Heaps (Priority Queue):

Upar Wala Element:

Greedy (Lalach):

Jo Theek Lage:

Searching & Sorting:

Dundho:

Line Mein Lago:

Trie (Not from this World):

Jaadu (✌):

Strings (English or Spanish):

(Techniques Important Hai):