Practice OpenAI Coding Question | Real Coding Interviews

Quick Summary

Find the maximum score path from a starting column in the top row to any cell in the bottom row.
Movement includes standard diagonal and straight steps plus a constrained skip-one-row jump.
Requires dynamic programming to efficiently track states based on position and remaining jumps.

What This Tests

Common Patterns

Dynamic Programming

Graph Traversal

Test Cases

Input

Output

Expected