syllabus for DSA

[[Super 30]]

  • [[1. Basic Java]]
  • [[2.DSA/2. Conditions and loops]]
  • [[loops questions for interviews]]
  • [[2. oops in java]]
  • [[Switch Cases and Statements in java]]
  • [[functions in java]]
  • [[3. Time and Space Complexity]]
  • [[Strings and StringBuilder in java]]
  • [[string questions]]
  • [[Mathematics for DSA]]
  • Searching algorithms
    • [[Linear Search Algorithm]]
    • [[Binary search Algorithm]]
    • [[Binary Search Algo Questions]]
    • [[Binary search in 2d arrays]]
    • [[String Questions]]
  • sorting algorithms
    • [[1. Bubble sort]]
    • [[2. Selection sort]]
    • [[3. insertion sort]]
    • [[4. Merge sort ]]
    • Quick sort
    • Heap sort
  • [[4. Patterns]]
  • [[5. Recursion]]
  • [[Arrays]]
  • [[Array Questions]]
  • [[Java recursion problems solved can be asked in interview]]
  • [[6. Backtracking]]
  • [[1. Linked List]]
  • [[Linked list code.canvas|Linked list code]]
  • [[Stack]]
  • [[Call Stack - function call stack]]
  • Queue
  • Binary Tree
  • BST
  • HashSet
  • HashMap
  • Trie
  • Graph