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
47.539285	Medium	201	false	false	Bitwise AND of Numbers Range	bitwise-and-of-numbers-range	['Bit Manipulation']	true	false
57.726686	Easy	202	false	false	Happy Number	happy-number	['Hash Table', 'Math', 'Two Pointers']	true	false
51.395756	Easy	203	false	false	Remove Linked List Elements	remove-linked-list-elements	['Linked List', 'Recursion']	true	false
34.541311	Medium	204	false	false	Count Primes	count-primes	['Array', 'Math', 'Enumeration', 'Number Theory']	true	false
46.556533	Easy	205	false	false	Isomorphic Strings	isomorphic-strings	['Hash Table', 'String']	true	false
78.840518	Easy	206	false	false	Reverse Linked List	reverse-linked-list	['Linked List', 'Recursion']	true	true
48.703147	Medium	207	false	false	Course Schedule	course-schedule	['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']	true	false
67.665227	Medium	208	false	false	Implement Trie (Prefix Tree)	implement-trie-prefix-tree	['Hash Table', 'String', 'Design', 'Trie']	true	false
48.954245	Medium	209	false	false	Minimum Size Subarray Sum	minimum-size-subarray-sum	['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum']	true	false
52.897292	Medium	210	false	false	Course Schedule II	course-schedule-ii	['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']	true	true
46.862783	Medium	211	false	false	Design Add and Search Words Data Structure	design-add-and-search-words-data-structure	['String', 'Depth-First Search', 'Design', 'Trie']	true	false
37.111791	Hard	212	false	false	Word Search II	word-search-ii	['Array', 'String', 'Backtracking', 'Trie', 'Matrix']	true	true
43.275162	Medium	213	false	false	House Robber II	house-robber-ii	['Array', 'Dynamic Programming']	true	false
40.429995	Hard	214	false	false	Shortest Palindrome	shortest-palindrome	['String', 'Rolling Hash', 'String Matching', 'Hash Function']	true	false
67.733259	Medium	215	false	false	Kth Largest Element in an Array	kth-largest-element-in-an-array	['Array', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Quickselect']	true	true
71.532187	Medium	216	false	false	Combination Sum III	combination-sum-iii	['Array', 'Backtracking']	true	false
62.947225	Easy	217	false	false	Contains Duplicate	contains-duplicate	['Array', 'Hash Table', 'Sorting']	true	false
43.744207	Hard	218	false	false	The Skyline Problem	the-skyline-problem	['Array', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Line Sweep', 'Heap (Priority Queue)', 'Ordered Set']	true	false
48.464674	Easy	219	false	false	Contains Duplicate II	contains-duplicate-ii	['Array', 'Hash Table', 'Sliding Window']	true	false
23.483085	Hard	220	false	false	Contains Duplicate III	contains-duplicate-iii	['Array', 'Sliding Window', 'Sorting', 'Bucket Sort', 'Ordered Set']	true	false
48.405514	Medium	221	false	false	Maximal Square	maximal-square	['Array', 'Dynamic Programming', 'Matrix']	true	false
69.280487	Easy	222	false	false	Count Complete Tree Nodes	count-complete-tree-nodes	['Binary Search', 'Bit Manipulation', 'Tree', 'Binary Tree']	true	false
47.117215	Medium	223	false	false	Rectangle Area	rectangle-area	['Math', 'Geometry']	true	false
45.138561	Hard	224	false	false	Basic Calculator	basic-calculator	['Math', 'String', 'Stack', 'Recursion']	true	false
66.797401	Easy	225	false	false	Implement Stack using Queues	implement-stack-using-queues	['Stack', 'Design', 'Queue']	true	false
78.744348	Easy	226	false	false	Invert Binary Tree	invert-binary-tree	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	true
45.443871	Medium	227	false	false	Basic Calculator II	basic-calculator-ii	['Math', 'String', 'Stack']	true	false
52.748729	Easy	228	false	false	Summary Ranges	summary-ranges	['Array']	true	false
53.907632	Medium	229	false	false	Majority Element II	majority-element-ii	['Array', 'Hash Table', 'Sorting', 'Counting']	true	false
74.925608	Medium	230	false	false	Kth Smallest Element in a BST	kth-smallest-element-in-a-bst	['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']	true	false
48.248587	Easy	231	false	false	Power of Two	power-of-two	['Math', 'Bit Manipulation', 'Recursion']	true	false
67.895773	Easy	232	false	false	Implement Queue using Stacks	implement-queue-using-stacks	['Stack', 'Design', 'Queue']	true	false
35.681223	Hard	233	false	false	Number of Digit One	number-of-digit-one	['Math', 'Dynamic Programming', 'Recursion']	true	false
55.386668	Easy	234	false	false	Palindrome Linked List	palindrome-linked-list	['Linked List', 'Two Pointers', 'Stack', 'Recursion']	true	true
67.726132	Medium	235	false	false	Lowest Common Ancestor of a Binary Search Tree	lowest-common-ancestor-of-a-binary-search-tree	['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']	true	false
66.04761	Medium	236	false	false	Lowest Common Ancestor of a Binary Tree	lowest-common-ancestor-of-a-binary-tree	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
81.918766	Medium	237	false	false	Delete Node in a Linked List	delete-node-in-a-linked-list	['Linked List']	true	false
67.500653	Medium	238	false	false	Product of Array Except Self	product-of-array-except-self	['Array', 'Prefix Sum']	true	true
47.35889	Hard	239	false	false	Sliding Window Maximum	sliding-window-maximum	['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Monotonic Queue']	true	false
54.66706	Medium	240	false	false	Search a 2D Matrix II	search-a-2d-matrix-ii	['Array', 'Binary Search', 'Divide and Conquer', 'Matrix']	true	true
72.182223	Medium	241	false	false	Different Ways to Add Parentheses	different-ways-to-add-parentheses	['Math', 'String', 'Dynamic Programming', 'Recursion', 'Memoization']	true	false
66.320645	Easy	242	false	false	Valid Anagram	valid-anagram	['Hash Table', 'String', 'Sorting']	true	true
65.859814	Easy	243	false	true	Shortest Word Distance	shortest-word-distance	['Array', 'String']	true	false
61.979122	Medium	244	false	true	Shortest Word Distance II	shortest-word-distance-ii	['Array', 'Hash Table', 'Two Pointers', 'String', 'Design']	true	true
58.952789	Medium	245	false	true	Shortest Word Distance III	shortest-word-distance-iii	['Array', 'String']	true	false
47.599053	Easy	246	false	true	Strobogrammatic Number	strobogrammatic-number	['Hash Table', 'Two Pointers', 'String']	true	true
53.033251	Medium	247	false	true	Strobogrammatic Number II	strobogrammatic-number-ii	['Array', 'String', 'Recursion']	true	false
42.385939	Hard	248	false	true	Strobogrammatic Number III	strobogrammatic-number-iii	['Array', 'String', 'Recursion']	false	false
67.121632	Medium	249	false	true	Group Shifted Strings	group-shifted-strings	['Array', 'Hash Table', 'String']	true	true
57.057999	Medium	250	false	true	Count Univalue Subtrees	count-univalue-subtrees	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
50.043678	Medium	251	false	true	Flatten 2D Vector	flatten-2d-vector	['Array', 'Two Pointers', 'Design', 'Iterator']	true	false
58.83552	Easy	252	false	true	Meeting Rooms	meeting-rooms	['Array', 'Sorting']	true	true
52.001401	Medium	253	false	true	Meeting Rooms II	meeting-rooms-ii	['Array', 'Two Pointers', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Prefix Sum']	true	true
50.168513	Medium	254	false	true	Factor Combinations	factor-combinations	['Backtracking']	true	false
50.732899	Medium	255	false	true	Verify Preorder Sequence in Binary Search Tree	verify-preorder-sequence-in-binary-search-tree	['Array', 'Stack', 'Tree', 'Binary Search Tree', 'Recursion', 'Monotonic Stack', 'Binary Tree']	true	false
63.550268	Medium	256	false	true	Paint House	paint-house	['Array', 'Dynamic Programming']	true	false
66.018372	Easy	257	false	false	Binary Tree Paths	binary-tree-paths	['String', 'Backtracking', 'Tree', 'Depth-First Search', 'Binary Tree']	true	false
67.696783	Easy	258	false	false	Add Digits	add-digits	['Math', 'Simulation', 'Number Theory']	true	false
50.952136	Medium	259	false	true	3Sum Smaller	3sum-smaller	['Array', 'Two Pointers', 'Binary Search', 'Sorting']	true	false
70.685019	Medium	260	false	false	Single Number III	single-number-iii	['Array', 'Bit Manipulation']	true	false
49.160387	Medium	261	false	true	Graph Valid Tree	graph-valid-tree	['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']	true	false
37.04777	Hard	262	false	false	Trips and Users	trips-and-users	['Database']	true	false
42.238671	Easy	263	false	false	Ugly Number	ugly-number	['Math']	true	false
49.185055	Medium	264	false	false	Ugly Number II	ugly-number-ii	['Hash Table', 'Math', 'Dynamic Programming', 'Heap (Priority Queue)']	true	false
56.174283	Hard	265	false	true	Paint House II	paint-house-ii	['Array', 'Dynamic Programming']	true	false
68.437597	Easy	266	false	true	Palindrome Permutation	palindrome-permutation	['Hash Table', 'String', 'Bit Manipulation']	true	false
42.073986	Medium	267	false	true	Palindrome Permutation II	palindrome-permutation-ii	['Hash Table', 'String', 'Backtracking']	true	false
69.589925	Easy	268	false	false	Missing Number	missing-number	['Array', 'Hash Table', 'Math', 'Binary Search', 'Bit Manipulation', 'Sorting']	true	true
36.522233	Hard	269	false	true	Alien Dictionary	alien-dictionary	['Array', 'String', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']	true	false
50.01565	Easy	270	false	true	Closest Binary Search Tree Value	closest-binary-search-tree-value	['Binary Search', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']	true	false
49.199585	Medium	271	false	true	Encode and Decode Strings	encode-and-decode-strings	['Array', 'String', 'Design']	true	false
60.075556	Hard	272	false	true	Closest Binary Search Tree Value II	closest-binary-search-tree-value-ii	['Two Pointers', 'Stack', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Heap (Priority Queue)', 'Binary Tree']	true	false
34.271357	Hard	273	false	false	Integer to English Words	integer-to-english-words	['Math', 'String', 'Recursion']	true	false
40.037754	Medium	274	false	false	H-Index	h-index	['Array', 'Sorting', 'Counting Sort']	true	false
38.721477	Medium	275	false	false	H-Index II	h-index-ii	['Array', 'Binary Search']	true	false
47.570233	Medium	276	false	true	Paint Fence	paint-fence	['Dynamic Programming']	true	false
48.290689	Medium	277	false	true	Find the Celebrity	find-the-celebrity	['Two Pointers', 'Graph', 'Interactive']	true	true
45.682105	Easy	278	false	false	First Bad Version	first-bad-version	['Binary Search', 'Interactive']	true	true
55.512559	Medium	279	false	false	Perfect Squares	perfect-squares	['Math', 'Dynamic Programming', 'Breadth-First Search']	true	false
68.152197	Medium	280	false	true	Wiggle Sort	wiggle-sort	['Array', 'Greedy', 'Sorting']	true	true
65.387651	Medium	281	false	true	Zigzag Iterator	zigzag-iterator	['Array', 'Design', 'Queue', 'Iterator']	true	false
41.298627	Hard	282	false	false	Expression Add Operators	expression-add-operators	['Math', 'String', 'Backtracking']	true	false
62.63599	Easy	283	false	false	Move Zeroes	move-zeroes	['Array', 'Two Pointers']	true	true
60.489917	Medium	284	false	false	Peeking Iterator	peeking-iterator	['Array', 'Design', 'Iterator']	true	false
50.546226	Medium	285	false	true	Inorder Successor in BST	inorder-successor-in-bst	['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']	true	false
62.693655	Medium	286	false	true	Walls and Gates	walls-and-gates	['Array', 'Breadth-First Search', 'Matrix']	true	false
62.502114	Medium	287	false	false	Find the Duplicate Number	find-the-duplicate-number	['Array', 'Two Pointers', 'Binary Search', 'Bit Manipulation']	true	false
26.935724	Medium	288	false	true	Unique Word Abbreviation	unique-word-abbreviation	['Array', 'Hash Table', 'String', 'Design']	true	false
71.093518	Medium	289	false	false	Game of Life	game-of-life	['Array', 'Matrix', 'Simulation']	true	true
42.900181	Easy	290	false	false	Word Pattern	word-pattern	['Hash Table', 'String']	true	false
48.577987	Medium	291	false	true	Word Pattern II	word-pattern-ii	['Hash Table', 'String', 'Backtracking']	true	false
57.919957	Easy	292	false	false	Nim Game	nim-game	['Math', 'Brainteaser', 'Game Theory']	true	false
64.858616	Easy	293	false	true	Flip Game	flip-game	['String']	true	false
52.213879	Medium	294	false	true	Flip Game II	flip-game-ii	['Math', 'Dynamic Programming', 'Backtracking', 'Memoization', 'Game Theory']	false	false
53.1075	Hard	295	false	false	Find Median from Data Stream	find-median-from-data-stream	['Two Pointers', 'Design', 'Sorting', 'Heap (Priority Queue)', 'Data Stream']	true	false
61.22718	Hard	296	false	true	Best Meeting Point	best-meeting-point	['Array', 'Math', 'Sorting', 'Matrix']	true	false
58.532124	Hard	297	false	false	Serialize and Deserialize Binary Tree	serialize-and-deserialize-binary-tree	['String', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design', 'Binary Tree']	true	false
54.02913	Medium	298	false	true	Binary Tree Longest Consecutive Sequence	binary-tree-longest-consecutive-sequence	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
51.177977	Medium	299	false	false	Bulls and Cows	bulls-and-cows	['Hash Table', 'String', 'Counting']	true	false
57.374126	Medium	300	false	false	Longest Increasing Subsequence	longest-increasing-subsequence	['Array', 'Binary Search', 'Dynamic Programming']	true	false

47.539285

Medium

201

false

Bitwise AND of Numbers Range

bitwise-and-of-numbers-range

['Bit Manipulation']

true

false

57.726686

Easy

202

false

Happy Number

happy-number

['Hash Table', 'Math', 'Two Pointers']

true

false

51.395756

Easy

203

false

Remove Linked List Elements

remove-linked-list-elements

['Linked List', 'Recursion']

true

false

34.541311

Medium

204

false

Count Primes

count-primes

['Array', 'Math', 'Enumeration', 'Number Theory']

true

false

46.556533

Easy

205

false

Isomorphic Strings

isomorphic-strings

['Hash Table', 'String']

true

false

78.840518

Easy

206

false

Reverse Linked List

reverse-linked-list

['Linked List', 'Recursion']

true

48.703147

Medium

207

false

Course Schedule

course-schedule

['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']

true

false

67.665227

Medium

208

false

Implement Trie (Prefix Tree)

implement-trie-prefix-tree

['Hash Table', 'String', 'Design', 'Trie']

true

false

48.954245

Medium

209

false

Minimum Size Subarray Sum

minimum-size-subarray-sum

['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum']

true

false

52.897292

Medium

210

false

Course Schedule II

course-schedule-ii

['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']

true

46.862783

Medium

211

false

Design Add and Search Words Data Structure

design-add-and-search-words-data-structure

['String', 'Depth-First Search', 'Design', 'Trie']

true

false

37.111791

Hard

212

false

Word Search II

word-search-ii

['Array', 'String', 'Backtracking', 'Trie', 'Matrix']

true

43.275162

Medium

213

false

House Robber II

house-robber-ii

['Array', 'Dynamic Programming']

true

false

40.429995

Hard

214

false

Shortest Palindrome

shortest-palindrome

['String', 'Rolling Hash', 'String Matching', 'Hash Function']

true

false

67.733259

Medium

215

false

Kth Largest Element in an Array

kth-largest-element-in-an-array

['Array', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Quickselect']

true

71.532187

Medium

216

false

Combination Sum III

combination-sum-iii

['Array', 'Backtracking']

true

false

62.947225

Easy

217

false

Contains Duplicate

contains-duplicate

['Array', 'Hash Table', 'Sorting']

true

false

43.744207

Hard

218

false

The Skyline Problem

the-skyline-problem

['Array', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Line Sweep', 'Heap (Priority Queue)', 'Ordered Set']

true

false

48.464674

Easy

219

false

Contains Duplicate II

contains-duplicate-ii

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

true

false

23.483085

Hard

220

false

Contains Duplicate III

contains-duplicate-iii

['Array', 'Sliding Window', 'Sorting', 'Bucket Sort', 'Ordered Set']

true

false

48.405514

Medium

221

false

Maximal Square

maximal-square

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

true

false

69.280487

Easy

222

false

Count Complete Tree Nodes

count-complete-tree-nodes

['Binary Search', 'Bit Manipulation', 'Tree', 'Binary Tree']

true

false

47.117215

Medium

223

false

Rectangle Area

rectangle-area

['Math', 'Geometry']

true

false

45.138561

Hard

224

false

Basic Calculator

basic-calculator

['Math', 'String', 'Stack', 'Recursion']

true

false

66.797401

Easy

225

false

Implement Stack using Queues

implement-stack-using-queues

['Stack', 'Design', 'Queue']

true

false

78.744348

Easy

226

false

Invert Binary Tree

invert-binary-tree

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

true

45.443871

Medium

227

false

Basic Calculator II

basic-calculator-ii

['Math', 'String', 'Stack']

true

false

52.748729

Easy

228

false

Summary Ranges

summary-ranges

['Array']

true

false

53.907632

Medium

229

false

Majority Element II

majority-element-ii

['Array', 'Hash Table', 'Sorting', 'Counting']

true

false

74.925608

Medium

230

false

Kth Smallest Element in a BST

kth-smallest-element-in-a-bst

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

true

false

48.248587

Easy

231

false

Power of Two

power-of-two

['Math', 'Bit Manipulation', 'Recursion']

true

false

67.895773

Easy

232

false

Implement Queue using Stacks

implement-queue-using-stacks

['Stack', 'Design', 'Queue']

true

false

35.681223

Hard

233

false

Number of Digit One

number-of-digit-one

['Math', 'Dynamic Programming', 'Recursion']

true

false

55.386668

Easy

234

false

Palindrome Linked List

palindrome-linked-list

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

true

67.726132

Medium

235

false

Lowest Common Ancestor of a Binary Search Tree

lowest-common-ancestor-of-a-binary-search-tree

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

true

false

66.04761

Medium

236

false

Lowest Common Ancestor of a Binary Tree

lowest-common-ancestor-of-a-binary-tree

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

true

false

81.918766

Medium

237

false

Delete Node in a Linked List

delete-node-in-a-linked-list

['Linked List']

true

false

67.500653

Medium

238

false

Product of Array Except Self

product-of-array-except-self

['Array', 'Prefix Sum']

true

47.35889

Hard

239

false

Sliding Window Maximum

sliding-window-maximum

['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Monotonic Queue']

true

false

54.66706

Medium

240

false

Search a 2D Matrix II

search-a-2d-matrix-ii

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

true

72.182223

Medium

241

false

Different Ways to Add Parentheses

different-ways-to-add-parentheses

['Math', 'String', 'Dynamic Programming', 'Recursion', 'Memoization']

true

false

66.320645

Easy

242

false

Valid Anagram

valid-anagram

['Hash Table', 'String', 'Sorting']

true

65.859814

Easy

243

false

true

Shortest Word Distance

shortest-word-distance

['Array', 'String']

true

false

61.979122

Medium

244

false

true

Shortest Word Distance II

shortest-word-distance-ii

['Array', 'Hash Table', 'Two Pointers', 'String', 'Design']

true

58.952789

Medium

245

false

true

Shortest Word Distance III

shortest-word-distance-iii

['Array', 'String']

true

false

47.599053

Easy

246

false

true

Strobogrammatic Number

strobogrammatic-number

['Hash Table', 'Two Pointers', 'String']

true

53.033251

Medium

247

false

true

Strobogrammatic Number II

strobogrammatic-number-ii

['Array', 'String', 'Recursion']

true

false

42.385939

Hard

248

false

true

Strobogrammatic Number III

strobogrammatic-number-iii

['Array', 'String', 'Recursion']

false

67.121632

Medium

249

false

true

Group Shifted Strings

group-shifted-strings

['Array', 'Hash Table', 'String']

true

57.057999

Medium

250

false

true

Count Univalue Subtrees

count-univalue-subtrees

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

true

false

50.043678

Medium

251

false

true

Flatten 2D Vector

flatten-2d-vector

['Array', 'Two Pointers', 'Design', 'Iterator']

true

false

58.83552

Easy

252

false

true

Meeting Rooms

meeting-rooms

['Array', 'Sorting']

true

52.001401

Medium

253

false

true

Meeting Rooms II

meeting-rooms-ii

['Array', 'Two Pointers', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Prefix Sum']

true

50.168513

Medium

254

false

true

Factor Combinations

factor-combinations

['Backtracking']

true

false

50.732899

Medium

255

false

true

Verify Preorder Sequence in Binary Search Tree

verify-preorder-sequence-in-binary-search-tree

['Array', 'Stack', 'Tree', 'Binary Search Tree', 'Recursion', 'Monotonic Stack', 'Binary Tree']

true

false

63.550268

Medium

256

false

true

Paint House

paint-house

['Array', 'Dynamic Programming']

true

false

66.018372

Easy

257

false

Binary Tree Paths

binary-tree-paths

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

true

false

67.696783

Easy

258

false

Add Digits

add-digits

['Math', 'Simulation', 'Number Theory']

true

false

50.952136

Medium

259

false

true

3Sum Smaller

3sum-smaller

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

true

false

70.685019

Medium

260

false

Single Number III

single-number-iii

['Array', 'Bit Manipulation']

true

false

49.160387

Medium

261

false

true

Graph Valid Tree

graph-valid-tree

['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']

true

false

37.04777

Hard

262

false

Trips and Users

trips-and-users

['Database']

true

false

42.238671

Easy

263

false

Ugly Number

ugly-number

['Math']

true

false

49.185055

Medium

264

false

Ugly Number II

ugly-number-ii

['Hash Table', 'Math', 'Dynamic Programming', 'Heap (Priority Queue)']

true

false

56.174283

Hard

265

false

true

Paint House II

paint-house-ii

['Array', 'Dynamic Programming']

true

false

68.437597

Easy

266

false

true

Palindrome Permutation

palindrome-permutation

['Hash Table', 'String', 'Bit Manipulation']

true

false

42.073986

Medium

267

false

true

Palindrome Permutation II

palindrome-permutation-ii

['Hash Table', 'String', 'Backtracking']

true

false

69.589925

Easy

268

false

Missing Number

missing-number

['Array', 'Hash Table', 'Math', 'Binary Search', 'Bit Manipulation', 'Sorting']

true

36.522233

Hard

269

false

true

Alien Dictionary

alien-dictionary

['Array', 'String', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']

true

false

50.01565

Easy

270

false

true

Closest Binary Search Tree Value

closest-binary-search-tree-value

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

true

false

49.199585

Medium

271

false

true

Encode and Decode Strings

encode-and-decode-strings

['Array', 'String', 'Design']

true

false

60.075556

Hard

272

false

true

Closest Binary Search Tree Value II

closest-binary-search-tree-value-ii

['Two Pointers', 'Stack', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Heap (Priority Queue)', 'Binary Tree']

true

false

34.271357

Hard

273

false

Integer to English Words

integer-to-english-words

['Math', 'String', 'Recursion']

true

false

40.037754

Medium

274

false

H-Index

h-index

['Array', 'Sorting', 'Counting Sort']

true

false

38.721477

Medium

275

false

H-Index II

h-index-ii

['Array', 'Binary Search']

true

false

47.570233

Medium

276

false

true

Paint Fence

paint-fence

['Dynamic Programming']

true

false

48.290689

Medium

277

false

true

Find the Celebrity

find-the-celebrity

['Two Pointers', 'Graph', 'Interactive']

true

45.682105

Easy

278

false

First Bad Version

first-bad-version

['Binary Search', 'Interactive']

true

55.512559

Medium

279

false

Perfect Squares

perfect-squares

['Math', 'Dynamic Programming', 'Breadth-First Search']

true

false

68.152197

Medium

280

false

true

Wiggle Sort

wiggle-sort

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

true

65.387651

Medium

281

false

true

Zigzag Iterator

zigzag-iterator

['Array', 'Design', 'Queue', 'Iterator']

true

false

41.298627

Hard

282

false

Expression Add Operators

expression-add-operators

['Math', 'String', 'Backtracking']

true

false

62.63599

Easy

283

false

Move Zeroes

move-zeroes

['Array', 'Two Pointers']

true

60.489917

Medium

284

false

Peeking Iterator

peeking-iterator

['Array', 'Design', 'Iterator']

true

false

50.546226

Medium

285

false

true

Inorder Successor in BST

inorder-successor-in-bst

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

true

false

62.693655

Medium

286

false

true

Walls and Gates

walls-and-gates

['Array', 'Breadth-First Search', 'Matrix']

true

false

62.502114

Medium

287

false

Find the Duplicate Number

find-the-duplicate-number

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

true

false

26.935724

Medium

288

false

true

Unique Word Abbreviation

unique-word-abbreviation

['Array', 'Hash Table', 'String', 'Design']

true

false

71.093518

Medium

289

false

Game of Life

game-of-life

['Array', 'Matrix', 'Simulation']

true

42.900181

Easy

290

false

Word Pattern

word-pattern

['Hash Table', 'String']

true

false

48.577987

Medium

291

false

true

Word Pattern II

word-pattern-ii

['Hash Table', 'String', 'Backtracking']

true

false

57.919957

Easy

292

false

Nim Game

nim-game

['Math', 'Brainteaser', 'Game Theory']

true

false

64.858616

Easy

293

false

true

Flip Game

flip-game

['String']

true

false

52.213879

Medium

294

false

true

Flip Game II

flip-game-ii

['Math', 'Dynamic Programming', 'Backtracking', 'Memoization', 'Game Theory']

false

53.1075

Hard

295

false

Find Median from Data Stream

find-median-from-data-stream

['Two Pointers', 'Design', 'Sorting', 'Heap (Priority Queue)', 'Data Stream']

true

false

61.22718

Hard

296

false

true

Best Meeting Point

best-meeting-point

['Array', 'Math', 'Sorting', 'Matrix']

true

false

58.532124

Hard

297

false

Serialize and Deserialize Binary Tree

serialize-and-deserialize-binary-tree

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

true

false

54.02913

Medium

298

false

true

Binary Tree Longest Consecutive Sequence

binary-tree-longest-consecutive-sequence

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

true

false

51.177977

Medium

299

false

Bulls and Cows

bulls-and-cows

['Hash Table', 'String', 'Counting']

true

false

57.374126

Medium

300

false

Longest Increasing Subsequence

longest-increasing-subsequence

['Array', 'Binary Search', 'Dynamic Programming']

true

false