Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Practice Problems

Daily Challenge: Tree or Not (1300) Solve it to start a streak

Practice Problems — 1200-1600

ProblemTopics Solvers Acceptance Difficulty
Minimum Swaps to Sort math sorting 0 — 1500
The Busiest Moment intervals sorting 0 — 1500
Maximum Compatible Meetings greedy intervals 0 — 1500
The Next Prime math number-theory 0 — 1500
Modular Inverse math 0 — 1500
Binomial Coefficient math combinatorics 0 — 1500
Distributing Identical Coins math combinatorics 0 — 1500
Longest Zigzag Subsequence dp greedy 0 — 1500
The K-th Missing Number binary-search 0 — 1500
Fewest Coins dp 0 — 1500
Counting Coin Combinations dp 1
33%
1500
Decode the Message strings dp 1
100%
1500
Exact Subset Sum dp 1
100%
1500
Paths Around the Walls dp 0 — 1500
Two Teams bfs graphs 0 — 1500
Knight's Journey bfs graphs 0 — 1500
Largest Proper Subtree trees 0 — 1500
Lowest Common Ancestor trees 0 — 1500
Plausible Stack Story stack 0 — 1500
Double or Add One math greedy 0 — 1500
The Two Jugs math 0 — 1500
Classic Nim math bitwise games 0 — 1500
Area of a Polygon geometry 0 — 1500
Three That Sum to T sorting two-pointers 0 — 1500
Anagram Windows strings sliding-window 0 — 1500
Grand Digit Total math 0 — 1500
All the Gaps math sorting 0 — 1500
Sum of Pair Minimums math sorting 0 — 1500
Sum of Pair Maximums math sorting 0 — 1500
Fairest Split bitwise brute-force 0 — 1500
Nearest Smaller to the Left stack 0 — 1500
Balanced Stretch prefix-sums 0 — 1500
Divisible Subarray Sums math prefix-sums 0 — 1500
Ones with K Flips sliding-window two-pointers 0 — 1500
The Widest Container two-pointers 0 — 1500
Insert an Interval intervals 0 — 1500
Longest Border strings 0 — 1500
Rectangle Sum Queries prefix-sums 0 — 1500
Cheapest Network graphs greedy union-find 0 — 1500
Prime Power in a Factorial number-theory 0 — 1500
All the Borders strings kmp 0 — 1500
Longest Mountain two-pointers 0 — 1500
Counting Routes in a DAG dp graphs 0 — 1500
Strings Without Adjacent Ones dp matrix-exponentiation 0 — 1500
Strictly Climbing Digits digit-dp 0 — 1500
Cayley's Forest combinatorics graphs 0 — 1500
Minimize the Worst Delay greedy sorting 0 — 1500
Maximum Product Subarray dp 0 — 1500
Maximum Sum Increasing Subsequence dp 0 — 1500
Smallest Period strings 0 — 1600