Data Structures :-

Data Structures is a way of storing / Organizing data in the memory, in such a way that access, management and modification become efficient.

Algorithms :-

Algorithms is any approach you use to perform operations on data (like searching, sorting, traversing, ..Etc.).

1. Data Structures

   1. LinkedList

      1. Singly LinkedList
      2. Doubly LinkedList
      3. Circular LinkedList

   2. Stack

      1. Stack Using Array

      2. Stack Using LinkedList

      3. Queue

      4. Stack Using Queue

      5. Problems on Infix Prefix Postfix

   3. Queue

      1. Queue Using Array

      2. Queue Using LinkedList

      3. Queue Using Stack

      4. Circular Queue using array

      5. Circular Queue using LinkedList

      6. DeQueue using circular array

      7. Priority Queue

   4. Recursion

   5. Tree DS

      1. Introduction to BinaryTree

      2. Binary Search Tree & Implementations

      3. AVL Tree & Implementations

      4. Trie DS & Implementations

      5. Heap DS & Implementations

   6. ArrayList (Comments are too good to understand the working)
   7. HashMap (Comments are too good to understand the working)
   8. Graphs (Raw Notes®️)

2. Algorithms

   1. Arrays (45+ Questions including LoveBabar DSA sheet + Striver SDE sheet Qs)
   2. Matrix (8 Questions)
   3. Binary Search Busted (15+ Questions)
   4. Sliding Window Bombed💣 (15+ Questions)
   5. Searching & Sorting (30+ Questions)
   6. Recursions 25+ Questions Banged👅(Very Important before starting with Strings)
   7. Dynamic Programming Busted😈(Very Important before starting with Strings)
   8. Now Strings (40+ Questions)
   9. LinkedList(30+ Questions including LoveBabar DSA sheet + Striver SDE sheet Qs)
   10. Trees(50+ Questions)
   11. Stack & Queue(40+ Questions)
   12. Bit Manipulations(10+ Questions)
   13. Heap(20 Questions)
   14. Trie(6 Questions)
   15. Graphs(40+ Questions)
   16. Dynamic Programming(50+ Questions)