Temu | Software engineer | Coding | Phone Screen

Problem Statement (Polished): You are given an integer array delta , for example: [1, 3, 2, 8] . You start with an initial sum of 0 and traverse the array from left to right. At each index i , you add delta[i] to your running sum. Your goal is to ensure that the running sum is never negative at any point during the traversal. Allowed Operation (Reset): If adding a value causes the running sum to become negative, you...