Skip to content

Latest commit

 

History

History
25 lines (22 loc) · 681 Bytes

File metadata and controls

25 lines (22 loc) · 681 Bytes

Must know algoriths for interview

  1. Depth First Search
  2. Breadth First Search
  3. Matching paranthesis
  4. Hash Tables
  5. Variables/Pointers manipulation
  6. reverse linked list (duplicates , removing duplicates)
  7. sorting fundamentals (quicksort, mergesort, bubblesort techniques, runtime of a sort, time space complexity)
  8. Recursion
  9. Custom data structures (object oriented programming)
  10. Binary search

Others:

  1. Logarithm (Complexity Analysis)
  2. Graph Traversals (BFS & DFS)
  3. Binary Search
  4. Sliding Window
  5. Recursion
  6. 2 Algorithms (Inverting a binary tree & Reverse a Linked List)
  7. Suffix Trees
  8. Heaps
  9. DP
  10. Sorting Algorithms (Quick & Merge)