This project covers the foundations of Data Structures including Arrays, Linked Lists, Queues, Recursion, Trees, Maps, and Hashing.

This project covers basic algorithms including Binary Search, Heaps, Tries, Sorting Algorithms (Bubble, Merge, Quick, and Heap sort), and Divide and Conquer Algorithms.

This project covers advanced algorithms including Greedy Algorithms, Graph Algorithms, and Dynamic Programming. The final project utilized the A* Algorithm to create a route planner.