Sprinklr
45 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2440. Create Components With Same Value | Hard | 100% | TopicsArrayMathTreeDepth-First SearchEnumeration |
| 3414. Maximum Score of Non-overlapping Intervals | Hard | 95.3% | TopicsArrayBinary SearchDynamic ProgrammingSorting |
| 2846. Minimum Edge Weight Equilibrium Queries in a Tree | Hard | 89.6% | TopicsArrayDynamic ProgrammingBit ManipulationTreeDepth-First Search |
| 2518. Number of Great Partitions | Hard | 89.6% | TopicsArrayDynamic Programming |
| 2546. Apply Bitwise Operations to Make Strings Equal | Medium | 89.6% | TopicsStringBit Manipulation |
| 2897. Apply Operations on Array to Maximize Sum of Squares | Hard | 89.6% | TopicsArrayHash TableGreedyBit Manipulation |
| 2048. Next Greater Numerically Balanced Number | Medium | 89.6% | TopicsHash TableMathBacktrackingCountingEnumeration |
| 2999. Count the Number of Powerful Integers | Hard | 89.6% | TopicsMathStringDynamic Programming |
| Number of Same-End Substrings | Medium | 89.6% | TopicsArrayHash TableStringCountingPrefix Sum |
| 3031. Minimum Time to Revert Word to Initial State II | Hard | 89.6% | TopicsStringRolling HashString MatchingHash Function |
| 3029. Minimum Time to Revert Word to Initial State I | Medium | 89.6% | TopicsStringRolling HashString MatchingHash Function |
| 1755. Closest Subsequence Sum | Hard | 89.6% | TopicsArrayTwo PointersDynamic ProgrammingBit ManipulationMeet in the MiddleSortingBitmask |
| Maximum Subarray Sum After One Operation | Medium | 89.6% | TopicsArrayDynamic Programming |
| 1799. Maximize Score After N Operations | Hard | 89.6% | TopicsArrayMathDynamic ProgrammingBacktrackingBit ManipulationNumber TheoryBitmask |
| Choose Edges to Maximize Score in a Tree | Medium | 89.6% | TopicsDynamic ProgrammingTreeDepth-First Search |
| 1031. Maximum Sum of Two Non-Overlapping Subarrays | Medium | 86.2% | TopicsArrayDynamic ProgrammingSliding Window |
| 134. Gas Station | Medium | 82.3% | TopicsArrayGreedy |
| Asteroid Collision | Medium | 72% | TopicsArrayStackSimulation |
| 907. Sum of Subarray Minimums | Medium | 72% | TopicsArrayDynamic ProgrammingStackMonotonic Stack |
| 205. Isomorphic Strings | Easy | 72% | TopicsHash TableString |
| 560. Subarray Sum Equals K | Medium | 72% | TopicsArrayHash TablePrefix Sum |
| 975. Odd Even Jump | Hard | 64.6% | TopicsArrayDynamic ProgrammingStackSortingMonotonic StackOrdered Set |
| 1463. Cherry Pickup II | Hard | 64.6% | TopicsArrayDynamic ProgrammingMatrix |
| 295. Find Median from Data Stream | Hard | 64.6% | TopicsTwo PointersDesignSortingHeap (Priority Queue)Data Stream |
| Max Points on a Line | Hard | 54.4% | TopicsArrayHash TableMathGeometryEuclidean AlgorithmGreatest Common Divisor |
