A

Arcesium

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

Showing 20 of 20 questions

1
MediumMaximum Length of Subarray With Positive Productβœ“ Our Solution
100
ArrayDynamic ProgrammingGreedy
2
HardCycle Length Queries in a Treeβœ“ Our Solution
100
ArrayTreeBinary Tree
3
MediumCount Collisions on a Roadβœ“ Our Solution
98
StringStackSimulation
4
MediumMaximize the Confusion of an Examβœ“ Our Solution
98
StringBinary SearchSliding WindowPrefix Sum
5
MediumNumber of People Aware of a Secretβœ“ Our Solution
98
Dynamic ProgrammingQueueSimulation
6
HardPartition Array Into Two Arrays to Minimize Sum Differenceβœ“ Our Solution
95
ArrayTwo PointersBinary SearchDynamic Programming+3
7
MediumHouse Robberβœ“ Our Solution
81
ArrayDynamic Programming
8
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
75
ArrayBinary Search
9
MediumPossible Bipartitionβœ“ Our Solution
75
Depth-First SearchBreadth-First SearchUnion FindGraph
10
MediumStone Game VIβœ“ Our Solution
75
ArrayMathGreedySorting+2
11
HardBinary Tree Maximum Path Sumβœ“ Our Solution
68
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
12
HardFind the Count of Monotonic Pairs Iβœ“ Our Solution
68
ArrayMathDynamic ProgrammingCombinatorics+1
13
MediumNext Permutationβœ“ Our Solution
68
ArrayTwo Pointers
14
HardBest Time to Buy and Sell Stock IVβœ“ Our Solution
58
ArrayDynamic Programming
15
HardMinimum Insertion Steps to Make a String Palindromeβœ“ Our Solution
58
StringDynamic Programming
16
MediumEdit Distanceβœ“ Our Solution
58
StringDynamic Programming
17
MediumMaximum Product Subarrayβœ“ Our Solution
58
ArrayDynamic Programming
18
MediumSurrounded Regionsβœ“ Our Solution
58
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
19
MediumSort Colorsβœ“ Our Solution
58
ArrayTwo PointersSorting
20
MediumPow(x, n)βœ“ Our Solution
58
MathRecursion