DSA.md

DSA Notes

Index

---

Index

• Index
• ToDO:
• Abstract Data Types
• Arrays
• Searching
• Sorting
• LinkedList
• Stack
• Queue
• Hash DS
• Bit-Manipulation
• Recursion
• Trees
• Graphs
• Shortest Path
• Minimum Spanninh Tree
• Problem Solving Techniques
• Miscellaneous
• Famous Problems

---

💡NOTE💡

These notes are only created for Java DSA !!

ToDO:

1. Code in C++, Java, and Python
2. Code with in-built template lbraries of C++, Java and Python
3. CURD Operation on All Data Structures
4. Time and Space Complexity Analysis

---

Abstract Data Types

1. Abstract Data Types (ADT)

Arrays

2. Arrays
3. Matrix / 2D Array

Searching

4. Linear Search
5. Binary Search

Sorting

6. Bubble Sort
7. Selection Sort
8. Insertion Sort
9. Quick Sort
10. Counting Sort
11. Radix Sort
12. Merge Sort
13. Topological Sort
14. Cycle Sort

LinkedList

13. Linked List
14. Singly Linked List
15. Doubly Linked List
16. Circular Linked List
17. Circular Doubly Linked List

Stack

18. Stack

Queue

19. Queue

Hash DS

20. Hash Table
21. Hash Set
22. Hash Map

Bit-Manipulation

23. Bit-Manipulation

Recursion

24. Recursion

Trees

25. Trees
26. Binary Tree
27. Pre-Order Traversal
28. In-Order Traversal
29. Post-Order Traversal
30. Level-Order Traversal
31. Array Implementation
32. Binary Search Tree
33. AVL Tree
34. B Tree
35. B+ Tree
36. Red-Black Tree

Graphs

37. Graph
38. BFS
39. DFS

Shortest Path

35. Shortest Path
36. Dijkstra's Algorithm
37. Bellman-Ford

Minimum Spanninh Tree

38. Minimum Spanning Tree
39. Prim's Algorithm
40. Kruskal's Algorithm

Problem Solving Techniques

2 Pointers Sliding Window Prefix Sum Fast and Slow Pointers Divide and Conquer Recursion Dynamic Programming Greedy Algorithms Backtracking Top 'K' Elements

Miscellaneous

1. Euclidean Algorithm
2. Huffman Coding
3. Traveling Salesman Problem
4. The 0/1 Knapsack Problem
5. Memoization
6. Tabulation

Famous Problems

1. Fibonacci Series
2. Palindrome Check
3. Sudoko Solver