B

ByteDance

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

Showing 64 of 64 questions

1
MediumLRU Cacheβœ“ Our Solution
100
Hash TableLinked ListDesignDoubly-Linked List
2
MediumSmallest Subsequence of Distinct Charactersβœ“ Our Solution
90
StringStackGreedyMonotonic Stack
3
MediumRemove Duplicate Lettersβœ“ Our Solution
87
StringStackGreedyMonotonic Stack
4
MediumFirst Day Where You Have Been in All the Roomsβœ“ Our Solution
87
ArrayDynamic Programming
5
MediumNumber of Islandsβœ“ Our Solution
85
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
6
MediumCourse Scheduleβœ“ Our Solution
79
Depth-First SearchBreadth-First SearchGraphTopological Sort
7
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
75
Hash TableStringSliding Window
8
MediumCombination Sumβœ“ Our Solution
75
ArrayBacktracking
9
MediumBasic Calculator IIβœ“ Our Solution
71
MathStringStack
10
MediumKth Largest Element in an Arrayβœ“ Our Solution
71
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
11
HardRegular Expression Matchingβœ“ Our Solution
71
StringDynamic ProgrammingRecursion
12
65
ArrayHash Table
13
HardShortest Distance from All Buildings
65
ArrayBreadth-First SearchMatrix
14
MediumHouse Robber IIβœ“ Our Solution
65
ArrayDynamic Programming
15
MediumHouse Robberβœ“ Our Solution
65
ArrayDynamic Programming
16
MediumLongest Consecutive Sequenceβœ“ Our Solution
65
ArrayHash TableUnion Find
17
MediumMerge Intervalsβœ“ Our Solution
65
ArraySorting
18
HardTrapping Rain Waterβœ“ Our Solution
65
ArrayTwo PointersDynamic ProgrammingStack+1
19
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
65
ArrayBinary Search
20
MediumLongest Common Subsequenceβœ“ Our Solution
58
StringDynamic Programming
21
MediumRotting Orangesβœ“ Our Solution
58
ArrayBreadth-First SearchMatrix
22
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
58
ArrayDynamic Programming
23
MediumTop K Frequent Elementsβœ“ Our Solution
58
ArrayHash TableDivide and ConquerSorting+4
24
MediumAdd Two Numbersβœ“ Our Solution
58
Linked ListMathRecursion
25
MediumMaximal Squareβœ“ Our Solution
58
ArrayDynamic ProgrammingMatrix
26
MediumCombination Sum IIβœ“ Our Solution
58
ArrayBacktracking
27
HardBasic Calculatorβœ“ Our Solution
58
MathStringStackRecursion
28
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
58
ArrayHash TableMathDesign+1
29
MediumSubarray Sum Equals Kβœ“ Our Solution
58
ArrayHash TablePrefix Sum
30
MediumSum Gameβœ“ Our Solution
58
MathStringGreedyGame Theory
31
MediumNumber of Good Leaf Nodes Pairsβœ“ Our Solution
58
TreeDepth-First SearchBinary Tree
32
MediumSort Listβœ“ Our Solution
58
Linked ListTwo PointersDivide and ConquerSorting+1
33
MediumDelete Operation for Two Stringsβœ“ Our Solution
58
StringDynamic Programming
34
MediumOpen the Lockβœ“ Our Solution
49
ArrayHash TableStringBreadth-First Search
35
MediumContainer With Most Waterβœ“ Our Solution
49
ArrayTwo PointersGreedy
36
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
49
TreeBreadth-First SearchBinary Tree
37
HardTrapping Rain Water IIβœ“ Our Solution
49
ArrayBreadth-First SearchHeap (Priority Queue)Matrix
38
MediumPow(x, n)βœ“ Our Solution
49
MathRecursion
39
MediumNext Permutationβœ“ Our Solution
49
ArrayTwo Pointers
40
MediumCompare Version Numbersβœ“ Our Solution
49
Two PointersString
41
MediumDesign Memory Allocatorβœ“ Our Solution
49
ArrayHash TableDesignSimulation
42
MediumSearch a 2D Matrix IIβœ“ Our Solution
49
ArrayBinary SearchDivide and ConquerMatrix
43
EasyMerge Sorted Arrayβœ“ Our Solution
49
ArrayTwo PointersSorting
44
MediumPeak Index in a Mountain Arrayβœ“ Our Solution
49
ArrayBinary Search
45
MediumSubsetsβœ“ Our Solution
49
ArrayBacktrackingBit Manipulation
46
MediumLongest Repeating Character Replacementβœ“ Our Solution
49
Hash TableStringSliding Window
47
HardMerge k Sorted Listsβœ“ Our Solution
49
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
48
MediumUnique Pathsβœ“ Our Solution
49
MathDynamic ProgrammingCombinatorics
49
HardMinimum Window Substringβœ“ Our Solution
49
Hash TableStringSliding Window
50
HardSum of Distances in Treeβœ“ Our Solution
49
Dynamic ProgrammingTreeDepth-First SearchGraph
51
MediumLongest Palindromic Substringβœ“ Our Solution
49
Two PointersStringDynamic Programming
52
EasyReverse Linked Listβœ“ Our Solution
49
Linked ListRecursion
53
MediumMinimum Area Rectangleβœ“ Our Solution
49
ArrayHash TableMathGeometry+1
54
EasyAdd to Array-Form of Integerβœ“ Our Solution
49
ArrayMath
55
MediumCourse Schedule IIβœ“ Our Solution
49
Depth-First SearchBreadth-First SearchGraphTopological Sort
56
MediumH-Indexβœ“ Our Solution
49
ArraySortingCounting Sort
57
MediumDecode Stringβœ“ Our Solution
49
StringStackRecursion
58
MediumFind All Good Indicesβœ“ Our Solution
49
ArrayDynamic ProgrammingPrefix Sum
59
EasyDegree of an Arrayβœ“ Our Solution
49
ArrayHash Table
60
EasyClimbing Stairsβœ“ Our Solution
49
MathDynamic ProgrammingMemoization
61
EasyCount Binary Substringsβœ“ Our Solution
49
Two PointersString
62
MediumMaximum Value at a Given Index in a Bounded Arrayβœ“ Our Solution
49
MathBinary SearchGreedy
63
MediumPartition to K Equal Sum Subsetsβœ“ Our Solution
49
ArrayDynamic ProgrammingBacktrackingBit Manipulation+2
64
MediumRemove Zero Sum Consecutive Nodes from Linked Listβœ“ Our Solution
49
Hash TableLinked List