This is an attempt to solve 450 questions carefully curated by Love Babbar.
If you appreciate my work, please 🌟 this repository. It motivates me. :rocket: :rocket:
DSA CRACKER sheet : link
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 | :heavy_check_mark: | ||||
2 | Search an element in a matriix | :heavy_check_mark: | ||||
3 | Find median in a row wise sorted matrix | :heavy_check_mark: | ||||
4 | Find row with maximum no. of 1's | :heavy_check_mark: | ||||
5 | Print elements in sorted order using row-column wise sorted matrix | :heavy_check_mark: |
# | Title | Solution | Time | Space | Difficulty | Note |
---|---|---|---|---|---|---|
1 | Rat In A Maze | :heavy_check_mark: | - | - | - | |
2 | N Queens Problem | :heavy_check_mark: | - | - | - | |
3 | M coloring Problem | :heavy_check_mark: | O(n^m) | O(n) | - | |
5 | Sudoku Solver | :heavy_check_mark: | - | - | - |
# | Title | Solution | Time | Space | Difficulty | Note |
---|---|---|---|---|---|---|
6 | Flood fill Algorithm | :heavy_check_mark: | O(n*m) | O(n*m) | - | |
7 | Minimum Step By Knight | :heavy_check_mark: | - | - | - | |
9 | Clone A Graph | :heavy_check_mark: | - | - | - | |
13 | Implement Topological Sorting | :heavy_check_mark: | - | - | - | |
22 | Implement Floyd Warshall Algorithm | :heavy_check_mark: | - | - | - | |
25 | Snake and Ladder Problem | :heavy_check_mark: | O(n) | O(n) | - | |
27 | Strongly Connected Components (Kosaraju's Algo) | :heavy_check_mark: | - | - | - | |
32 | Cheapest Flights within k stops | :heavy_check_mark: | Quadratic | Quadratic | Medium | |
37 | Maximum Product Subarray | :heavy_check_mark: | - | - | - | - |
358 | searching element in Graph using DFS | :heavy_check_mark: | O(V+E) | O(V) | Medium | |
# | Title | Solution | Time | Space | Difficulty | Note |
---|---|---|---|---|---|---|
1 | Right View of Binary Tree | :heavy_check_mark: | o(n) | O(n) | Medium | |
2 | Height of Binary Tree | :heavy_check_mark: | O(N) | O(N) | Medium | |
3 | Diameter of Binary Tree | :heavy_check_mark: | O(N) | O(log(N)) | Easy | |
4 | Check for Balanced Tree | :heavy_check_mark: | O(N) | O(log(N)) | Easy | |
5 | Binary Tree Postorder Traversal | :heavy_check_mark: | O(n) | O(n) | Easy | |
6 | Bottom View of Binary Tree | :heavy_check_mark: | O(n) | O(n) | Medium | |
# | Title | Solution | Time | Space | Difficulty | Note |
---|---|---|---|---|---|---|
1 | Reverse an Array | :heavy_check_mark: | O(N) | O(1) | Easy | |
2 | Find MAximum and Minimum in Array | :heavy_check_mark: | O(N) | O(1)) | Easy | |
3 | Dutch National Flag [ Sort 0's , 1's and 2's without sorting] | :heavy_check_mark: | O(N) | O(N)) | Easy |
# | Title | Solution | Time | Space | Difficulty | Note |
---|---|---|---|---|---|---|
1 | Write a program to Detect loop in a linked list. | :heavy_check_mark: | - | - | Easy | - |
2 | Write a Program to check whether the Singly Linked list is a palindrome or not. | :heavy_check_mark: | O(n) | O(n) | Easy | - |
3 | Write a Program to Remove duplicate element from sorted Linked List. | :heavy_check_mark: | O(n) | O(1) | Easy | - |
You can find me on to stay updated and follow along with my journey.