Problem
Given an array of integers, find the contiguous subarray that has the largest sum (Kadane's Algorithm).
Practicing as: Data Engineer interview at InformaticaHi, I'll play your Informatica interviewer for the Data Engineer role. Candidates describe these interviews as mostly positive and moderately difficult, so expect me to be friendly and conversational. Take your time with the question above and answer like we're in the room.
You are practicing as a guest. Sign up free to get your answer graded with AI feedback. Your draft stays right here.
