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: Fewest Hops (1300) Solve it to start a streak

greedy Problems

32 practice problems tagged greedy , from difficulty 1000 to 2400 — solve them in our in-browser judge with instant verdicts. Browse all problems.

Related: sorting math graphs union-find heap dp strings two-pointers intervals geometry

ProblemTopics Solvers Acceptance Difficulty
Closest Two Values greedy sorting 0 — 1000
Increasing Array greedy 0 — 1100
Flips to Alternate strings greedy 32
44%
1200
Content Children greedy sorting 0 — 1200
One Perfect Trade dp greedy 0 — 1200
Exact Change greedy 0 — 1300
Cover the Demands greedy sorting 0 — 1300
Trade Every Rise greedy 0 — 1300
Joining the Ropes greedy heap 0 — 1300
Boats for Two greedy two-pointers 0 — 1400
Best Pairing greedy sorting 0 — 1400
Can You Reach the End greedy 0 — 1400
Best Dot Product greedy sorting 0 — 1400
Worst Dot Product greedy sorting 0 — 1400
Two Equal Sets math greedy 0 — 1400
Maximum Compatible Meetings greedy intervals 0 — 1500
Longest Zigzag Subsequence dp greedy 0 — 1500
Double or Add One math greedy 0 — 1500
Cheapest Network graphs greedy union-find 0 — 1500
Minimize the Worst Delay greedy sorting 0 — 1500
Largest Concatenation greedy sorting 0 — 1600
Fewest Jumps to the End greedy 0 — 1600
Around the Circuit greedy 0 — 1600
Smallest Impossible Sum greedy sorting 0 — 1600
Fair Candy for Ratings greedy 0 — 1600
Fewest Bounded Pieces greedy 0 — 1700
Broken Calculator math greedy 0 — 1800
Attend the Most Events greedy heap 0 — 1800
The Widest Road Trip graphs greedy union-find 0 — 1900
The Sponsor's Cable graphs greedy union-find 0 — 2000
Fewest Refuels greedy heap 0 — 2000
Connecting Cities by Grid geometry greedy 0 — 2400