Curriculum

1. 00 Welcome

   3 lessons

   1. 01 Welcome - QA
   2. 02 Basics Structure Classes and Pointers Review
   3. 03 DS Intro - Vector1

2. 01 Vector

   1 lesson

   1. 04 Vector 2

3. 02 Complexity

   2 lessons

   1. 04 Complexity 1
   2. 05 Complexity 1

4. 03 Singly Linked List

   2 lessons

   1. 06 Singly-LinkedList 1
   2. 07 Singly-LinkedList 2

5. 04 Doubly Linked List

   1 lesson

   1. 08 Doubly Linked List

6. 05 Stack

   2 lessons

   1. 09 Stack 1
   2. 10 Stack 2

7. 06 Queue

   1 lesson

   1. 11 Queue

8. 07 Binary Tree

   6 lessons

   1. 12 Binary Tree 1
   2. 13 Binary Tree 2
   3. 14 Binary tree
   4. 15 Problem-Solving - Is Full - Is Perfect - Diameter
   5. 16 Diameter Code - Level Order Traversal
   6. 17 Unique Representation

9. 08 Binary Search Tree

   3 lessons

   1. 18 BST Intro
   2. 19 BST Successor - deletion
   3. 20 BST Deletion

10. 09 Heap

    1 lesson

    1. 21 Heap

11. 10 Trie

    1 lesson

    1. 22 Trie - UVA problem

12. 11 AVL Tree

    1 lesson

    1. 23 AVL

13. 01 Sorting

    3 lessons

    1. 26 Sorting 1
    2. 26 Sorting 2
    3. 27 Sorting 3 - problem solving

14. 02 Binary Search

    3 lessons

    1. 28 Binary Search 1
    2. 29 Binary Search 2
    3. 30 Binary Search 3 real values - Intro to graph

15. 03 Graph (Part1)

    8 lessons

    1. 31 Graph Repr - DFS
    2. 32 DFS on Matrix
    3. 33 DFS Reduction - Edge Classification
    4. 34 DFS Reduction
    5. 35 BFS
    6. 36 BFS
    7. 37 Topo Sort 1
    8. 38 Topo Sort 2

16. 04 Dynamic Programming

    13 lessons

    1. 39 DP Intro - Knacpsack intro
    2. 40 Knapsack 2
    3. 41 LIS
    4. 42 LCS
    5. 43 Pick Or Leave Solving
    6. 44 Brute-forcing edit distance
    7. 45 Integer break
    8. 46 DP Ranges
    9. 47 DP Ranges Solving
    10. 48 DP Counting
    11. 49 DP on Grid
    12. 50 Build Output
    13. 51 Tabulation 2

17. 05 Backtrack

    2 lessons

    1. 50 Backtracking 1
    2. 51 Backtracking 2

18. 06 Divide and Conquer

    2 lessons

    1. 52 Merge and Quick Sort
    2. 53 Complexitity

19. 07 Graph (Part2)

    6 lessons

    1. 53 Graph - Floyd
    2. 54 Graph - BellmanFord
    3. 55 Graph - Dijkstra 1
    4. 56 Graph - Dijkstra 2 - Node split
    5. 57 Graph - MST - Prime
    6. 58 Graph - MST - Kruskal