kaysss/leetcode-problem-set · Datasets at Hugging Face

acRate float64 9.28 95.3	difficulty stringclasses 3 values	frontendQuestionId int64 1 3.51k	isFavor bool 1 class	paidOnly bool 2 classes	title stringlengths 3 79	titleSlug stringlengths 3 79	topicTags stringlengths 2 153	hasSolution bool 2 classes	hasVideoSolution bool 2 classes
58.847871	Easy	101	false	false	Symmetric Tree	symmetric-tree	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	true
70.081745	Medium	102	false	false	Binary Tree Level Order Traversal	binary-tree-level-order-traversal	['Tree', 'Breadth-First Search', 'Binary Tree']	true	false
61.23411	Medium	103	false	false	Binary Tree Zigzag Level Order Traversal	binary-tree-zigzag-level-order-traversal	['Tree', 'Breadth-First Search', 'Binary Tree']	true	false
76.888431	Easy	104	false	false	Maximum Depth of Binary Tree	maximum-depth-of-binary-tree	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	true
66.356635	Medium	105	false	false	Construct Binary Tree from Preorder and Inorder Traversal	construct-binary-tree-from-preorder-and-inorder-traversal	['Array', 'Hash Table', 'Divide and Conquer', 'Tree', 'Binary Tree']	true	false
65.879137	Medium	106	false	false	Construct Binary Tree from Inorder and Postorder Traversal	construct-binary-tree-from-inorder-and-postorder-traversal	['Array', 'Hash Table', 'Divide and Conquer', 'Tree', 'Binary Tree']	true	false
65.568051	Medium	107	false	false	Binary Tree Level Order Traversal II	binary-tree-level-order-traversal-ii	['Tree', 'Breadth-First Search', 'Binary Tree']	true	false
73.738375	Easy	108	false	false	Convert Sorted Array to Binary Search Tree	convert-sorted-array-to-binary-search-tree	['Array', 'Divide and Conquer', 'Tree', 'Binary Search Tree', 'Binary Tree']	true	true
64.071282	Medium	109	false	false	Convert Sorted List to Binary Search Tree	convert-sorted-list-to-binary-search-tree	['Linked List', 'Divide and Conquer', 'Tree', 'Binary Search Tree', 'Binary Tree']	true	true
54.845808	Easy	110	false	false	Balanced Binary Tree	balanced-binary-tree	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
50.222502	Easy	111	false	false	Minimum Depth of Binary Tree	minimum-depth-of-binary-tree	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	false
52.58553	Easy	112	false	false	Path Sum	path-sum	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	false
60.158945	Medium	113	false	false	Path Sum II	path-sum-ii	['Backtracking', 'Tree', 'Depth-First Search', 'Binary Tree']	true	false
67.951357	Medium	114	false	false	Flatten Binary Tree to Linked List	flatten-binary-tree-to-linked-list	['Linked List', 'Stack', 'Tree', 'Depth-First Search', 'Binary Tree']	true	false
49.644612	Hard	115	false	false	Distinct Subsequences	distinct-subsequences	['String', 'Dynamic Programming']	true	false
65.053755	Medium	116	false	false	Populating Next Right Pointers in Each Node	populating-next-right-pointers-in-each-node	['Linked List', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	false
55.114076	Medium	117	false	false	Populating Next Right Pointers in Each Node II	populating-next-right-pointers-in-each-node-ii	['Linked List', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	false
76.620198	Easy	118	false	false	Pascal's Triangle	pascals-triangle	['Array', 'Dynamic Programming']	true	true
65.643327	Easy	119	false	false	Pascal's Triangle II	pascals-triangle-ii	['Array', 'Dynamic Programming']	true	false
58.814663	Medium	120	false	false	Triangle	triangle	['Array', 'Dynamic Programming']	true	false
54.917541	Easy	121	false	false	Best Time to Buy and Sell Stock	best-time-to-buy-and-sell-stock	['Array', 'Dynamic Programming']	true	true
69.08097	Medium	122	false	false	Best Time to Buy and Sell Stock II	best-time-to-buy-and-sell-stock-ii	['Array', 'Dynamic Programming', 'Greedy']	true	true
50.496743	Hard	123	false	false	Best Time to Buy and Sell Stock III	best-time-to-buy-and-sell-stock-iii	['Array', 'Dynamic Programming']	true	false
41.017054	Hard	124	false	false	Binary Tree Maximum Path Sum	binary-tree-maximum-path-sum	['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree']	true	false
50.437727	Easy	125	false	false	Valid Palindrome	valid-palindrome	['Two Pointers', 'String']	true	false
27.128707	Hard	126	false	false	Word Ladder II	word-ladder-ii	['Hash Table', 'String', 'Backtracking', 'Breadth-First Search']	true	false
42.170272	Hard	127	false	false	Word Ladder	word-ladder	['Hash Table', 'String', 'Breadth-First Search']	true	true
47.1301	Medium	128	false	false	Longest Consecutive Sequence	longest-consecutive-sequence	['Array', 'Hash Table', 'Union Find']	true	false
68.131435	Medium	129	false	false	Sum Root to Leaf Numbers	sum-root-to-leaf-numbers	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
42.326444	Medium	130	false	false	Surrounded Regions	surrounded-regions	['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']	true	false
71.611071	Medium	131	false	false	Palindrome Partitioning	palindrome-partitioning	['String', 'Dynamic Programming', 'Backtracking']	true	false
34.983781	Hard	132	false	false	Palindrome Partitioning II	palindrome-partitioning-ii	['String', 'Dynamic Programming']	true	false
61.589388	Medium	133	false	false	Clone Graph	clone-graph	['Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Graph']	true	false
46.093166	Medium	134	false	false	Gas Station	gas-station	['Array', 'Greedy']	true	false
44.502525	Hard	135	false	false	Candy	candy	['Array', 'Greedy']	true	false
75.553856	Easy	136	false	false	Single Number	single-number	['Array', 'Bit Manipulation']	true	false
64.862221	Medium	137	false	false	Single Number II	single-number-ii	['Array', 'Bit Manipulation']	true	false
59.858388	Medium	138	false	false	Copy List with Random Pointer	copy-list-with-random-pointer	['Hash Table', 'Linked List']	true	false
48.013604	Medium	139	false	false	Word Break	word-break	['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Trie', 'Memoization']	true	true
53.169528	Hard	140	false	false	Word Break II	word-break-ii	['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Backtracking', 'Trie', 'Memoization']	true	false
52.170691	Easy	141	false	false	Linked List Cycle	linked-list-cycle	['Hash Table', 'Linked List', 'Two Pointers']	true	true
54.300168	Medium	142	false	false	Linked List Cycle II	linked-list-cycle-ii	['Hash Table', 'Linked List', 'Two Pointers']	true	false
61.895785	Medium	143	false	false	Reorder List	reorder-list	['Linked List', 'Two Pointers', 'Stack', 'Recursion']	true	false
72.61417	Easy	144	false	false	Binary Tree Preorder Traversal	binary-tree-preorder-traversal	['Stack', 'Tree', 'Depth-First Search', 'Binary Tree']	true	false
75.171741	Easy	145	false	false	Binary Tree Postorder Traversal	binary-tree-postorder-traversal	['Stack', 'Tree', 'Depth-First Search', 'Binary Tree']	true	false
44.703407	Medium	146	false	false	LRU Cache	lru-cache	['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List']	true	false
56.001725	Medium	147	false	false	Insertion Sort List	insertion-sort-list	['Linked List', 'Sorting']	true	true
61.171883	Medium	148	false	false	Sort List	sort-list	['Linked List', 'Two Pointers', 'Divide and Conquer', 'Sorting', 'Merge Sort']	true	false
28.603218	Hard	149	false	false	Max Points on a Line	max-points-on-a-line	['Array', 'Hash Table', 'Math', 'Geometry']	true	false
54.361494	Medium	150	false	false	Evaluate Reverse Polish Notation	evaluate-reverse-polish-notation	['Array', 'Math', 'Stack']	true	false
50.76628	Medium	151	false	false	Reverse Words in a String	reverse-words-in-a-string	['Two Pointers', 'String']	true	false
34.661621	Medium	152	false	false	Maximum Product Subarray	maximum-product-subarray	['Array', 'Dynamic Programming']	true	false
52.321783	Medium	153	false	false	Find Minimum in Rotated Sorted Array	find-minimum-in-rotated-sorted-array	['Array', 'Binary Search']	true	false
44.03913	Hard	154	false	false	Find Minimum in Rotated Sorted Array II	find-minimum-in-rotated-sorted-array-ii	['Array', 'Binary Search']	true	false
56.100879	Medium	155	false	false	Min Stack	min-stack	['Stack', 'Design']	true	false
64.27366	Medium	156	false	true	Binary Tree Upside Down	binary-tree-upside-down	['Tree', 'Depth-First Search', 'Binary Tree']	false	false
42.135584	Easy	157	false	true	Read N Characters Given Read4	read-n-characters-given-read4	['Array', 'Simulation', 'Interactive']	true	false
42.792484	Hard	158	false	true	Read N Characters Given read4 II - Call Multiple Times	read-n-characters-given-read4-ii-call-multiple-times	['Array', 'Simulation', 'Interactive']	false	false
56.166546	Medium	159	false	true	Longest Substring with At Most Two Distinct Characters	longest-substring-with-at-most-two-distinct-characters	['Hash Table', 'String', 'Sliding Window']	true	true
60.542819	Easy	160	false	false	Intersection of Two Linked Lists	intersection-of-two-linked-lists	['Hash Table', 'Linked List', 'Two Pointers']	true	true
34.4624	Medium	161	false	true	One Edit Distance	one-edit-distance	['Two Pointers', 'String']	true	false
46.396559	Medium	162	false	false	Find Peak Element	find-peak-element	['Array', 'Binary Search']	true	true
35.079243	Easy	163	false	true	Missing Ranges	missing-ranges	['Array']	true	false
48.814466	Medium	164	false	false	Maximum Gap	maximum-gap	['Array', 'Sorting', 'Bucket Sort', 'Radix Sort']	true	false
42.075191	Medium	165	false	false	Compare Version Numbers	compare-version-numbers	['Two Pointers', 'String']	true	false
25.99917	Medium	166	false	false	Fraction to Recurring Decimal	fraction-to-recurring-decimal	['Hash Table', 'Math', 'String']	true	false
63.051769	Medium	167	false	false	Two Sum II - Input Array Is Sorted	two-sum-ii-input-array-is-sorted	['Array', 'Two Pointers', 'Binary Search']	true	false
43.064261	Easy	168	false	false	Excel Sheet Column Title	excel-sheet-column-title	['Math', 'String']	true	false
65.568921	Easy	169	false	false	Majority Element	majority-element	['Array', 'Hash Table', 'Divide and Conquer', 'Sorting', 'Counting']	true	false
38.600335	Easy	170	false	true	Two Sum III - Data structure design	two-sum-iii-data-structure-design	['Array', 'Hash Table', 'Two Pointers', 'Design', 'Data Stream']	true	false
65.417585	Easy	171	false	false	Excel Sheet Column Number	excel-sheet-column-number	['Math', 'String']	true	false
44.57353	Medium	172	false	false	Factorial Trailing Zeroes	factorial-trailing-zeroes	['Math']	true	false
74.47714	Medium	173	false	false	Binary Search Tree Iterator	binary-search-tree-iterator	['Stack', 'Tree', 'Design', 'Binary Search Tree', 'Binary Tree', 'Iterator']	true	false
39.232738	Hard	174	false	false	Dungeon Game	dungeon-game	['Array', 'Dynamic Programming', 'Matrix']	true	false
77.728564	Easy	175	false	false	Combine Two Tables	combine-two-tables	['Database']	true	false
43.235494	Medium	176	false	false	Second Highest Salary	second-highest-salary	['Database']	true	false
37.877097	Medium	177	false	false	Nth Highest Salary	nth-highest-salary	['Database']	true	false
64.767112	Medium	178	false	false	Rank Scores	rank-scores	['Database']	true	false
40.986369	Medium	179	false	false	Largest Number	largest-number	['Array', 'String', 'Greedy', 'Sorting']	true	false
45.635406	Medium	180	false	false	Consecutive Numbers	consecutive-numbers	['Database']	true	false
71.206162	Easy	181	false	false	Employees Earning More Than Their Managers	employees-earning-more-than-their-managers	['Database']	true	false
72.201108	Easy	182	false	false	Duplicate Emails	duplicate-emails	['Database']	true	false
70.418649	Easy	183	false	false	Customers Who Never Order	customers-who-never-order	['Database']	true	false
54.140508	Medium	184	false	false	Department Highest Salary	department-highest-salary	['Database']	true	false
57.121757	Hard	185	false	false	Department Top Three Salaries	department-top-three-salaries	['Database']	true	false
55.875065	Medium	186	false	true	Reverse Words in a String II	reverse-words-in-a-string-ii	['Two Pointers', 'String']	true	true
50.916277	Medium	187	false	false	Repeated DNA Sequences	repeated-dna-sequences	['Hash Table', 'String', 'Bit Manipulation', 'Sliding Window', 'Rolling Hash', 'Hash Function']	true	false
46.347496	Hard	188	false	false	Best Time to Buy and Sell Stock IV	best-time-to-buy-and-sell-stock-iv	['Array', 'Dynamic Programming']	true	false
42.644578	Medium	189	false	false	Rotate Array	rotate-array	['Array', 'Math', 'Two Pointers']	true	false
62.512269	Easy	190	false	false	Reverse Bits	reverse-bits	['Divide and Conquer', 'Bit Manipulation']	true	false
74.004481	Easy	191	false	false	Number of 1 Bits	number-of-1-bits	['Divide and Conquer', 'Bit Manipulation']	true	false
26.988863	Medium	192	false	false	Word Frequency	word-frequency	['Shell']	false	false
27.104746	Easy	193	false	false	Valid Phone Numbers	valid-phone-numbers	['Shell']	false	false
28.096248	Medium	194	false	false	Transpose File	transpose-file	['Shell']	false	false
34.310587	Easy	195	false	false	Tenth Line	tenth-line	['Shell']	false	false
63.971067	Easy	196	false	false	Delete Duplicate Emails	delete-duplicate-emails	['Database']	true	false
49.953286	Easy	197	false	false	Rising Temperature	rising-temperature	['Database']	true	false
52.089821	Medium	198	false	false	House Robber	house-robber	['Array', 'Dynamic Programming']	true	false
66.164524	Medium	199	false	false	Binary Tree Right Side View	binary-tree-right-side-view	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	true
61.849775	Medium	200	false	false	Number of Islands	number-of-islands	['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']	true	true

58.847871

Easy

101

false

Symmetric Tree

symmetric-tree

['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']

true

70.081745

Medium

102

false

Binary Tree Level Order Traversal

binary-tree-level-order-traversal

['Tree', 'Breadth-First Search', 'Binary Tree']

true

false

61.23411

Medium

103

false

Binary Tree Zigzag Level Order Traversal

binary-tree-zigzag-level-order-traversal

['Tree', 'Breadth-First Search', 'Binary Tree']

true

false

76.888431

Easy

104

false

Maximum Depth of Binary Tree

maximum-depth-of-binary-tree

['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']

true

66.356635

Medium

105

false

Construct Binary Tree from Preorder and Inorder Traversal

construct-binary-tree-from-preorder-and-inorder-traversal

['Array', 'Hash Table', 'Divide and Conquer', 'Tree', 'Binary Tree']

true

false

65.879137

Medium

106

false

Construct Binary Tree from Inorder and Postorder Traversal

construct-binary-tree-from-inorder-and-postorder-traversal

['Array', 'Hash Table', 'Divide and Conquer', 'Tree', 'Binary Tree']

true

false

65.568051

Medium

107

false

Binary Tree Level Order Traversal II

binary-tree-level-order-traversal-ii

['Tree', 'Breadth-First Search', 'Binary Tree']

true

false

73.738375

Easy

108

false

Convert Sorted Array to Binary Search Tree

convert-sorted-array-to-binary-search-tree

['Array', 'Divide and Conquer', 'Tree', 'Binary Search Tree', 'Binary Tree']

true

64.071282

Medium

109

false

Convert Sorted List to Binary Search Tree

convert-sorted-list-to-binary-search-tree

['Linked List', 'Divide and Conquer', 'Tree', 'Binary Search Tree', 'Binary Tree']

true

54.845808

Easy

110

false

Balanced Binary Tree

balanced-binary-tree

['Tree', 'Depth-First Search', 'Binary Tree']

true

false

50.222502

Easy

111

false

Minimum Depth of Binary Tree

minimum-depth-of-binary-tree

['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']

true

false

52.58553

Easy

112

false

Path Sum

path-sum

['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']

true

false

60.158945

Medium

113

false

Path Sum II

path-sum-ii

['Backtracking', 'Tree', 'Depth-First Search', 'Binary Tree']

true

false

67.951357

Medium

114

false

Flatten Binary Tree to Linked List

flatten-binary-tree-to-linked-list

['Linked List', 'Stack', 'Tree', 'Depth-First Search', 'Binary Tree']

true

false

49.644612

Hard

115

false

Distinct Subsequences

distinct-subsequences

['String', 'Dynamic Programming']

true

false

65.053755

Medium

116

false

Populating Next Right Pointers in Each Node

populating-next-right-pointers-in-each-node

['Linked List', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']

true

false

55.114076

Medium

117

false

Populating Next Right Pointers in Each Node II

populating-next-right-pointers-in-each-node-ii

['Linked List', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']

true

false

76.620198

Easy

118

false

Pascal's Triangle

pascals-triangle

['Array', 'Dynamic Programming']

true

65.643327

Easy

119

false

Pascal's Triangle II

pascals-triangle-ii

['Array', 'Dynamic Programming']

true

false

58.814663

Medium

120

false

Triangle

triangle

['Array', 'Dynamic Programming']

true

false

54.917541

Easy

121

false

Best Time to Buy and Sell Stock

best-time-to-buy-and-sell-stock

['Array', 'Dynamic Programming']

true

69.08097

Medium

122

false

Best Time to Buy and Sell Stock II

best-time-to-buy-and-sell-stock-ii

['Array', 'Dynamic Programming', 'Greedy']

true

50.496743

Hard

123

false

Best Time to Buy and Sell Stock III

best-time-to-buy-and-sell-stock-iii

['Array', 'Dynamic Programming']

true

false

41.017054

Hard

124

false

Binary Tree Maximum Path Sum

binary-tree-maximum-path-sum

['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree']

true

false

50.437727

Easy

125

false

Valid Palindrome

valid-palindrome

['Two Pointers', 'String']

true

false

27.128707

Hard

126

false

Word Ladder II

word-ladder-ii

['Hash Table', 'String', 'Backtracking', 'Breadth-First Search']

true

false

42.170272

Hard

127

false

Word Ladder

word-ladder

['Hash Table', 'String', 'Breadth-First Search']

true

47.1301

Medium

128

false

Longest Consecutive Sequence

longest-consecutive-sequence

['Array', 'Hash Table', 'Union Find']

true

false

68.131435

Medium

129

false

Sum Root to Leaf Numbers

sum-root-to-leaf-numbers

['Tree', 'Depth-First Search', 'Binary Tree']

true

false

42.326444

Medium

130

false

Surrounded Regions

surrounded-regions

['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']

true

false

71.611071

Medium

131

false

Palindrome Partitioning

palindrome-partitioning

['String', 'Dynamic Programming', 'Backtracking']

true

false

34.983781

Hard

132

false

Palindrome Partitioning II

palindrome-partitioning-ii

['String', 'Dynamic Programming']

true

false

61.589388

Medium

133

false

Clone Graph

clone-graph

['Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Graph']

true

false

46.093166

Medium

134

false

Gas Station

gas-station

['Array', 'Greedy']

true

false

44.502525

Hard

135

false

Candy

candy

['Array', 'Greedy']

true

false

75.553856

Easy

136

false

Single Number

single-number

['Array', 'Bit Manipulation']

true

false

64.862221

Medium

137

false

Single Number II

single-number-ii

['Array', 'Bit Manipulation']

true

false

59.858388

Medium

138

false

Copy List with Random Pointer

copy-list-with-random-pointer

['Hash Table', 'Linked List']

true

false

48.013604

Medium

139

false

Word Break

word-break

['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Trie', 'Memoization']

true

53.169528

Hard

140

false

Word Break II

word-break-ii

['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Backtracking', 'Trie', 'Memoization']

true

false

52.170691

Easy

141

false

Linked List Cycle

linked-list-cycle

['Hash Table', 'Linked List', 'Two Pointers']

true

54.300168

Medium

142

false

Linked List Cycle II

linked-list-cycle-ii

['Hash Table', 'Linked List', 'Two Pointers']

true

false

61.895785

Medium

143

false

Reorder List

reorder-list

['Linked List', 'Two Pointers', 'Stack', 'Recursion']

true

false

72.61417

Easy

144

false

Binary Tree Preorder Traversal

binary-tree-preorder-traversal

['Stack', 'Tree', 'Depth-First Search', 'Binary Tree']

true

false

75.171741

Easy

145

false

Binary Tree Postorder Traversal

binary-tree-postorder-traversal

['Stack', 'Tree', 'Depth-First Search', 'Binary Tree']

true

false

44.703407

Medium

146

false

LRU Cache

lru-cache

['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List']

true

false

56.001725

Medium

147

false

Insertion Sort List

insertion-sort-list

['Linked List', 'Sorting']

true

61.171883

Medium

148

false

Sort List

sort-list

['Linked List', 'Two Pointers', 'Divide and Conquer', 'Sorting', 'Merge Sort']

true

false

28.603218

Hard

149

false

Max Points on a Line

max-points-on-a-line

['Array', 'Hash Table', 'Math', 'Geometry']

true

false

54.361494

Medium

150

false

Evaluate Reverse Polish Notation

evaluate-reverse-polish-notation

['Array', 'Math', 'Stack']

true

false

50.76628

Medium

151

false

Reverse Words in a String

reverse-words-in-a-string

['Two Pointers', 'String']

true

false

34.661621

Medium

152

false

Maximum Product Subarray

maximum-product-subarray

['Array', 'Dynamic Programming']

true

false

52.321783

Medium

153

false

Find Minimum in Rotated Sorted Array

find-minimum-in-rotated-sorted-array

['Array', 'Binary Search']

true

false

44.03913

Hard

154

false

Find Minimum in Rotated Sorted Array II

find-minimum-in-rotated-sorted-array-ii

['Array', 'Binary Search']

true

false

56.100879

Medium

155

false

Min Stack

min-stack

['Stack', 'Design']

true

false

64.27366

Medium

156

false

true

Binary Tree Upside Down

binary-tree-upside-down

['Tree', 'Depth-First Search', 'Binary Tree']

false

42.135584

Easy

157

false

true

Read N Characters Given Read4

read-n-characters-given-read4

['Array', 'Simulation', 'Interactive']

true

false

42.792484

Hard

158

false

true

Read N Characters Given read4 II - Call Multiple Times

read-n-characters-given-read4-ii-call-multiple-times

['Array', 'Simulation', 'Interactive']

false

56.166546

Medium

159

false

true

Longest Substring with At Most Two Distinct Characters

longest-substring-with-at-most-two-distinct-characters

['Hash Table', 'String', 'Sliding Window']

true

60.542819

Easy

160

false

Intersection of Two Linked Lists

intersection-of-two-linked-lists

['Hash Table', 'Linked List', 'Two Pointers']

true

34.4624

Medium

161

false

true

One Edit Distance

one-edit-distance

['Two Pointers', 'String']

true

false

46.396559

Medium

162

false

Find Peak Element

find-peak-element

['Array', 'Binary Search']

true

35.079243

Easy

163

false

true

Missing Ranges

missing-ranges

['Array']

true

false

48.814466

Medium

164

false

Maximum Gap

maximum-gap

['Array', 'Sorting', 'Bucket Sort', 'Radix Sort']

true

false

42.075191

Medium

165

false

Compare Version Numbers

compare-version-numbers

['Two Pointers', 'String']

true

false

25.99917

Medium

166

false

Fraction to Recurring Decimal

fraction-to-recurring-decimal

['Hash Table', 'Math', 'String']

true

false

63.051769

Medium

167

false

Two Sum II - Input Array Is Sorted

two-sum-ii-input-array-is-sorted

['Array', 'Two Pointers', 'Binary Search']

true

false

43.064261

Easy

168

false

Excel Sheet Column Title

excel-sheet-column-title

['Math', 'String']

true

false

65.568921

Easy

169

false

Majority Element

majority-element

['Array', 'Hash Table', 'Divide and Conquer', 'Sorting', 'Counting']

true

false

38.600335

Easy

170

false

true

Two Sum III - Data structure design

two-sum-iii-data-structure-design

['Array', 'Hash Table', 'Two Pointers', 'Design', 'Data Stream']

true

false

65.417585

Easy

171

false

Excel Sheet Column Number

excel-sheet-column-number

['Math', 'String']

true

false

44.57353

Medium

172

false

Factorial Trailing Zeroes

factorial-trailing-zeroes

['Math']

true

false

74.47714

Medium

173

false

Binary Search Tree Iterator

binary-search-tree-iterator

['Stack', 'Tree', 'Design', 'Binary Search Tree', 'Binary Tree', 'Iterator']

true

false

39.232738

Hard

174

false

Dungeon Game

dungeon-game

['Array', 'Dynamic Programming', 'Matrix']

true

false

77.728564

Easy

175

false

Combine Two Tables

combine-two-tables

['Database']

true

false

43.235494

Medium

176

false

Second Highest Salary

second-highest-salary

['Database']

true

false

37.877097

Medium

177

false

Nth Highest Salary

nth-highest-salary

['Database']

true

false

64.767112

Medium

178

false

Rank Scores

rank-scores

['Database']

true

false

40.986369

Medium

179

false

Largest Number

largest-number

['Array', 'String', 'Greedy', 'Sorting']

true

false

45.635406

Medium

180

false

Consecutive Numbers

consecutive-numbers

['Database']

true

false

71.206162

Easy

181

false

Employees Earning More Than Their Managers

employees-earning-more-than-their-managers

['Database']

true

false

72.201108

Easy

182

false

Duplicate Emails

duplicate-emails

['Database']

true

false

70.418649

Easy

183

false

Customers Who Never Order

customers-who-never-order

['Database']

true

false

54.140508

Medium

184

false

Department Highest Salary

department-highest-salary

['Database']

true

false

57.121757

Hard

185

false

Department Top Three Salaries

department-top-three-salaries

['Database']

true

false

55.875065

Medium

186

false

true

Reverse Words in a String II

reverse-words-in-a-string-ii

['Two Pointers', 'String']

true

50.916277

Medium

187

false

Repeated DNA Sequences

repeated-dna-sequences

['Hash Table', 'String', 'Bit Manipulation', 'Sliding Window', 'Rolling Hash', 'Hash Function']

true

false

46.347496

Hard

188

false

Best Time to Buy and Sell Stock IV

best-time-to-buy-and-sell-stock-iv

['Array', 'Dynamic Programming']

true

false

42.644578

Medium

189

false

Rotate Array

rotate-array

['Array', 'Math', 'Two Pointers']

true

false

62.512269

Easy

190

false

Reverse Bits

reverse-bits

['Divide and Conquer', 'Bit Manipulation']

true

false

74.004481

Easy

191

false

Number of 1 Bits

number-of-1-bits

['Divide and Conquer', 'Bit Manipulation']

true

false

26.988863

Medium

192

false

Word Frequency

word-frequency

['Shell']

false

27.104746

Easy

193

false

Valid Phone Numbers

valid-phone-numbers

['Shell']

false

28.096248

Medium

194

false

Transpose File

transpose-file

['Shell']

false

34.310587

Easy

195

false

Tenth Line

tenth-line

['Shell']

false

63.971067

Easy

196

false

Delete Duplicate Emails

delete-duplicate-emails

['Database']

true

false

49.953286

Easy

197

false

Rising Temperature

rising-temperature

['Database']

true

false

52.089821

Medium

198

false

House Robber

house-robber

['Array', 'Dynamic Programming']

true

false

66.164524

Medium

199

false

Binary Tree Right Side View

binary-tree-right-side-view

['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']

true

61.849775

Medium

200

false

Number of Islands

number-of-islands

['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']

true