Q

Qualcomm

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

Showing 48 of 48 questions

1
MediumString Compression IIIβœ“ Our Solution
100
String
2
HardMaximum Number of Ones
98
MathGreedySortingHeap (Priority Queue)
3
EasyReverse Linked Listβœ“ Our Solution
92
Linked ListRecursion
4
MediumRemove Nth Node From End of Listβœ“ Our Solution
74
Linked ListTwo Pointers
5
MediumRotate Imageβœ“ Our Solution
74
ArrayMathMatrix
6
MediumLRU Cacheβœ“ Our Solution
74
Hash TableLinked ListDesignDoubly-Linked List
7
MediumNumber of Islandsβœ“ Our Solution
74
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
8
EasyReverse Bitsβœ“ Our Solution
74
Divide and ConquerBit Manipulation
9
EasyMiddle of the Linked Listβœ“ Our Solution
74
Linked ListTwo Pointers
10
MediumDesign Memory Allocatorβœ“ Our Solution
67
ArrayHash TableDesignSimulation
11
EasyMajority Elementβœ“ Our Solution
67
ArrayHash TableDivide and ConquerSorting+1
12
EasyMerge Sorted Arrayβœ“ Our Solution
67
ArrayTwo PointersSorting
13
67
ArrayHash Table
14
EasyValid Parenthesesβœ“ Our Solution
67
StringStack
15
EasyImplement Queue using Stacksβœ“ Our Solution
67
StackDesignQueue
16
EasyPalindrome Numberβœ“ Our Solution
67
Math
17
EasyClimbing Stairsβœ“ Our Solution
67
MathDynamic ProgrammingMemoization
18
EasyNumber of 1 Bitsβœ“ Our Solution
67
Divide and ConquerBit Manipulation
19
MediumSwap Nodes in Pairsβœ“ Our Solution
67
Linked ListRecursion
20
MediumDesign Circular Queueβœ“ Our Solution
57
ArrayLinked ListDesignQueue
21
MediumPermutationsβœ“ Our Solution
57
ArrayBacktracking
22
EasyPower of Fourβœ“ Our Solution
57
MathBit ManipulationRecursion
23
HardReverse Nodes in k-Groupβœ“ Our Solution
57
Linked ListRecursion
24
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
57
Hash TableStringSliding Window
25
EasyFirst Unique Character in a Stringβœ“ Our Solution
57
Hash TableStringQueueCounting
26
HardSerialize and Deserialize Binary Treeβœ“ Our Solution
57
StringTreeDepth-First SearchBreadth-First Search+2
27
EasyIs Subsequenceβœ“ Our Solution
57
Two PointersStringDynamic Programming
28
EasySingle Numberβœ“ Our Solution
57
ArrayBit Manipulation
29
EasyLinked List Cycleβœ“ Our Solution
57
Hash TableLinked ListTwo Pointers
30
MediumCount the Number of Fair Pairsβœ“ Our Solution
57
ArrayTwo PointersBinary SearchSorting
31
MediumKth Largest Element in an Arrayβœ“ Our Solution
57
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
32
HardTrapping Rain Waterβœ“ Our Solution
57
ArrayTwo PointersDynamic ProgrammingStack+1
33
EasyRectangle Overlapβœ“ Our Solution
57
MathGeometry
34
MediumString to Integer (atoi)βœ“ Our Solution
57
String
35
EasyFind Winner on a Tic Tac Toe Gameβœ“ Our Solution
57
ArrayHash TableMatrixSimulation
36
MediumCourse Schedule IIβœ“ Our Solution
57
Depth-First SearchBreadth-First SearchGraphTopological Sort
37
MediumReverse Integerβœ“ Our Solution
57
Math
38
EasyMaximum Depth of Binary Treeβœ“ Our Solution
57
TreeDepth-First SearchBreadth-First SearchBinary Tree
39
MediumTwo Sum II - Input Array Is Sortedβœ“ Our Solution
57
ArrayTwo PointersBinary Search
40
MediumMaximum Subarrayβœ“ Our Solution
57
ArrayDivide and ConquerDynamic Programming
41
MediumPow(x, n)βœ“ Our Solution
57
MathRecursion
42
MediumDesign Tic-Tac-Toe
57
ArrayHash TableDesignMatrix+1
43
HardTrapping Rain Water IIβœ“ Our Solution
57
ArrayBreadth-First SearchHeap (Priority Queue)Matrix
44
EasyPower of Twoβœ“ Our Solution
57
MathBit ManipulationRecursion
45
EasyRemove Duplicates from Sorted Arrayβœ“ Our Solution
57
ArrayTwo Pointers
46
EasyLength of Last Wordβœ“ Our Solution
57
String
47
MediumBest Time to Buy and Sell Stock IIβœ“ Our Solution
57
ArrayDynamic ProgrammingGreedy
48
MediumMerge Intervalsβœ“ Our Solution
57
ArraySorting