The course because of which this whole project came up

• Algorithms Part I offered by Princeton University
• Algorithms Part II offered by Princeton University

This is a collection of all the Data Structures & Algorithms that are taught in the above-mentioned courses. I have tried to practice all the things that are taught, and then I have tried to compile all of them in a documented manner. I learned so many things even though I was familiar with the concepts but this course helped me think differently. This course also helped me to understand the use of all the data structures and algorithms with the help of real-life examples.

👉 Algorithms Part I

• Union Find
  • Quick Find
  • Quick Union
  • Weighted Quick Union
  • Quick Union with Path Compression
• Bag
• Stack
• Queue
• Sorting Algorithms
  • Selection Sort
  • Insertion Sort
  • Heap Sort
  • Merge Sort
  • Quick Sort
• Binary Heap Tree
• Symbol Table
  • Ordered Symbol Table
    • Binary Search Tree (BST)
    • Red Black BST
  • Unordered Symbol Table
    • LinearProbing
    • SeparateChaining

👉 Algorithms Part II (In Progress)

• Contain Graphs, DFS, BFS, Minimum Spanning Tree, Shorted Path, etc. I will be adding index once it is completed

• To study Algorithms Part 1
• To practice and push the code for Algorithms Part 1
• To add comments and Readme in every major package in Algorithms Part 1
• To study Algorithms Part 2 (In Progress)
• To practice and push the code for Algorithms Part 2 (In Progress)
• To add comments and Readme in every major package in Algorithms Part 2

⚡ Thanks to Princeton University and all the people who worked together to make these two AMAZING Courses