Day-1
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Set Matrix Zeros | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Pascal Triangle | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Next Permutation | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Kadane’s Algorithm | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Sort an array of 0’s 1’s 2’s | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Stock Buy and Sell | Click | Coming Soon | Coming Soon | Code | Code |
Day-2
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Rotate Matrix | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Merge Overlapping Subintervals | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Merge two sorted Arrays without extra space |
Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Find the duplicate in an array of N+1 integers. |
Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Repeat and Missing Number | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Inversion of Array (Pre-req: Merge Sort) | Click | Coming Soon | Coming Soon | Code | Code |
Day-3
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Set Matrix Zeros | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Pow(X,n) | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Majority Element (>N/2 times) | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Majority Element (>N/3 times) | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Grid Unique Paths | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Reverse Pairs (Leetcode) | Click | Coming Soon | Coming Soon | Code | Code |
Day-4
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | 2-Sum-Problem | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | 4-sum-Problem | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Longest Consecutive Sequence | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Largest Subarray with 0 sum | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Count number of subarrays with given Xor K |
Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Longest Substring without repeat | Click | Coming Soon | Coming Soon | Code | Code |
Day-5
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Reverse a LinkedList | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Find middle of LinkedList | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Merge two sorted Linked List (use method used in merge Sort) |
Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Remove N-th node from back of LinkedList |
Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Add two numbers as LinkedList | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Delete a given Node when a node is given. (0(1) solution) |
Click | Coming Soon | Coming Soon | Code | Code |
Day-6
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Find intersection point of Y LinkedList |
Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Detect a cycle in Linked List | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Reverse a LinkedList in groups of size k. |
Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Check if a LinkedList is palindrome or not. |
Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Find the starting point of the Loop of LinkedList |
Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Flattening of a LinkedList | Click | Coming Soon | Coming Soon | Code | Code |
| 7. | Rotate a LinkedList | Click | Coming Soon | Coming Soon | Code | Code |
Day-7
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Clone a Linked List with random and next pointer |
Click | Coming Soon | Coming Soon | Code | Code |
| 2 | 3 sum | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Trapping rainwater | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Remove Duplicate from Sorted array | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Max consecutive ones | Click | Coming Soon | Coming Soon | Code | Code |
Day-8
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | N meeting in one room | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Minimum number of platforms required for a railway |
Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Job sequencing Problem | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Fractional Knapsack Problem | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Greedy algorithm to find minimum number of coins |
Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Activity Selection (it is the same as N meeting in one room) |
Click | Coming Soon | Coming Soon | Code | Code |
Day-9: Recursion
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Subset Sums | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Subset-II | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Combination sum-1 | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Combination sum-2 | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Palindrome Partitioning | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | K-th permutation Sequence | Click | Coming Soon | Coming Soon | Code | Code |
Day-10 : Recursion & Backtracking
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Print all permutations of a string/array | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | N queens Problem | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Sudoku Solver | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | M coloring Problem | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Rat in a Maze | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Word Break (print all ways) | Click | Coming Soon | Coming Soon | Code | Code |
Day-11: Binary Search
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | The N-th root of an integer | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Matrix Median | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Find the element that appears once in a sorted array, and the rest element appears twice (Binary search) | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Search element in a sorted and rotated array/ find pivot where it is rotated | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Median of 2 sorted arrays | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | K-th element of two sorted arrays | Click | Coming Soon | Coming Soon | Code | Code |
| 7. | Allocate Minimum Number of Pages | Click | Coming Soon | Coming Soon | Code | Code |
| 8. | Aggressive Cows | Click | Coming Soon | Coming Soon | Code | Code |
Day-12: BITS (Optional)
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Check if a number if a power of 2 or not in O(1) | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Count total set bits | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Divide Integers without / operator | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Power Set (this is very important) | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Find MSB in o(1) | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Find the square of a number without using multiplication or division operators. | Click | Coming Soon | Coming Soon | Code | Code |
Day-13 : (Stack and Queue)
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Implement Stack Using Arrays | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Implement Queue Using Arrays | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Implement Stack using Queue (using single queue) | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Implement Queue using Stack (0(1) amortized method) | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Check for balanced parentheses | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Next Greater Element | Click | Coming Soon | Coming Soon | Code | Code |
| 7. | Sort a Stack | Click | Coming Soon | Code | Code |
Day-14 :
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Next Smaller Element | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | LRU cache (IMPORTANT) | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | LFU Cache | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Largest rectangle in a histogram | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Sliding Window maximum | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Implement Min Stack | Click | Coming Soon | Coming Soon | Code | Code |
| 7. | Rotten Orange (Using BFS) | Click | Coming Soon | Coming Soon | Code | Code |
| 8. | Stock Span Problem | Click | Coming Soon | Coming Soon | Code | Code |
| 9. | Find the maximum of minimums of every window size | Click | Coming Soon | Coming Soon | Code | Code |
| 10. | The Celebrity Problem | Click | Coming Soon | Coming Soon | Code | Code |
Day-15: String
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Reverse Words in a String | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Longest Palindrome in a string | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Roman Number to Integer and vice versa | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Implement ATOI/STRSTR | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Longest Common Prefix | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Rabin Karp | Click | Coming Soon | Coming Soon | Code | Code |
Day-16: String [Continued]
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Z-Function | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | KMP algo / LPS(pi) array | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Minimum characters needed to be inserted in the beginning to make it palindromic |
Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Check for Anagrams | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Count and Say | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Compare version numbers | Click | Coming Soon | Coming Soon | Code | Code |
Day-17: Binary Tree (Introduction)
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Inorder Traversal | Click | Coming Soon | Coming Soon | Code (Recursive) Code (Iterative) |
Code (Recursive) Code (Iterative) Code (Morris) |
| 2 | Preorder Traversal | Click | Coming Soon | Coming Soon | Code (Morris) | Code |
| 3. | Postorder Traversal | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | All traversals in One Go | Click | Coming Soon | Coming Soon | Code | |
| 5. | LeftView Of Binary Tree | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Bottom View of Binary Tree | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Top View of Binary Tree | Click | Coming soon | Code | Code |
Day-18: Binary Tree [Continued]
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Level order Traversal / Level order traversal in spiral form | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Height of a Binary Tree | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Diameter of Binary Tree | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Check if the Binary tree is height-balanced or not | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | LCA in Binary Tree | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Check if two trees are identical or not | Click | Coming Soon | Coming Soon | Code | Code |
Day-19: Binary Tree [Continued]
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Maximum path sum | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Construct Binary Tree from inorder and preorder | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Construct Binary Tree from Inorder and Postorder | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Symmetric Binary Tree | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Flatten Binary Tree to LinkedList | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Check if Binary Tree is mirror of itself or not | Click | Coming Soon | Coming Soon | Code | Code |
Day-20: Binary Search Tree
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Populate Next Right pointers of Tree | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Search given Key in BST | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Construct BST from given keys | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Check is a BT is BST or not | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Find LCA of two nodes in BST | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Find the inorder predecessor/successor of a given Key in BST. | Click | Coming Soon | Coming Soon | Code | Code |
Day-21: Binary Search Tree [Continued]
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1. | Floor in a BST | Click | Coming Soon | Coming Soon | Code | Code |
| 2. | Ceil in a BST | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Find K-th smallest element in BST | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Find K-th largest element in BST | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Find a pair with a given sum in BST | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | BST iterator | Click | Coming Soon | Coming Soon | Code | Code |
| 7. | Size of the largest BST in a Binary Tree | Click | Coming Soon | Coming Soon | Code | Code |
| 8. | Serialize and deserialize Binary Tree | Click | Coming Soon | Coming Soon | Code | Code |
Day-22: Trees [Miscellaneous]
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Binary Tree to Double Linked List | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Find median in a stream of running integers. | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | K-th largest element in a stream. | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Distinct numbers in Window. | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | K-th largest element in an unsorted array. | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Flood-fill Algorithm | Click | Coming Soon | Coming Soon | Code | Code |
Day-23: Graphs – Part 1
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Clone a graph (Not that easy as it looks) | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | DFS | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | BFS | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Detect A cycle in Undirected Graph using BFS | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Detect A cycle in Undirected Graph using DFS | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Detect A cycle in a Directed Graph using DFS | Click | Coming Soon | Coming Soon | Code | Code |
| 7. | Detect A cycle in a Directed Graph using BFS | Click | Coming Soon | Coming Soon | Code | Code |
| 8. | Topological Sort | Click | Coming Soon | Coming Soon | Code | Code |
| 9. | Number of islands (Do in Grid and Graph both) | Click | Coming Soon | Coming Soon | Code | Code |
| 10. | Bipartite Check using BFS | Click | Coming Soon | Coming Soon | Code | Code |
| 11. | Bipartite Check using DFS | Click | Coming Soon | Coming Soon | Code | Code |
Day-24: Graphs – Part 2
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Strongly Connected Component(using KosaRaju’s algo) | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Dijkstra’s Algorithm | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Bellman-Ford Algo | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Floyd Warshall Algorithm | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | MST using Prim’s Algo | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | MST using Kruskal’s Algo | Click | Coming Soon | Coming Soon | Code | Code |
Day-25: Dynamic Programming – Part 1
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Max Product Subarray | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Longest Increasing Subsequence | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Longest Common Subsequence | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | 0-1 Knapsack | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Edit Distance | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Maximum sum increasing subsequence | Click | Coming Soon | Coming Soon | Code | Code |
| 7. | Matrix Chain Multiplication | Click | Coming Soon | Coming Soon | Code | Code |
Day-26: Dynamic Programming – Part 2
| Q.No | Problem Name | Problem Link | Video Problem | Video Solution | C++ Code | Java Code |
|---|---|---|---|---|---|---|
| 1 | Maximum sum path in the matrix, (count paths and similar type do, also backtrack to find the maximum path) | Click | Coming Soon | Coming Soon | Code | Code |
| 2 | Coin change | Click | Coming Soon | Coming Soon | Code | Code |
| 3. | Subset Sum | Click | Coming Soon | Coming Soon | Code | Code |
| 4. | Rod Cutting | Click | Coming Soon | Coming Soon | Code | Code |
| 5. | Egg Dropping | Click | Coming Soon | Coming Soon | Code | Code |
| 6. | Word Break | Click | Coming Soon | Coming Soon | Code | Code |
| 7. | Palindrome Partitioning (MCM Variation) | Click | Coming Soon | Coming Soon | Code | Code |
| 8. | Maximum profit in Job scheduling | Click | Coming Soon | Coming Soon | Code | Code |
Day-27:
- Revise OS notes that you would have made during your semester
- If not made notes, spend 2 or 3 days and make notes from Knowledge Gate.
Day-28:
- Revise DBMS notes that you would have made during your semesters.
- If not made notes, spend 2 or 3 days and make notes from Knowledge Gate.
Day-29:
- Revise CN notes, that you would have made during your sem.
- If not made notes, spend 2 or 3 days and make notes from Knowledge Gate.
Day-30:
- Make a note of how will your represent your projects, and prepare all questions related to tech which you have used in your projects. Prepare a note which you can say for 3-10 minutes when he asks you that say something about the project.