LinkedIn Profile : https://www.linkedin.com/in/kiranmuddam/
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1 | Merge two sorted arrays | C++ | O(a+b) | O(a+b) | Easy | ||
| 2 | Reverse a string | C++ | O(n) | O(1) | Easy |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 3 | First recurring integer | C++ | O(n) | O(n) | Easy |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 4 | LinkedList Implementation | C++ | O(n) | O(n) | Easy | ||
| 5 | LinkedList STL Implementation | C++ | O(n) | O(n) | Easy |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 6 | Queue using LinkedList | C++ | O(n) | O(n) | Easy | ||
| 7 | Stack using LinkedList | C++ | O(n) | O(n) | Easy | ||
| 8 | Stack using STL | C++ | O(n) | O(n) | Easy |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 9 | Binary Search Tree | C++ | O(n) | O(n) | Easy | ||
| 13 | Tree Child Nodes Sum | C++ | ... | ... | Easy |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 10 | Graph Implementation Adjacency List | C++ | ... | ... | Graph | ||
| 11 | Graph DFS Traversal | C++ | ... | ... | Graph, DFS | ||
| 12 | Graph BFS Traversal | C++ | ... | ... | Graph, BFS |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1 | Factorial | C++ | O(n) | O(1) | Easy | ||
| 2 | Fibonacci | C++ | O(n) (iterative) / O(2^n)(recursive) | O(1) | Easy | ||
| 3 | Reverse String | C++ | O(n) | O(1) | Easy |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1 | Bubble Sort | C++ | O(n^2) | O(1) | Easy | ||
| 2 | Selection Sort | C++ | O(n^2) | O(1) | Easy | ||
| 3 | Insertion Sort | C++ | O(n^2) | O(1) | Easy | ||
| 4 | Merge Sort | C++ | O(nlogn) | O(n) | Medium | ||
| 5 | Quick Sort | C++ | O(nlogn)/O(n^2) | O(logn) | Medium | ||
| 6 | Radix Sort | C++ | O(nk) | O(n+k) | Medium | ||
| 7 | Counting Sort | C++ | O(n+k) | O(k) | Medium |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1 | Linear Search | C++ | O(n) | O(1) | Easy | ||
| 2 | Binary Search | C++ | O(logn) | O(1) | Easy |