Software Development Engineer 2
Maximum Sum Path in a Matrix
Given a matrix, find the maximum sum path from top-left to bottom-right. You can only move right or down at any point in time. For example, given the matrix [[1, 2, 3], [4, 5, 6]], the maximum sum path is 1 → 2 → 5 → 6 = 14.
This question was asked in
Walmart Software Development Engineer 2 Interview Experience
The Walmart interview process was thorough and involved three rounds, covering a range of topics from coding challenges in the first round to behavioral and conceptual questions in the subsequent rounds. Candidates can expect to face programming questions such as reversing a linked list and detecting cycles, alongside discussions on React optimization and project experiences. Overall, the interview was moderately challenging and aimed at assessing both technical knowledge and personal experiences relevant to web development.