Number of Great Partitions at Sprinklr
Hard33.3% acceptance
This problem has 87.5% frequency at Sprinklr.
Problem Description
You are given an array `nums` consisting of **positive** integers and an integer `k`. **Partition** the array into two ordered **groups** such that each element is in exactly **one** group. A partition is called great if the **sum** of elements of each group is greater than or equal to `k`. Return...
Read full problem and hintsTopics
Also asked at 1 company
More Sprinklr Questions
Create Components With Same ValueHardMinimum Edge Weight Equilibrium Queries in a TreeHardApply Operations on Array to Maximize Sum of SquaresHardCount the Number of Powerful IntegersHardClosest Subsequence SumHard
View all Sprinklr questions