Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
ExperiencesCoaching
New
Practice
Mock InterviewsTimed interview simulations with feedbackSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Get started
Dynamic Programming Grid Traversal
00:00
5 left

Dynamic Programming Grid Traversal

HardPython

Problem

PayPal may evaluate two simultaneous paths through a grid of checkout opportunities. Two agents start in the top row, one at the leftmost column and one at the rightmost column, and move to the next row at every step.

Implement max_checkout_value(grid) to return the maximum total value both agents can collect. From column c, an agent may move to c - 1, c, or c + 1. Agents must remain inside the grid. If both agents occupy the same cell in a row, count that cell's value only once.

Formal Specification

  • Input: grid, a non-empty rectangular list of lists of integers, where grid[r][c] is the value at row r, column c.
  • Output: An integer representing the greatest total value collectable by both agents.
  • The first agent starts at (0, 0) and the second starts at (0, columns - 1).
  • Both agents must finish in the last row.

Constraints

  • 2 <= len(grid) <= 70
  • 2 <= len(grid[0]) <= 70
  • 0 <= grid[r][c] <= 100
  • Every row has the same number of columns

Function Signature

def max_checkout_value(grid):
Interviewer

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

You need to log in / sign up to run or submit.
Code
Sign up free to run your codeLog inLn 2
Run your code to see test output here.