If you appreciate my work, please 🌟 this repository. It motivates me. 🚀 🚀
DSA CRACKER sheet : link
🔴 🔴 IMPORTANT : If you forked this repo and want to be updated with the changes made to this repo refer How do I update a GitHub forked repository?
- Added Clone A Graph problem in the Graphs topic.
- If you think you have the better optimal solution.
- If you have the solution to the unsolved problem marked with "red-cross".
This is an attempt to solve 450 questions carefully curated by our very own Love Babbar.
| # | Title | Solution | Time | Space | Difficulty | Note |
|---|---|---|---|---|---|---|
| 1 | Spiral traversal on a Matrix | ✔️ | ||||
| 2 | Search an element in a matriix | ✔️ | ||||
| 3 | Find median in a row wise sorted matrix | ✔️ | ||||
| 4 | Find row with maximum no. of 1's | ✔️ | ||||
| 5 | Print elements in sorted order using row-column wise sorted matrix | ✔️ |
| # | Title | Solution | Time | Space | Difficulty | Note |
|---|---|---|---|---|---|---|
| 1 | Rat In A Maze | ✔️ | - | - | - | |
| 2 | N Queens Problem | ✔️ | - | - | - | |
| 3 | M coloring Problem | ✔️ | O(n^m) | O(n) | - | |
| 5 | Sudoku Solver | ✔️ | - | - | - |
| # | Title | Solution | Time | Space | Difficulty | Note |
|---|---|---|---|---|---|---|
| 6 | Flood fill Algorithm | ✔️ | O(n*m) | O(n*m) | - | |
| 7 | Minimum Step By Knight | ✔️ | - | - | - | |
| 9 | Clone A Graph | ✔️ | - | - | - | |
| 13 | Implement Topological Sorting | ✔️ | - | - | - | |
| 22 | Implement Floyd Warshall Algorithm | ✔️ | - | - | - | |
| 25 | Snake and Ladder Problem | ✔️ | O(n) | O(n) | - | |
| 27 | Strongly Connected Components (Kosaraju's Algo) | ✔️ | - | - | - | |
| 32 | Cheapest Flights within k stops | ✔️ | Quadratic | Quadratic | Medium | |
| 37 | Maximum Product Subarray | ✔️ | - | - | - | - |
| 358 | searching element in Graph using DFS | ✔️ | O(V+E) | O(V) | Medium |
| # | Title | Solution | Time | Space | Difficulty | Note |
|---|---|---|---|---|---|---|
| 1 | Right View of Binary Tree | ✔️ | o(n) | O(n) | Medium | |
| 2 | Height of Binary Tree | ✔️ | O(N) | O(N) | Medium | |
| 3 | Diameter of Binary Tree | ✔️ | O(N) | O(log(N)) | Easy | |
| 4 | Check for Balanced Tree | ✔️ | O(N) | O(log(N)) | Easy | |
| 5 | Binary Tree Postorder Traversal | ✔️ | O(n) | O(n) | Easy | |
| 6 | Bottom View of Binary Tree | ✔️ | O(n) | O(n) | Medium |
| # | Title | Solution | Time | Space | Difficulty | Note |
|---|---|---|---|---|---|---|
| 1 | Reverse an Array | ✔️ | O(N) | O(1) | Easy | |
| 2 | Find MAximum and Minimum in Array | ✔️ | O(N) | O(1)) | Easy | |
| 3 | Dutch National Flag [ Sort 0's , 1's and 2's without sorting] | ✔️ | O(N) | O(N)) | Easy |
| # | Title | Solution | Time | Space | Difficulty | Note |
|---|---|---|---|---|---|---|
| 1 | Write a program to Detect loop in a linked list. | ✔️ | - | - | Easy | - |
| 2 | Write a Program to check whether the Singly Linked list is a palindrome or not. | ✔️ | O(n) | O(n) | Easy | - |
| 3 | Write a Program to Remove duplicate element from sorted Linked List. | ✔️ | O(n) | O(1) | Easy | - |
You can find me on
to stay updated and follow along with my journey.
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent