JobsJob TrackerJob alerts

PhonePe · 108 questions

All 108Coding 56System Design 20Low-Level Design 9Behavioral 12Product Sense 2
  • Maximum path sum in a matrix with diagonal/down movesCoding
  • Build a rate limiter as running codeLow-Level Design
  • Explain SOLID principles in a machine coding submissionLow-Level Design
  • Make an in-memory booking system thread-safeLow-Level Design
  • Why PhonePe?Behavioral
  • Why should we hire you?Behavioral
  • What are your strengths and weaknesses?Behavioral
  • Where do you see yourself in 5 years?Behavioral
← PhonePe questions
  1. Interview questions
  2. PhonePe
  3. Maximum path sum in a matrix with diagonal/down moves
Coding

Maximum path sum in a matrix with diagonal/down moves

Filed under PhonePe

The question

Given an N*M matrix filled with integers, find the maximum path sum starting from any cell in the first row to any cell in the last row, moving only down, down-left diagonal, or down-right diagonal.

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

Related PhonePe questions

  • Split array largest sum variant
  • Minimum-cost graph coloring with four colors
  • Maximize the number of people who pass a test
  • Check whether B is the 'saddest' permutation of A
  • Sum of minimum elements of all subarrays
Build a rate limiter as running code →

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