Ways to Split Array Into Three Subarrays at Robinhood
Medium34.1% acceptance
This problem has 100.0% frequency at Robinhood.
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 Robinhood Questions
Restore the Array From Adjacent PairsMediumNumber of Orders in the BacklogMediumCount Good MealsMediumCheck if There is a Valid Path in a GridMediumCount the Number of Consistent StringsEasy
View all Robinhood questions