Ways to Split Array Into Three Subarrays at Tekion
Medium34.1% acceptance
This problem has 62.5% frequency at Tekion.
Problem Description
A split of an integer array is **good** if: * The array is split into three **non-empty** contiguous subarrays - named `left`, `mid`, `right` respectively from left to right. * The sum of the elements in `left` is less than or equal to the sum of the elements in `mid`, and the sum of the elemen...
Read full problem and hintsTopics
Also asked at 2 companies
More Tekion Questions
Count the Number of Infection SequencesHardTrapping Rain WaterHardProduct of Array Except SelfMediumBest Time to Buy and Sell Stock IIIHardSplit Array Largest SumHard
View all Tekion questions