WL

Walmart Labs

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

Showing 100 of 100 questions

1
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
100
Hash TableStringSliding Window
2
MediumLRU Cacheβœ“ Our Solution
96
Hash TableLinked ListDesignDoubly-Linked List
3
EasyValid Parenthesesβœ“ Our Solution
87
StringStack
4
HardMax Stack
85
Linked ListStackDesignDoubly-Linked List+1
5
MediumMerge Intervalsβœ“ Our Solution
82
ArraySorting
6
HardTrapping Rain Waterβœ“ Our Solution
82
ArrayTwo PointersDynamic ProgrammingStack+1
7
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
80
ArrayDynamic Programming
8
77
ArrayHash Table
9
MediumLongest Palindromic Substringβœ“ Our Solution
77
Two PointersStringDynamic Programming
10
MediumWord Breakβœ“ Our Solution
77
ArrayHash TableStringDynamic Programming+2
11
MediumDivide Intervals Into Minimum Number of Groupsβœ“ Our Solution
77
ArrayTwo PointersGreedySorting+2
12
HardMinimum Number of Operations to Make Arrays Similarβœ“ Our Solution
75
ArrayGreedySorting
13
HardCount Good Triplets in an Arrayβœ“ Our Solution
75
ArrayBinary SearchDivide and ConquerBinary Indexed Tree+3
14
MediumMinimum Operations to Make Array Equal IIβœ“ Our Solution
75
ArrayMathGreedy
15
HardMaximum Number of Tasks You Can Assignβœ“ Our Solution
75
ArrayTwo PointersBinary SearchGreedy+3
16
EasyMiddle of the Linked Listβœ“ Our Solution
75
Linked ListTwo Pointers
17
HardNumber of Ways to Separate Numbersβœ“ Our Solution
75
StringDynamic ProgrammingSuffix Array
18
EasyThe Winner University
75
Database
19
MediumGenerate Parenthesesβœ“ Our Solution
75
StringDynamic ProgrammingBacktracking
20
MediumKth Largest Element in an Arrayβœ“ Our Solution
73
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
21
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
73
ArrayBinary Search
22
MediumGroup Anagramsβœ“ Our Solution
73
ArrayHash TableStringSorting
23
MediumNumber of Islandsβœ“ Our Solution
73
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
24
MediumSpiral Matrixβœ“ Our Solution
73
ArrayMatrixSimulation
25
MediumLongest Consecutive Sequenceβœ“ Our Solution
70
ArrayHash TableUnion Find
26
MediumSort Colorsβœ“ Our Solution
70
ArrayTwo PointersSorting
27
MediumValid Sudokuβœ“ Our Solution
67
ArrayHash TableMatrix
28
MediumCoin Changeβœ“ Our Solution
67
ArrayDynamic ProgrammingBreadth-First Search
29
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
67
TreeBreadth-First SearchBinary Tree
30
EasyMove Zeroesβœ“ Our Solution
67
ArrayTwo Pointers
31
MediumCombination Sumβœ“ Our Solution
67
ArrayBacktracking
32
MediumRotate Arrayβœ“ Our Solution
63
ArrayMathTwo Pointers
33
EasyDegree of an Arrayβœ“ Our Solution
63
ArrayHash Table
34
MediumAll Nodes Distance K in Binary Treeβœ“ Our Solution
63
Hash TableTreeDepth-First SearchBreadth-First Search+1
35
63
ArrayTwo PointersSorting
36
MediumTop K Frequent Elementsβœ“ Our Solution
63
ArrayHash TableDivide and ConquerSorting+4
37
MediumPow(x, n)βœ“ Our Solution
63
MathRecursion
38
HardMedian of Two Sorted Arraysβœ“ Our Solution
63
ArrayBinary SearchDivide and Conquer
39
MediumHouse Robberβœ“ Our Solution
59
ArrayDynamic Programming
40
HardLFU Cacheβœ“ Our Solution
59
Hash TableLinked ListDesignDoubly-Linked List
41
MediumFlatten Nested List Iteratorβœ“ Our Solution
59
StackTreeDepth-First SearchDesign+2
42
HardReverse Nodes in k-Groupβœ“ Our Solution
59
Linked ListRecursion
43
EasyLongest Common Prefixβœ“ Our Solution
59
StringTrie
44
MediumDaily Temperaturesβœ“ Our Solution
59
ArrayStackMonotonic Stack
45
HardMerge k Sorted Listsβœ“ Our Solution
59
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
46
HardFirst Missing Positiveβœ“ Our Solution
59
ArrayHash Table
47
MediumWord Searchβœ“ Our Solution
59
ArrayStringBacktrackingDepth-First Search+1
48
EasyAdd Binaryβœ“ Our Solution
59
MathStringBit ManipulationSimulation
49
MediumCopy List with Random Pointerβœ“ Our Solution
59
Hash TableLinked List
50
MediumSearch a 2D Matrixβœ“ Our Solution
59
ArrayBinary SearchMatrix
51
MediumMaximum Subarrayβœ“ Our Solution
53
ArrayDivide and ConquerDynamic Programming
52
EasySquares of a Sorted Arrayβœ“ Our Solution
53
ArrayTwo PointersSorting
53
MediumMin Stackβœ“ Our Solution
53
StackDesign
54
HardMinimum Window Substringβœ“ Our Solution
53
Hash TableStringSliding Window
55
MediumBinary Tree Right Side Viewβœ“ Our Solution
53
TreeDepth-First SearchBreadth-First SearchBinary Tree
56
MediumKeys and Roomsβœ“ Our Solution
53
Depth-First SearchBreadth-First SearchGraph
57
MediumCourse Schedule IIβœ“ Our Solution
53
Depth-First SearchBreadth-First SearchGraphTopological Sort
58
MediumMax Consecutive Ones IIIβœ“ Our Solution
46
ArrayBinary SearchSliding WindowPrefix Sum
59
MediumFlatten Deeply Nested Arrayβœ“ Our Solution
46
60
EasyFirst Unique Character in a Stringβœ“ Our Solution
46
Hash TableStringQueueCounting
61
MediumMaximum Profit From Trading Stocks
46
ArrayDynamic Programming
62
MediumContainer With Most Waterβœ“ Our Solution
46
ArrayTwo PointersGreedy
63
MediumPartition Equal Subset Sumβœ“ Our Solution
46
ArrayDynamic Programming
64
EasyMerge Two Sorted Listsβœ“ Our Solution
46
Linked ListRecursion
65
MediumSubarray Sum Equals Kβœ“ Our Solution
46
ArrayHash TablePrefix Sum
66
MediumInterleaving Stringβœ“ Our Solution
46
StringDynamic Programming
67
MediumBoundary of Binary Tree
46
TreeDepth-First SearchBinary Tree
68
MediumPath Sum IIβœ“ Our Solution
46
BacktrackingTreeDepth-First SearchBinary Tree
69
MediumPopulating Next Right Pointers in Each Nodeβœ“ Our Solution
46
Linked ListTreeDepth-First SearchBreadth-First Search+1
70
HardWildcard Matchingβœ“ Our Solution
46
StringDynamic ProgrammingGreedyRecursion
71
MediumCourse Scheduleβœ“ Our Solution
46
Depth-First SearchBreadth-First SearchGraphTopological Sort
72
MediumKoko Eating Bananasβœ“ Our Solution
46
ArrayBinary Search
73
MediumBest Time to Buy and Sell Stock IIβœ“ Our Solution
46
ArrayDynamic ProgrammingGreedy
74
MediumJump Game IIβœ“ Our Solution
46
ArrayDynamic ProgrammingGreedy
75
EasyPalindrome Numberβœ“ Our Solution
37
Math
76
EasyValid Palindrome IIβœ“ Our Solution
37
Two PointersStringGreedy
77
MediumBoats to Save Peopleβœ“ Our Solution
37
ArrayTwo PointersGreedySorting
78
MediumFruit Into Basketsβœ“ Our Solution
37
ArrayHash TableSliding Window
79
MediumMinimum Add to Make Parentheses Validβœ“ Our Solution
37
StringStackGreedy
80
EasyReverse Words in a String IIIβœ“ Our Solution
37
Two PointersString
81
MediumReorganize Stringβœ“ Our Solution
37
Hash TableStringGreedySorting+2
82
EasyLinked List Cycleβœ“ Our Solution
37
Hash TableLinked ListTwo Pointers
83
HardMaximum Number of Non-overlapping Palindrome Substringsβœ“ Our Solution
37
Two PointersStringDynamic ProgrammingGreedy
84
HardLargest Rectangle in Histogramβœ“ Our Solution
37
ArrayStackMonotonic Stack
85
MediumReverse Words in a Stringβœ“ Our Solution
37
Two PointersString
86
MediumAdd Two Numbersβœ“ Our Solution
37
Linked ListMathRecursion
87
MediumSecond Highest Salaryβœ“ Our Solution
37
Database
88
MediumPalindrome Partitioningβœ“ Our Solution
37
StringDynamic ProgrammingBacktracking
89
HardBinary Tree Maximum Path Sumβœ“ Our Solution
37
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
90
MediumCount Primesβœ“ Our Solution
37
ArrayMathEnumerationNumber Theory
91
MediumPopulating Next Right Pointers in Each Node IIβœ“ Our Solution
37
Linked ListTreeDepth-First SearchBreadth-First Search+1
92
MediumMaximal Squareβœ“ Our Solution
37
ArrayDynamic ProgrammingMatrix
93
MediumProduct of Array Except Selfβœ“ Our Solution
37
ArrayPrefix Sum
94
EasyValid Anagramβœ“ Our Solution
37
Hash TableStringSorting
95
MediumPerfect Squaresβœ“ Our Solution
37
MathDynamic ProgrammingBreadth-First Search
96
MediumBinary Tree Longest Consecutive Sequence
37
TreeDepth-First SearchBinary Tree
97
MediumDecode Waysβœ“ Our Solution
37
StringDynamic Programming
98
EasyMerge Sorted Arrayβœ“ Our Solution
37
ArrayTwo PointersSorting
99
EasyLongest Palindromeβœ“ Our Solution
37
Hash TableStringGreedy
100
MediumDecode Stringβœ“ Our Solution
37
StringStackRecursion