Watch a technical mock interview with a Google engineer
Ferocious Sandwich, a Google engineer, interviewed Immutable Catamaran in Python
Share
Summary

Problem type

Split Array Largest Sum

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. Input : Array[] = {1, 2, 3, 4}, K = 3 Output: 4 Optimal Split is { 1, 2}, { 3}, { 4}.Maximum sum of all subarrays is 4, which is minimum possible for 3 splits. Input : Array[] = { 1, 1, 2} K = 2 Output: 2

Feedback

Feedback about Immutable Catamaran (the interviewee)

Advance this person to the next round?
Yes
How were their technical skills?
3/4
How was their problem solving ability?
4/4
4/4
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

Feedback about Ferocious Sandwich (the interviewer)

Would you want to work with this person?
Yes
How excited would you be to work with them?
4/4
How good were the questions?
4/4