💥 -The Syllabus For Week 1 Mentioned Below:

1. Time Complexity ⏰
2. Proof Of Correctness
3. Asymptotic analysis(Big-O notation) ⭕
4. Stack And Queus
5. Linked List
6. Trees 🌲
7. Hashing

💥 -The Syllabus For Week 2 Mentioned Below:

1. Divide And Conquer
2. Greedy Algorithm 🌚
3. Backtracking
4. Dynamic Programming 🙏
5. Graphs:[ B.F.S | D.F.S | M.S.T ] 📢
6. Search And Sort Algorithms

Some Other Resorces

• Books you can follow

Video Series

• Video Series 1
• Video Series 2
• Video Series 3

Repos to Follow

• awesome-courses
• xtaci/algorithms
• JavaScript Data Structures