DSA

DSA Learning path

Learn Data Structure and Algorithms

1. Array
2. String
3. Divide and Conquer Algorithm
4. Searching Algorithm
5. Sorting Algorithm
6. Stack
7. Queue
8. Linked List
9. Tree Data Structure
10. Graph Data Structure
11. Greedy Methodology
12. Recursion
13. Backtracking Algorithm
14. Dynamic Programming

Big-O Notation (Ο) – Big-O notation specifically describes the worst-case scenario.

Omega Notation (Ω) – Omega(Ω) notation specifically describes the best-case scenario.

Theta Notation (θ) – This notation represents the average complexity of an algorithm.