- 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.
- Traditional 0/1
- Subset Sum
- Subset Sum Count
- Equal Subset Sum
- Partitions With Sum Difference D
- Minimum Sum Partition (Hard)
- Count Palindromic Subsequence
- Edit Distance
- Interleaved Strings
- LCS Of Three
- Longest Common Substring
- Longest Common Subsequence
- Longest Palindromic Subsequence
- Longest Repeating Subsequence
- Longest Ideal Subsequence
- Longest Increasing Subsequence
- Longest Diff One Subsequence
- Max Sum Increasing Subsequence
- Word Break
- Word Wrap
- Traditional
- Boolean Parenthesize
- Egg Dropping Problem
- Bracket MCM
- Palindromic Partitioning
- Scrambled String Problem
- Gold Mine Problem
- Matrices Square Count
- Maximum Sum Path Row
- Minimum Points To Reach
- Mobile Numeric Keypad
- Balanced Height Trees
- Count DeArrangements
- Friends Pairing Problem
- Max Sum 3 Adjacent
- Stickler Thief
- Sum Of SubStrings
- Assembly Line Scheduling
- Buying and Selling K Times
- Expression Matching
- Geek Game Of Coins
- K Inverse Pairs
- Longest Alternating Subsequence
- Max Difference Ones Zeros
- nCr
- nPr
- Optimal Strategy For A Game
- Painting The Fence
- Smallest Sum Kadane
- String Compression Two
- Student Attendance 2
- Wild Pattern Matching
- Buy And Sell Stock I
- Buy And Sell Stock II
- Buy And Sell Stock III
- Chocolate Distribution
- Common Elements Three Arrays
- SubArray Product Less Than K
- Equal Sum SubArrays
- Equal Zeros And Ones
- Factorials Of Large Numbers
- Find Duplicate
- Inversion Count
- Jump Game I
- Jump Game II
- Majority Element
- Majority Element II
- Max Product SubArray
- Max Water Container
- Median Of Sorted Arrays
- Merge Intervals
- Min Swaps To Group (Crazy)
- Minimize Heights II
- Minimum Platforms
- Minimum Size Sub Array With Sum <= K
- Next Permutation
- Odd Sum Sub Arrays
- Pair With Sum Sorted Rotated
- Pair With Given Sum
- Product Except Self
- Range Sum
- Repeat And Missing (Squares Wala)
- Rotate By K
- Segregate Even Odd
- Sort Squares
- Sort Zero, One & Two
- SubArray Divisible By K
- SubArray Sum Equals K
- SubArray With K Different Integer (Karlo Ache Wala Hai)
- Three Sum
- Three Way Partition
- Top K Frequent Elements
- Trapping Rain Water
- Implementation (Must Do)
- Reverse List
- Middle Of List
- Delete Middle Of List
- Get Nth Node From Last
- Delete Nth Node From Last
- Delete Nodes With Greater Value On Right
- Add One To A Number
- Add Two Numbers
- Multiply Two Numbers
- Subtract Two Number
- Intersection Of Two Linked List
- Intersection Of Sorted List
- List Cycle
- Merge Two Sorted List
- Merge K Sorted List
- Merge Sort
- Odd Even List
- Palindrome List
- Flatten Lists Into Sorted List
- Flatten With Next And Child
- List With Random Pointer
- Remove Duplicates
- Remove Duplicates Unsorted
- ReOrder List
- Reverse Nodes In K Groups
- Segregate Even Odd
- Swap Nodes
- Swap Nodes In Pairs (Crazy Damn!)
- Twin Sum
- LeetCode 117
- Doubly List Reverse
- Pair Sum
- Critical Point
- Reverse In Groups Of K
- Rotate List By N
- Sort K Sorted List (Wow!)
- Triplet Sum
- Basics
- Binary Tree To DDL
- Flatten Tree (Highly Important)
- Bottom Left Tree Value
- DFS
- BFS (Level Order)
- Bottom View
- Top View
- Right And Left View
- Boundary Traversal
- Diagonal Traversal
- Traversals
- Construct Tree
- Construct Tree Brackets {Wow}
- All Duplicate Trees (as Strings)
- Duplicate Tree
- Same Tree
- Binary Tree Cameras
- Diameter
- Good Nodes
- Graph Tree Or Not
- Height Balanced
- Invert Binary Tree
- Isomorphic Trees
- Largest Sub Tree Sum
- Kth Ancestor Node {Tricky}
- Longest Root To Leaf Sum
- Longest Zig Zag Path
- Lowest Common Ancestor
- Minimum Distance Between Two Nodes (Keep On Going)
- No Adjacent Max Sum
- Node Average Sum
- Mirror Trees
- Path Sum 1
- Path Sum 2
- Path Sum 3
- Preorder Inorder To Tree
- Serialize & Deserialize
- Sum Tree
- Symmetric Tree
- Zig Zag Level Order
- Vertical Level Order
- Virus Killer
- Array To BST
- Basics
- Brothers From Different Tree
- BST Contains Dead End
- BST To Balanced Tree
- BST To List
- Construct (Bidu Log Zad Ugao)
- Search Insert
- Delete
- Greater Tree
- Kth Smallest
- Largest BST In a Tree
- Least Great Right
- Lowest Ancestor
- Median In O1
- Merge Two BST
- Minimum Difference
- Minimum Distance Between Two Nodes
- Mode In BST
- Morris Traversal
- Populate Next
- Predecessor & Successor
- PreOrder To BST
- Range Sum
- Tree To BST
- Trim BST
- Valid BST
- Adjacency List
- All Paths
- Breadth First Search
- Depth First Search
- Flood Fill
- Clone Graph
- Detect Cycle Directed
- Detect Cycle UnDirected
- Dijkstra Algorithm (Single Source)
- Floyd Warshall Algorithm (All Source)
- All City Threshold
- Minimum Cost To Convert
- Bellman Ford Algorithm
- Cheapest Flight K Stops
- Number Of Ways To Destination
- Open The Lock
- All People With Secrets
- Network Time Delay
- Steps By Knight
- Snakes & Ladders
- Word Ladder
- Articulation Point
- Critical Connections
- Tarjans Algorithm
- Bipartite Graph
- M Coloring Problem
- Topological Sorting
- Town Judge
- Parallel Courses 3
- Pre Requisites Task
- Minimum Height Trees
- Kosaraju's Algorithm
- Prims Algorithm
- Kruskal's Algorithm
- Euler Path
- Disjoint Union Set
- Valid Path
- Make Network Connected
- UnReachable Pair Nodes
- GCD Traversals
- Basics
- Array Implementation
- LL Implementation
- Insert Bottom
- Balanced Brackets
- Redundant Brackets
- Reverse Recursive
- Simplify Path
- Asteroid Collision
- Next Greater
- Next Smaller
- Largest Number
- Largest Histogram
- Longest Valid Parenthesis
- Maximum Stock Span
- Min Stack
- Decode String (Karlo Acha Hai)
- Sliding Window
- Sort Stack
- Sum Of SubArray Minimums
- Stack With Middle OP
- The Celebrity Problem
- Two Stacks
- Consecutive Subsequence
- Conversions (Andar Jake Dekh Lo)
- Basics
- Array Implementation
- LL Implementation
- Circular Queue
- Circular Tour
- Dota2Senate
- First Negative
- First Non-Repeating
- LRU Cache (Karna Padega)
- My Queue
- My Stack
- Recent Calls
- ReOrder Queue
- Reverse First K
- Rotten Oranges
- Binary Search
- Common Element All Rows
- Count Island
- Determinant Of Matrix
- Diagonal Traversal
- Generate Spiral
- Print Spiral
- Make Matrix Beautiful
- Maximum Rectangle 1s
- Multiplication Of Matrix
- Overlapping Intervals
- Pascal Triangle
- Rectangle Sum
- Replace O With X
- Reverse Each Row
- Rotate By 90
- Rows With Max One
- Set Matrix Zeros
- Sub Matrix Sum Target
- Sub Square Surrounded By X
- Toeplitz Matrix
- Transpose
- Word Search
- Largest Sub Matrix Sum Zero
- RatInAMaze
- N Queens
- Word Break 2
- Maze Paths
- Sudoku Solver
- All Palindromic Partitions
- Knights Tour
- K Knights Max
- Largest Number K Swaps
- Combination Sum
- Partition Into K SubSets
- Remove Invalid Parenthesis
- Basics
- Deletion Min Heap
- Deletion Max Heap
- Insertion Min Heap
- Insertion Max Heap
- Heap Sort
- Basics
- Kth Largest
- Merge K Sorted Arrays
- Merge K Sorted List
- Is Tree Heap
- Median Stream
- BST To Min Heap
- Kth Largest Sub Array Sum
- Reorganize Strings
- K1 & K2
- Kth Smallest Fraction
- Merge Heaps
- Minimum Cost To Hire K Workers
- Smallest Range K List
- Activity Selection Problem
- Fractional Knapsack
- Weighted Job Scheduling
- Minimum Cost To Cut
- Survive
- Maximum Meetings
- Maximize Consecutive Differences
- Max Sum Stack
- Smallest Number Digits
- Max Sum K Negations
- HuffMan Coding
- Water Connection Problem
- Binary Search
- Aggressive Cows
- Allocate Books
- Max Profit Workers
- Days To Make M Bouquets
- Distribute Chocolates
- Find K Closest Elements
- Minimum Rotated Sorted
- Square Root
- First Occurrence
- Minimize Max Distance
- Mountain Array
- Race Track
- Search Matrix
- Search Rotated
- Successful Potions