โ† OYO questions

Min cost path, balloon burst, matrix replacement, and Scooby snack chapters

Filed under OYO

The question

Solve coding problems including finding minimum cost to reach grid end, balloon burst to maximize coins, replacing 'O' with 'X' if surrounded by 'X', and finding the optimal period to give a K-period effective Scooby-snack to maximize chapters covered given sleep patterns.

No write-up yet. Related questions below have one.

Related OYO questions

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