I

Intuit

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

Showing 73 of 73 questions

1
HardMinimum Number of Taps to Open to Water a Gardenβœ“ Our Solution
100
ArrayDynamic ProgrammingGreedy
2
EasyValid Parenthesesβœ“ Our Solution
95
StringStack
3
MediumCourse Schedule IIβœ“ Our Solution
93
Depth-First SearchBreadth-First SearchGraphTopological Sort
4
MediumMost Profitable Path in a Treeβœ“ Our Solution
93
ArrayTreeDepth-First SearchBreadth-First Search+1
5
EasyMaximum Product of Three Numbersβœ“ Our Solution
91
ArrayMathSorting
6
MediumLRU Cacheβœ“ Our Solution
89
Hash TableLinked ListDesignDoubly-Linked List
7
MediumMax Area of Islandβœ“ Our Solution
87
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
8
MediumNumber of Substrings With Fixed Ratio
87
Hash TableMathStringPrefix Sum
9
HardMaximum Total Beauty of the Gardensβœ“ Our Solution
87
ArrayTwo PointersBinary SearchGreedy+3
10
MediumDestroy Sequential Targetsβœ“ Our Solution
87
ArrayHash TableCounting
11
MediumLength of the Longest Subsequence That Sums to Targetβœ“ Our Solution
87
ArrayDynamic Programming
12
HardBasic Calculator IVβœ“ Our Solution
87
Hash TableMathStringStack+1
13
MediumNumber of Distinct Substrings in a String
87
StringTrieRolling HashSuffix Array+1
14
MediumMaximum Difference Score in a Gridβœ“ Our Solution
87
ArrayDynamic ProgrammingMatrix
15
HardMake String Anti-palindrome
87
StringGreedySortingCounting Sort
16
HardSudoku Solverβœ“ Our Solution
84
ArrayHash TableBacktrackingMatrix
17
MediumRotting Orangesβœ“ Our Solution
81
ArrayBreadth-First SearchMatrix
18
MediumProduct of Array Except Selfβœ“ Our Solution
81
ArrayPrefix Sum
19
74
ArrayHash Table
20
74
ArrayMath
21
MediumCoin Changeβœ“ Our Solution
74
ArrayDynamic ProgrammingBreadth-First Search
22
MediumWord Breakβœ“ Our Solution
70
ArrayHash TableStringDynamic Programming+2
23
EasyLogger Rate Limiter
70
Hash TableDesignData Stream
24
MediumSpiral Matrixβœ“ Our Solution
70
ArrayMatrixSimulation
25
EasyUnique Email Addressesβœ“ Our Solution
70
ArrayHash TableString
26
MediumHeatersβœ“ Our Solution
64
ArrayTwo PointersBinary SearchSorting
27
HardRussian Doll Envelopesβœ“ Our Solution
64
ArrayBinary SearchDynamic ProgrammingSorting
28
MediumTop K Frequent Elementsβœ“ Our Solution
64
ArrayHash TableDivide and ConquerSorting+4
29
MediumLongest Increasing Subsequenceβœ“ Our Solution
64
ArrayBinary SearchDynamic Programming
30
64
ArrayTwo PointersSorting
31
MediumHouse Robberβœ“ Our Solution
64
ArrayDynamic Programming
32
MediumMin Stackβœ“ Our Solution
64
StackDesign
33
MediumMinimum Cost For Ticketsβœ“ Our Solution
57
ArrayDynamic Programming
34
MediumDaily Temperaturesβœ“ Our Solution
57
ArrayStackMonotonic Stack
35
Medium132 Patternβœ“ Our Solution
57
ArrayBinary SearchStackMonotonic Stack+1
36
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
57
ArrayDynamic Programming
37
EasyMiddle of the Linked Listβœ“ Our Solution
57
Linked ListTwo Pointers
38
MediumGroup Anagramsβœ“ Our Solution
57
ArrayHash TableStringSorting
39
HardTrapping Rain Waterβœ“ Our Solution
57
ArrayTwo PointersDynamic ProgrammingStack+1
40
MediumReorganize Stringβœ“ Our Solution
47
Hash TableStringGreedySorting+2
41
MediumDecode Stringβœ“ Our Solution
47
StringStackRecursion
42
HardMaximal Rectangleβœ“ Our Solution
47
ArrayDynamic ProgrammingStackMatrix+1
43
MediumMinimum Limit of Balls in a Bagβœ“ Our Solution
47
ArrayBinary Search
44
MediumZigzag Conversionβœ“ Our Solution
47
String
45
MediumKth Largest Element in an Arrayβœ“ Our Solution
47
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
46
HardEmployee Free Time
47
ArrayLine SweepSortingHeap (Priority Queue)
47
MediumLowest Common Ancestor of a Binary Treeβœ“ Our Solution
47
TreeDepth-First SearchBinary Tree
48
MediumNext Permutationβœ“ Our Solution
47
ArrayTwo Pointers
49
EasyMove Zeroesβœ“ Our Solution
47
ArrayTwo Pointers
50
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
47
TreeBreadth-First SearchBinary Tree
51
HardBinary Tree Maximum Path Sumβœ“ Our Solution
47
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
52
MediumNext Greater Element IIβœ“ Our Solution
47
ArrayStackMonotonic Stack
53
MediumNumber of Islandsβœ“ Our Solution
47
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
54
MediumCourse Scheduleβœ“ Our Solution
47
Depth-First SearchBreadth-First SearchGraphTopological Sort
55
MediumTask Schedulerβœ“ Our Solution
47
ArrayHash TableGreedySorting+2
56
MediumNumber of Longest Increasing Subsequenceβœ“ Our Solution
47
ArrayDynamic ProgrammingBinary Indexed TreeSegment Tree
57
HardLongest Valid Parenthesesβœ“ Our Solution
47
StringDynamic ProgrammingStack
58
EasyMerge Two Sorted Listsβœ“ Our Solution
47
Linked ListRecursion
59
MediumGenerate Parenthesesβœ“ Our Solution
47
StringDynamic ProgrammingBacktracking
60
MediumBinary Tree Level Order Traversalβœ“ Our Solution
47
TreeBreadth-First SearchBinary Tree
61
EasyPalindrome Linked Listβœ“ Our Solution
47
Linked ListTwo PointersStackRecursion
62
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
47
ArrayHash TableMathDesign+1
63
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
47
Hash TableStringSliding Window
64
MediumLargest Plus Signβœ“ Our Solution
47
ArrayDynamic Programming
65
MediumFind All Anagrams in a Stringβœ“ Our Solution
47
Hash TableStringSliding Window
66
HardMedian of Two Sorted Arraysβœ“ Our Solution
47
ArrayBinary SearchDivide and Conquer
67
HardSerialize and Deserialize Binary Treeβœ“ Our Solution
47
StringTreeDepth-First SearchBreadth-First Search+2
68
EasyClimbing Stairsβœ“ Our Solution
47
MathDynamic ProgrammingMemoization
69
MediumNumber of Operations to Make Network Connectedβœ“ Our Solution
47
Depth-First SearchBreadth-First SearchUnion FindGraph
70
MediumDesign Circular Queueβœ“ Our Solution
47
ArrayLinked ListDesignQueue
71
HardGet the Maximum Scoreβœ“ Our Solution
47
ArrayTwo PointersDynamic ProgrammingGreedy
72
MediumShortest Path in Binary Matrixβœ“ Our Solution
47
ArrayBreadth-First SearchMatrix
73
MediumMinimum Falling Path Sumβœ“ Our Solution
47
ArrayDynamic ProgrammingMatrix