Blinkit
Software Development Engineer 1
Maximum Matrix Sum
Medium
DSAcodingCandidate Selected
Given an integer matrix, maximize its sum by repeatedly flipping the signs of two adjacent elements. Example Input: [[1, -2], [3, 4]], Example Output: 10.
This question was asked in
Blinkit Software Development Engineer 1 Interview Experience
My interview experience with Blinkit comprised three rounds focusing on DSA problems, system design, and behavioral questions. In the first round, I tackled two DSA challenges related to maximizing units in a truck and maximizing sums in a matrix. The subsequent rounds covered system design intricacies, project discussions, and technical comparisons, reflecting a medium overall difficulty, while the interviewers maintained a constructive and engaging atmosphere.