T

tcs

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

Showing 100 of 100 questions

1
85
ArrayHash Table
2
EasyPalindrome Numberβœ“ Our Solution
77
Math
3
EasyMajority Elementβœ“ Our Solution
72
ArrayHash TableDivide and ConquerSorting+1
4
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
69
ArrayDynamic Programming
5
MediumMaximum Subarrayβœ“ Our Solution
67
ArrayDivide and ConquerDynamic Programming
6
EasyLongest Common Prefixβœ“ Our Solution
64
StringTrie
7
EasyValid Parenthesesβœ“ Our Solution
61
StringStack
8
EasyFibonacci Numberβœ“ Our Solution
61
MathDynamic ProgrammingRecursionMemoization
9
MediumSubarray Sum Equals Kβœ“ Our Solution
61
ArrayHash TablePrefix Sum
10
EasyMove Zeroesβœ“ Our Solution
61
ArrayTwo Pointers
11
MediumRotate Arrayβœ“ Our Solution
61
ArrayMathTwo Pointers
12
EasyCount the Digits That Divide a Numberβœ“ Our Solution
60
Math
13
MediumJump Gameβœ“ Our Solution
60
ArrayDynamic ProgrammingGreedy
14
EasyMaximum Ascending Subarray Sumβœ“ Our Solution
60
Array
15
MediumReverse Integerβœ“ Our Solution
60
Math
16
EasyMerge Sorted Arrayβœ“ Our Solution
56
ArrayTwo PointersSorting
17
MediumUnique Pathsβœ“ Our Solution
56
MathDynamic ProgrammingCombinatorics
18
EasyRoman to Integerβœ“ Our Solution
56
Hash TableMathString
19
EasyRemove Letter To Equalize Frequencyβœ“ Our Solution
56
Hash TableStringCounting
20
EasyMinimum Cuts to Divide a Circleβœ“ Our Solution
56
MathGeometry
21
EasySingle Numberβœ“ Our Solution
56
ArrayBit Manipulation
22
EasyValid Anagramβœ“ Our Solution
56
Hash TableStringSorting
23
EasyMinimum Operations to Exceed Threshold Value Iβœ“ Our Solution
56
Array
24
MediumMinimum Operations to Exceed Threshold Value IIβœ“ Our Solution
56
ArrayHeap (Priority Queue)Simulation
25
HardPalindrome Partitioning IVβœ“ Our Solution
56
StringDynamic Programming
26
54
ArrayTwo PointersSorting
27
MediumBitwise ORs of Subarraysβœ“ Our Solution
54
ArrayDynamic ProgrammingBit Manipulation
28
EasyClimbing Stairsβœ“ Our Solution
54
MathDynamic ProgrammingMemoization
29
EasyFind the Index of the First Occurrence in a Stringβœ“ Our Solution
54
Two PointersStringString Matching
30
EasyRemove Duplicates from Sorted Arrayβœ“ Our Solution
52
ArrayTwo Pointers
31
MediumLongest Palindromic Substringβœ“ Our Solution
52
Two PointersStringDynamic Programming
32
MediumContainer With Most Waterβœ“ Our Solution
50
ArrayTwo PointersGreedy
33
50
ArrayMath
34
MediumPow(x, n)βœ“ Our Solution
50
MathRecursion
35
MediumSecond Highest Salaryβœ“ Our Solution
50
Database
36
EasyLength of Last Wordβœ“ Our Solution
50
String
37
MediumSort Colorsβœ“ Our Solution
50
ArrayTwo PointersSorting
38
HardSliding Window Maximumβœ“ Our Solution
47
ArrayQueueSliding WindowHeap (Priority Queue)+1
39
EasyContains Duplicateβœ“ Our Solution
47
ArrayHash TableSorting
40
EasyHappy Numberβœ“ Our Solution
47
Hash TableMathTwo Pointers
41
MediumReverse Words in a Stringβœ“ Our Solution
47
Two PointersString
42
HardTrapping Rain Waterβœ“ Our Solution
47
ArrayTwo PointersDynamic ProgrammingStack+1
43
MediumSpiral Matrixβœ“ Our Solution
47
ArrayMatrixSimulation
44
EasyMissing Numberβœ“ Our Solution
47
ArrayHash TableMathBinary Search+2
45
MediumBest Time to Buy and Sell Stock IIβœ“ Our Solution
43
ArrayDynamic ProgrammingGreedy
46
MediumAdd Two Numbersβœ“ Our Solution
43
Linked ListMathRecursion
47
MediumSet Matrix Zeroesβœ“ Our Solution
43
ArrayHash TableMatrix
48
43
MathBinary Search
49
MediumMax Consecutive Ones IIIβœ“ Our Solution
43
ArrayBinary SearchSliding WindowPrefix Sum
50
EasyCheck if Array Is Sorted and Rotatedβœ“ Our Solution
43
Array
51
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
43
Hash TableStringSliding Window
52
EasyToeplitz Matrixβœ“ Our Solution
43
ArrayMatrix
53
EasyMerge Two Sorted Listsβœ“ Our Solution
43
Linked ListRecursion
54
MediumSingle Element in a Sorted Arrayβœ“ Our Solution
39
ArrayBinary Search
55
EasyFizz Buzzβœ“ Our Solution
39
MathStringSimulation
56
EasyReverse Stringβœ“ Our Solution
39
Two PointersString
57
EasyN-th Tribonacci Numberβœ“ Our Solution
39
MathDynamic ProgrammingMemoization
58
EasyAdd Binaryβœ“ Our Solution
39
MathStringBit ManipulationSimulation
59
MediumK-diff Pairs in an Arrayβœ“ Our Solution
39
ArrayHash TableTwo PointersBinary Search+1
60
EasyFind Customer Refereeβœ“ Our Solution
39
Database
61
EasyArticle Views Iβœ“ Our Solution
39
Database
62
HardDepartment Top Three Salariesβœ“ Our Solution
39
Database
63
39
ArrayTwo PointersSorting
64
EasyReverse Linked Listβœ“ Our Solution
39
Linked ListRecursion
65
MediumGenerate Parenthesesβœ“ Our Solution
39
StringDynamic ProgrammingBacktracking
66
EasyRotate Stringβœ“ Our Solution
34
StringString Matching
67
MediumRemove Duplicates from Sorted Array IIβœ“ Our Solution
34
ArrayTwo Pointers
68
MediumEdit Distanceβœ“ Our Solution
34
StringDynamic Programming
69
HardLargest Rectangle in Histogramβœ“ Our Solution
34
ArrayStackMonotonic Stack
70
MediumFind First and Last Position of Element in Sorted Arrayβœ“ Our Solution
34
ArrayBinary Search
71
EasyBinary Searchβœ“ Our Solution
34
ArrayBinary Search
72
EasySame Treeβœ“ Our Solution
34
TreeDepth-First SearchBreadth-First SearchBinary Tree
73
EasyEmployee Bonusβœ“ Our Solution
34
Database
74
MediumLongest Common Subsequenceβœ“ Our Solution
34
StringDynamic Programming
75
EasyPascal's Triangleβœ“ Our Solution
34
ArrayDynamic Programming
76
MediumLongest Consecutive Sequenceβœ“ Our Solution
34
ArrayHash TableUnion Find
77
MediumMaximum Product Subarrayβœ“ Our Solution
34
ArrayDynamic Programming
78
EasySort Array by Increasing Frequencyβœ“ Our Solution
34
ArrayHash TableSorting
79
MediumLargest Numberβœ“ Our Solution
34
ArrayStringGreedySorting
80
MediumSort Characters By Frequencyβœ“ Our Solution
34
Hash TableStringSortingHeap (Priority Queue)+2
81
MediumNext Permutationβœ“ Our Solution
34
ArrayTwo Pointers
82
EasyPower of Twoβœ“ Our Solution
34
MathBit ManipulationRecursion
83
MediumSubsetsβœ“ Our Solution
34
ArrayBacktrackingBit Manipulation
84
EasyHow Many Numbers Are Smaller Than the Current Numberβœ“ Our Solution
27
ArrayHash TableSortingCounting Sort
85
EasyStudents and Examinationsβœ“ Our Solution
27
Database
86
MediumPath with Maximum Probabilityβœ“ Our Solution
27
ArrayGraphHeap (Priority Queue)Shortest Path
87
MediumCombination Sumβœ“ Our Solution
27
ArrayBacktracking
88
EasySum of Unique Elementsβœ“ Our Solution
27
ArrayHash TableCounting
89
MediumSearch a 2D Matrix IIβœ“ Our Solution
27
ArrayBinary SearchDivide and ConquerMatrix
90
MediumWord Searchβœ“ Our Solution
27
ArrayStringBacktrackingDepth-First Search+1
91
MediumPeak Index in a Mountain Arrayβœ“ Our Solution
27
ArrayBinary Search
92
EasyNumber of Employees Who Met the Targetβœ“ Our Solution
27
Array
93
MediumCoin Changeβœ“ Our Solution
27
ArrayDynamic ProgrammingBreadth-First Search
94
MediumPartition Listβœ“ Our Solution
27
Linked ListTwo Pointers
95
EasyBig Countriesβœ“ Our Solution
27
Database
96
Medium3Sum Closestβœ“ Our Solution
27
ArrayTwo PointersSorting
97
MediumCount Primesβœ“ Our Solution
27
ArrayMathEnumerationNumber Theory
98
EasyFirst Unique Character in a Stringβœ“ Our Solution
27
Hash TableStringQueueCounting
99
EasyIntersection of Two Arraysβœ“ Our Solution
27
ArrayHash TableTwo PointersBinary Search+1
100
MediumProduct of Array Except Selfβœ“ Our Solution
27
ArrayPrefix Sum