🔢 Common Algorithm Problems in Tech Interviews

This wiki stores a collection of popular algorithm problems that often appear in backend or fullstack interviews.

1. Arrays & Strings

• Two Sum
• Longest Substring Without Repeating Characters
• Sliding Window Maximum

2. Linked Lists

• Reverse a Linked List
• Detect Cycle in a Linked List
• Merge Two Sorted Lists

3. Trees

• Binary Tree Inorder Traversal
• Lowest Common Ancestor
• Serialize and Deserialize Binary Tree

4. Dynamic Programming

• Fibonacci (Top-down & Bottom-up)
• Longest Increasing Subsequence
• 0/1 Knapsack

5. Graphs

• BFS & DFS Template
• Detect Cycles in Directed Graph
• Dijkstra’s Algorithm

6. Others

• Top K Frequent Elements
• LRU Cache
• Median of Two Sorted Arrays