Featured

Python interview with a Google engineer: Split Array Largest Sum



Published
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!

Category
Job
Be the first to comment