← OYO questions

Jumps, median of stream, and min cost path

Filed under OYO

Solve three classic problems: 1) Minimum number of jumps to reach the end of an array. 2) Find the median of a running stream of integers. 3) Find the minimum cost path from top-left to bottom-right…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related OYO questions

Collected from public candidate posts and coding forums. Updated Nov 2026.