S

Sprinklr

41 questions tracked38 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 41 of 41 questions

1
HardMinimum Edge Weight Equilibrium Queries in a Treeβœ“ Our Solution
100
ArrayTreeGraphStrongly Connected Component
2
HardApply Operations on Array to Maximize Sum of Squaresβœ“ Our Solution
95
ArrayHash TableGreedyBit Manipulation
3
MediumNext Greater Numerically Balanced Numberβœ“ Our Solution
92
Hash TableMathBacktrackingCounting+1
4
HardMaximize Score After N Operationsβœ“ Our Solution
92
ArrayMathDynamic ProgrammingBacktracking+3
5
HardMaximum Score of Non-overlapping Intervalsβœ“ Our Solution
90
ArrayBinary SearchDynamic ProgrammingSorting
6
HardClosest Subsequence Sumβœ“ Our Solution
90
ArrayTwo PointersDynamic ProgrammingBit Manipulation+2
7
HardMinimum Time to Revert Word to Initial State IIβœ“ Our Solution
90
StringRolling HashString MatchingHash Function
8
MediumChoose Edges to Maximize Score in a Tree
90
Dynamic ProgrammingTreeDepth-First Search
9
MediumNumber of Same-End Substrings
90
ArrayHash TableStringCounting+1
10
HardCount the Number of Powerful Integersβœ“ Our Solution
90
MathStringDynamic Programming
11
HardCreate Components With Same Valueβœ“ Our Solution
90
ArrayMathTreeDepth-First Search+1
12
MediumMinimum Time to Revert Word to Initial State Iβœ“ Our Solution
90
StringRolling HashString MatchingHash Function
13
MediumApply Bitwise Operations to Make Strings Equalβœ“ Our Solution
90
StringBit Manipulation
14
MediumMaximum Subarray Sum After One Operation
90
ArrayDynamic Programming
15
HardNumber of Great Partitionsβœ“ Our Solution
90
ArrayDynamic Programming
16
MediumAsteroid Collisionβœ“ Our Solution
85
ArrayStackSimulation
17
HardRobot Collisionsβœ“ Our Solution
73
ArrayStackSortingSimulation
18
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
68
ArrayHash TableMathDesign+1
19
MediumNumber of Provincesβœ“ Our Solution
68
Depth-First SearchBreadth-First SearchUnion FindGraph
20
MediumMinimize the Difference Between Target and Chosen Elementsβœ“ Our Solution
68
ArrayDynamic ProgrammingMatrix
21
HardSerialize and Deserialize Binary Treeβœ“ Our Solution
68
StringTreeDepth-First SearchBreadth-First Search+2
22
MediumMinimum Number of Food Buckets to Feed the Hamstersβœ“ Our Solution
68
StringDynamic ProgrammingGreedy
23
MediumValidate IP Addressβœ“ Our Solution
60
String
24
MediumPartition Labelsβœ“ Our Solution
60
Hash TableTwo PointersStringGreedy
25
HardMax Points on a Lineβœ“ Our Solution
60
ArrayHash TableMathGeometry
26
MediumContainer With Most Waterβœ“ Our Solution
60
ArrayTwo PointersGreedy
27
MediumSet Matrix Zeroesβœ“ Our Solution
60
ArrayHash TableMatrix
28
HardTrapping Rain Waterβœ“ Our Solution
60
ArrayTwo PointersDynamic ProgrammingStack+1
29
HardLargest Rectangle in Histogramβœ“ Our Solution
51
ArrayStackMonotonic Stack
30
MediumSort Colorsβœ“ Our Solution
51
ArrayTwo PointersSorting
31
HardFirst Missing Positiveβœ“ Our Solution
51
ArrayHash Table
32
MediumLongest Univalue Pathβœ“ Our Solution
51
TreeDepth-First SearchBinary Tree
33
HardRussian Doll Envelopesβœ“ Our Solution
51
ArrayBinary SearchDynamic ProgrammingSorting
34
MediumSum of Matrix After Queriesβœ“ Our Solution
51
ArrayHash Table
35
MediumLRU Cacheβœ“ Our Solution
51
Hash TableLinked ListDesignDoubly-Linked List
36
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
51
ArrayDynamic Programming
37
HardCount Valid Paths in a Treeβœ“ Our Solution
51
MathDynamic ProgrammingTreeDepth-First Search+1
38
HardLongest Valid Parenthesesβœ“ Our Solution
51
StringDynamic ProgrammingStack
39
MediumSingle Element in a Sorted Arrayβœ“ Our Solution
51
ArrayBinary Search
40
51
ArrayTwo PointersSorting
41
MediumSum of Subarray Minimumsβœ“ Our Solution
51
ArrayDynamic ProgrammingStackMonotonic Stack