Skip to main content

Data Structures and Algorithms Interviews

This type of technical interview is widely prevalent.

Discover practical applications that transcend theoretical complexities, such as time and space complexity denoted by big O notation. For instance, the significance of a HashMap becomes apparent when managing a considerable item count (e.g., 60k) compared to a linear array search.

Understand the time and space complexities linked with each structure and algorithm. Prepare to implement any of these using your preferred programming language.

Fundamentals​

Dive deep into the implementation and intricacies of essential data structures and algorithms, which form the backbone of technical interview questions.

  • Stacks
  • Queues
  • Arrays
  • Linked Lists
  • Binary Heaps (Priority Queues)
  • Dictionaries (Hash Tables)
  • Graphs
    • Breadth-First Search
    • Depth-First Search
  • Binary Search
  • Recursion
  • Merge Sort (including divide and conquer)
  • Quick Sort (including Quick Select)
  • Tree Traversals (both iterative and recursive)
    • Pre-order
    • In-order
    • Post-order

Broaden your expertise with essential concepts frequently encountered in interview problems.

  • Graphs
    • Disjoint Set (Union-Find)
    • Topological Sort (Recursive and Iterative)
    • Dijkstra's Algorithm
    • Floyd's Tortoise and Hare Algorithm
    • Kruskal's Minimum Spanning Tree Algorithm
  • Quickselect (Utilized in Quicksort)
  • Amortized Complexity
  • Dynamic Programming (iterative and recursive with memoization)
  • Backtracking Algorithm
  • Greedy Algorithm
  • Trie (Prefix Trees)
  • Two Pointers Technique
  • Sliding Window Technique
  • Game Design & Object Oriented Programming

Advancing Further​

Deepen your knowledge with pivotal concepts that are rarely encountered in interview problems.

  • Floyd-Warshall algorithm
  • Bellman-Ford algorithm
  • Rabin-Karp algorithm
  • Tarjan's Strongly Connected Components algorithm
  • Knuth-Morris-Pratt (KMP) algorithm
  • Manchester algorithm
  • Bit manipulation techniques (explore various tricks in this domain)
  • Fenwick tree