← Chargebee questions
CodingMedium

Array Partitions and Shortest Path in Maze with Obstacles

Filed under Chargebee

The question

Solve two coding questions: one based on dynamic programming related to finding partitions in an array (similar to measuring weights), and another to find the shortest path distance in a maze with two types of obstacles considering one obstacle at a time.

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

Related Chargebee questions

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