Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3432. Count Partitions with Even Sum Difference
Count the number of split indices i (0 <= i < n-1) where the sum difference between the left and right subarrays is even; note that the difference is even iff the total array sum is even, so the answer is n-1 when the total sum is even and 0 otherwise.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.