Data Structures

  • Arrays
  • Linked lists
  • Stacks
  • Queues
  • Trees
  • Graphs
  • Hash tables
  • Heaps
  • Tries
  • Balanced search trees (AVL trees, Red-black trees)
  • Skip lists
  • Bloom filters
  • Segment trees
  • Fenwick trees (Binary Indexed Trees)
  • Suffix arrays
  • Suffix trees
  • Linear search
  • Binary search
  • Bubble sort
  • Insertion sort
  • Selection sort
  • Merge sort
  • Quick sort
  • Heap sort
  • Depth-first search (DFS)
  • Breadth-first search (BFS)
  • Dijkstra’s algorithm (for shortest path)
  • A* algorithm (for pathfinding)
  • Bellman-Ford algorithm (for shortest path with negative weights)
  • Kruskal’s algorithm (for minimum spanning tree)
  • Prim’s algorithm (for minimum spanning tree)