-
Familiarise with language
- Do Basic Ad-hoc problems use Hackerrank (preferred) or CodeChef DSA Series
-
Start with Basic Mathematics problems[Hackerrank]
-
Learn about time and space complexity expect for recursion
- Summations and Bounding Summations
-
Learn about Basic data-structures, and the build-libraries the language provide
- Arrays 2 Questions
- String 2 Questions
- Linked List 2 Questions
- Stack
- Queue 2 Questions
Start with EASY problems on Leetcode for the learned DS
-
Linear and Logarithmic algorithms(no-recursion)
- Sorting:
- In-place sorting:
- Insertion Sort
- Selection Sort
- Bubble Sort
- Searching:
- Linear Search:
- Logarithmic Search:
- Sorting:
-
Recursion starts
-
Basics
-
Time and space complexity
-
- Divide & Conquer
- Greedy
- Dynamic Programming
Links: https://www.codechef.com/certification/data-structures-and-algorithms/prepare#foundation