Skip to main content

25 Questions

Graphs:

  1. Clone Graph: https://lnkd.in/dV2P2TEs
  2. Course Schedule: https://lnkd.in/de8Q3NBS
  3. 01 Matrix: https://lnkd.in/dV2P2TEs
  4. Number of Islands: https://lnkd.in/drT2MpTz
  5. Rotting Oranges: https://lnkd.in/dUQVwJ-d

Arrays:

  1. Insert Interval: https://lnkd.in/dfcEDFwB
  2. 3Sum: https://lnkd.in/duGvuCjf
  3. Product of Array Except Self: https://lnkd.in/dkGkjQVk
  4. Combination Sum: https://lnkd.in/d3iStbGc
  5. Merge Intervals: https://lnkd.in/dmFZxrVQ

Stacks:

  1. Evaluate Reverse Polish Notation: https://lnkd.in/d-y7Zw4C
  2. Min Stack: https://lnkd.in/dqbh7PeV
  3. Trapping Rain Water: https://lnkd.in/dS_svBAm

Binary Trees:

  1. Binary Tree Level Order Traversal: https://lnkd.in/dM-VYbVB
  2. Lowest Common Ancestor of a Binary Tree: https://lnkd.in/dUvJykgA
  3. Serialize and Deserialize Binary Tree: https://lnkd.in/dW2cP5Wn

Dynamic Programming:

  1. Maximum Subarray: https://lnkd.in/dvjYye6E
  2. Coin Change: https://lnkd.in/d7zZRg7H

Binary Search:

  1. Search in Rotated Sorted Array: https://lnkd.in/dEuh3gie
  2. Time-Based Key-Value Store: https://lnkd.in/dbERGKUB

Strings:

  1. Longest Substring Without Repeating Characters: https://lnkd.in/d_vZrZda
  2. Minimum Window Substring: https://lnkd.in/de8aeeQD

Heap:

  1. K Closest Points to Origin: https://lnkd.in/dUtCqYf4
  2. Find Median from Data Stream: https://lnkd.in/ddDgWqUv

Recursion:

  1. Permutations: https://lnkd.in/dTUqmAfy
Back to top