Complete-DSA
Complete-DSA copied to clipboard
Table of Contents 📋
SNo. | Contents | Total Problems |
---|---|---|
1. | Algorithms | 0 |
2. | Mathematics | 22 |
3. | Bit Manipulation | 0 |
4. | Array | 1 |
5. | Matrix | 0 |
6. | Strings | 0 |
7. | Two Pointers | 0 |
8. | Sliding Window | 0 |
9. | Hashing | 0 |
10. | Searching | 0 |
11. | Sorting | 0 |
12. | Recursion & Backtracking | 0 |
13. | Linked List | 0 |
14. | Stack | 0 |
15. | Queue | 0 |
16. | Tree | 0 |
17. | Binary Search Tree | 0 |
18. | Heap | 0 |
19. | Graph | 0 |
20. | Greedy | 0 |
21. | Dynamic Programming | 0 |
22. | Divide and Conquer | 0 |
23. | Trie | 0 |
24. | Segment Tree and Binary Indexed Tree | 0 |
25. | Disjoint Set | 0 |
26. | Design | 0 |
1. Algorithms
S.No. | Level | Problem | Solution |
---|---|---|---|
1 |
⬆️ Back to Top
2. Mathematics
S.No. | Level | Problem | Solution |
---|---|---|---|
1 | ![]() |
![]() |
|
2 | ![]() |
![]() |
|
3 | ![]() |
![]() |
|
4 | ![]() |
![]() |
|
5 | ![]() |
![]() |
|
6 | ![]() |
![]() |
|
7 | ![]() |
![]() |
|
8 | ![]() |
![]() |
|
9 | ![]() |
![]() |
|
10 | ![]() |
![]() |
|
11 | ![]() |
![]() |
|
12 | ![]() |
![]() |
![]() |
13 | ![]() |
![]() |
![]() |
14 | ![]() |
![]() |
![]() |
15 | ![]() |
![]() |
![]() |
16 | ![]() |
![]() |
![]() |
17 | ![]() |
![]() |
![]() |
18 | ![]() |
![]() |
![]() |
19 | ![]() |
![]() |
![]() |
20 | ![]() |
![]() ![]() |
![]() |
21 | ![]() |
![]() |
![]() |
22 | ![]() |
![]() |
![]() |
⬆️ Back to Top
3. Bit Manipulation
S.No. | Level | Problem | Solution |
---|---|---|---|
1 |
⬆️ Back to Top
4. Array
S.No. | Level | Problem | Solution |
---|---|---|---|
1 | ![]() |
![]() |
⬆️ Back to Top
5. Matrix
S.No. | Level | Problem | Solution |
---|---|---|---|
1 |
⬆️ Back to Top