Split Array Largest Sum (Python)

Python Interview with a Google engineer

Watch someone solve the split array largest sum problem in an interview with a Google engineer and see the feedback their interviewer left them. Explore this problem and others in our library of interview replays.

Interview Summary

Problem type

Interview question

Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum.

Given an Array[] of N elements and a number K. (1 <= K <= N). Split the given array K subarrays (they must cover all the elements). The maximum subarray sum achievable out of K subarrays formed, must be the minimum possible. Find that possible subarray sum.

Read more about the questions

Interview Feedback

Strengths: TC was able to reach a brute force solution to the problem at hand, with minor hints from the interviewer. TC performed well at the new grad level where they incorporated hints well into their solution. TC used the vertical bars approach pretty well and their code was pretty readable/easy to follow along. TC was able to answer the correct time and space complexity, and their efficacy was also pretty good. TC communicated very well their approach and key issues with the question.

Areas of Improvement: TC can improve their approach by targetting the optimal solution rather than brute force, by practicing more problems like this one.

I would recommend a Leaning Hire decision for new grad level.

I couldn't find anything to point out. I think you're a great interviewer, who understood my messy thoughts and tried to steer me on the right path. Easy to understand, engaged, etc. I also don't know if you came up with the question yourself or it was given by the website, but it showed me where I need to study more, so that's good too.

Interview Transcript

[ interview part continues... ]

The transcript contains details on how the interview progressed, including the problem definition, examples, coding discussions, and interview feedback based on performance during the interview.