Python interview with a Google engineer: Split Array Largest Sum

This is a mock Python Google interview where the prospective candidate must tackle a new grad level Algorithms and Data Structures question from a Google Engineer. The question "Split Array Largest Sum" requires candidates to split a given array into K sub arrays, while minimizing the maximum sum out of K sub array. In this video, you will see an attempt at a brute force solution to the question. Watch until the end to find out an optimal solution from the Google Engineer! Get $100 off your first professional mock interview with this link!: https://iio.sh/r/CQ76 Check out feedback from the Google interviewer and the full transcript on https://interviewing.io/recordings/Python-Google-29 Or view other python interviews: https://interviewing.io/python-interview-questions ❗ Disclaimer: All interviews are shared with explicit permission from the interviewer and the interviewee, and all interviews are anonymous. interviewing.io has the sole right to distribute this content. TIMESTAMPS 00:00 - Introduct