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
64.421087	Hard	1,601	false	false	Maximum Number of Achievable Transfer Requests	maximum-number-of-achievable-transfer-requests	['Array', 'Backtracking', 'Bit Manipulation', 'Enumeration']	true	false
75.016292	Medium	1,602	false	true	Find Nearest Right Node in Binary Tree	find-nearest-right-node-in-binary-tree	['Tree', 'Breadth-First Search', 'Binary Tree']	true	true
88.039657	Easy	1,603	false	false	Design Parking System	design-parking-system	['Design', 'Simulation', 'Counting']	true	false
45.928264	Medium	1,604	false	false	Alert Using Same Key-Card Three or More Times in a One Hour Period	alert-using-same-key-card-three-or-more-times-in-a-one-hour-period	['Array', 'Hash Table', 'String', 'Sorting']	false	false
82.858093	Medium	1,605	false	false	Find Valid Matrix Given Row and Column Sums	find-valid-matrix-given-row-and-column-sums	['Array', 'Greedy', 'Matrix']	true	false
43.780779	Hard	1,606	false	false	Find Servers That Handled Most Number of Requests	find-servers-that-handled-most-number-of-requests	['Array', 'Greedy', 'Heap (Priority Queue)', 'Ordered Set']	true	false
54.461143	Easy	1,607	false	true	Sellers With No Sales	sellers-with-no-sales	['Database']	true	false
66.582636	Easy	1,608	false	false	Special Array With X Elements Greater Than or Equal X	special-array-with-x-elements-greater-than-or-equal-x	['Array', 'Binary Search', 'Sorting']	true	false
66.463435	Medium	1,609	false	false	Even Odd Tree	even-odd-tree	['Tree', 'Breadth-First Search', 'Binary Tree']	true	false
37.519006	Hard	1,610	false	false	Maximum Number of Visible Points	maximum-number-of-visible-points	['Array', 'Math', 'Geometry', 'Sliding Window', 'Sorting']	false	false
73.279798	Hard	1,611	false	false	Minimum One Bit Operations to Make Integers Zero	minimum-one-bit-operations-to-make-integers-zero	['Dynamic Programming', 'Bit Manipulation', 'Memoization']	true	false
71.056594	Medium	1,612	false	true	Check If Two Expression Trees are Equivalent	check-if-two-expression-trees-are-equivalent	['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree', 'Counting']	false	false
73.115038	Medium	1,613	false	true	Find the Missing IDs	find-the-missing-ids	['Database']	false	false
84.216934	Easy	1,614	false	false	Maximum Nesting Depth of the Parentheses	maximum-nesting-depth-of-the-parentheses	['String', 'Stack']	true	false
65.36765	Medium	1,615	false	false	Maximal Network Rank	maximal-network-rank	['Graph']	true	false
31.282136	Medium	1,616	false	false	Split Two Strings to Make Palindrome	split-two-strings-to-make-palindrome	['Two Pointers', 'String']	false	false
66.647468	Hard	1,617	false	false	Count Subtrees With Max Distance Between Cities	count-subtrees-with-max-distance-between-cities	['Dynamic Programming', 'Bit Manipulation', 'Tree', 'Enumeration', 'Bitmask']	false	false
61.233216	Medium	1,618	false	true	Maximum Font to Fit a Sentence in a Screen	maximum-font-to-fit-a-sentence-in-a-screen	['Array', 'String', 'Binary Search', 'Interactive']	false	false
70.110366	Easy	1,619	false	false	Mean of Array After Removing Some Elements	mean-of-array-after-removing-some-elements	['Array', 'Sorting']	false	false
38.17188	Medium	1,620	false	false	Coordinate With Maximum Network Quality	coordinate-with-maximum-network-quality	['Array', 'Enumeration']	false	false
44.419505	Medium	1,621	false	false	Number of Sets of K Non-Overlapping Line Segments	number-of-sets-of-k-non-overlapping-line-segments	['Math', 'Dynamic Programming', 'Combinatorics']	false	false
18.124865	Hard	1,622	false	false	Fancy Sequence	fancy-sequence	['Math', 'Design', 'Segment Tree']	false	false
80.935265	Easy	1,623	false	true	All Valid Triplets That Can Represent a Country	all-valid-triplets-that-can-represent-a-country	['Database']	false	false
68.234983	Easy	1,624	false	false	Largest Substring Between Two Equal Characters	largest-substring-between-two-equal-characters	['Hash Table', 'String']	true	false
64.88669	Medium	1,625	false	false	Lexicographically Smallest String After Applying Operations	lexicographically-smallest-string-after-applying-operations	['String', 'Depth-First Search', 'Breadth-First Search', 'Enumeration']	false	false
50.354503	Medium	1,626	false	false	Best Team With No Conflicts	best-team-with-no-conflicts	['Array', 'Dynamic Programming', 'Sorting']	true	false
47.963478	Hard	1,627	false	false	Graph Connectivity With Threshold	graph-connectivity-with-threshold	['Array', 'Math', 'Union Find', 'Number Theory']	false	false
82.409335	Medium	1,628	false	true	Design an Expression Tree With Evaluate Function	design-an-expression-tree-with-evaluate-function	['Array', 'Math', 'Stack', 'Tree', 'Design', 'Binary Tree']	false	false
59.219808	Easy	1,629	false	false	Slowest Key	slowest-key	['Array', 'String']	true	false
83.683128	Medium	1,630	false	false	Arithmetic Subarrays	arithmetic-subarrays	['Array', 'Hash Table', 'Sorting']	true	false
60.977361	Medium	1,631	false	false	Path With Minimum Effort	path-with-minimum-effort	['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix']	true	false
41.343704	Hard	1,632	false	false	Rank Transform of a Matrix	rank-transform-of-a-matrix	['Array', 'Union Find', 'Graph', 'Topological Sort', 'Sorting', 'Matrix']	true	false
58.490541	Easy	1,633	false	false	Percentage of Users Attended a Contest	percentage-of-users-attended-a-contest	['Database']	true	false
60.661438	Medium	1,634	false	true	Add Two Polynomials Represented as Linked Lists	add-two-polynomials-represented-as-linked-lists	['Linked List', 'Math', 'Two Pointers']	true	false
48.13176	Hard	1,635	false	true	Hopper Company Queries I	hopper-company-queries-i	['Database']	true	false
80.133346	Easy	1,636	false	false	Sort Array by Increasing Frequency	sort-array-by-increasing-frequency	['Array', 'Hash Table', 'Sorting']	true	false
87.061776	Easy	1,637	false	false	Widest Vertical Area Between Two Points Containing No Points	widest-vertical-area-between-two-points-containing-no-points	['Array', 'Sorting']	true	false
71.535257	Medium	1,638	false	false	Count Substrings That Differ by One Character	count-substrings-that-differ-by-one-character	['Hash Table', 'String', 'Dynamic Programming', 'Enumeration']	false	false
57.183988	Hard	1,639	false	false	Number of Ways to Form a Target String Given a Dictionary	number-of-ways-to-form-a-target-string-given-a-dictionary	['Array', 'String', 'Dynamic Programming']	true	false
56.904881	Easy	1,640	false	false	Check Array Formation Through Concatenation	check-array-formation-through-concatenation	['Array', 'Hash Table']	true	false
78.800814	Medium	1,641	false	false	Count Sorted Vowel Strings	count-sorted-vowel-strings	['Math', 'Dynamic Programming', 'Combinatorics']	true	false
50.228349	Medium	1,642	false	false	Furthest Building You Can Reach	furthest-building-you-can-reach	['Array', 'Greedy', 'Heap (Priority Queue)']	true	false
45.583879	Hard	1,643	false	false	Kth Smallest Instructions	kth-smallest-instructions	['Array', 'Math', 'Dynamic Programming', 'Combinatorics']	false	false
68.307762	Medium	1,644	false	true	Lowest Common Ancestor of a Binary Tree II	lowest-common-ancestor-of-a-binary-tree-ii	['Tree', 'Depth-First Search', 'Binary Tree']	true	false
39.418265	Hard	1,645	false	true	Hopper Company Queries II	hopper-company-queries-ii	['Database']	false	false
50.899925	Easy	1,646	false	false	Get Maximum in Generated Array	get-maximum-in-generated-array	['Array', 'Simulation']	true	false
61.262053	Medium	1,647	false	false	Minimum Deletions to Make Character Frequencies Unique	minimum-deletions-to-make-character-frequencies-unique	['Hash Table', 'String', 'Greedy', 'Sorting']	true	false
29.916047	Medium	1,648	false	false	Sell Diminishing-Valued Colored Balls	sell-diminishing-valued-colored-balls	['Array', 'Math', 'Binary Search', 'Greedy', 'Sorting', 'Heap (Priority Queue)']	false	false
39.715935	Hard	1,649	false	false	Create Sorted Array through Instructions	create-sorted-array-through-instructions	['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']	true	false
82.143153	Medium	1,650	false	true	Lowest Common Ancestor of a Binary Tree III	lowest-common-ancestor-of-a-binary-tree-iii	['Hash Table', 'Two Pointers', 'Tree', 'Binary Tree']	false	false
65.782111	Hard	1,651	false	true	Hopper Company Queries III	hopper-company-queries-iii	['Database']	false	false
79.2564	Easy	1,652	false	false	Defuse the Bomb	defuse-the-bomb	['Array', 'Sliding Window']	true	false
65.589232	Medium	1,653	false	false	Minimum Deletions to Make String Balanced	minimum-deletions-to-make-string-balanced	['String', 'Dynamic Programming', 'Stack']	true	false
29.998882	Medium	1,654	false	false	Minimum Jumps to Reach Home	minimum-jumps-to-reach-home	['Array', 'Dynamic Programming', 'Breadth-First Search']	false	false
39.587746	Hard	1,655	false	false	Distribute Repeating Integers	distribute-repeating-integers	['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']	false	false
84.45971	Easy	1,656	false	false	Design an Ordered Stream	design-an-ordered-stream	['Array', 'Hash Table', 'Design', 'Data Stream']	false	false
54.08105	Medium	1,657	false	false	Determine if Two Strings Are Close	determine-if-two-strings-are-close	['Hash Table', 'String', 'Sorting', 'Counting']	true	false
39.981624	Medium	1,658	false	false	Minimum Operations to Reduce X to Zero	minimum-operations-to-reduce-x-to-zero	['Array', 'Hash Table', 'Binary Search', 'Sliding Window', 'Prefix Sum']	true	false
39.625985	Hard	1,659	false	false	Maximize Grid Happiness	maximize-grid-happiness	['Dynamic Programming', 'Bit Manipulation', 'Memoization', 'Bitmask']	false	false
74.355216	Medium	1,660	false	true	Correct a Binary Tree	correct-a-binary-tree	['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	false
68.868214	Easy	1,661	false	false	Average Time of Process per Machine	average-time-of-process-per-machine	['Database']	true	false
85.710708	Easy	1,662	false	false	Check If Two String Arrays are Equivalent	check-if-two-string-arrays-are-equivalent	['Array', 'String']	true	false
67.002412	Medium	1,663	false	false	Smallest String With A Given Numeric Value	smallest-string-with-a-given-numeric-value	['String', 'Greedy']	true	false
64.26779	Medium	1,664	false	false	Ways to Make a Fair Array	ways-to-make-a-fair-array	['Array', 'Prefix Sum']	false	false
58.988564	Hard	1,665	false	false	Minimum Initial Energy to Finish Tasks	minimum-initial-energy-to-finish-tasks	['Array', 'Greedy', 'Sorting']	false	false
74.477673	Medium	1,666	false	true	Change the Root of a Binary Tree	change-the-root-of-a-binary-tree	['Tree', 'Depth-First Search', 'Binary Tree']	false	false
61.036195	Easy	1,667	false	false	Fix Names in a Table	fix-names-in-a-table	['Database']	true	false
39.319482	Easy	1,668	false	false	Maximum Repeating Substring	maximum-repeating-substring	['String', 'Dynamic Programming', 'String Matching']	false	false
82.200753	Medium	1,669	false	false	Merge In Between Linked Lists	merge-in-between-linked-lists	['Linked List']	true	false
57.049996	Medium	1,670	false	false	Design Front Middle Back Queue	design-front-middle-back-queue	['Array', 'Linked List', 'Design', 'Queue', 'Data Stream']	false	false
54.987048	Hard	1,671	false	false	Minimum Number of Removals to Make Mountain Array	minimum-number-of-removals-to-make-mountain-array	['Array', 'Binary Search', 'Dynamic Programming', 'Greedy']	true	false
88.50837	Easy	1,672	false	false	Richest Customer Wealth	richest-customer-wealth	['Array', 'Matrix']	true	true
51.533647	Medium	1,673	false	false	Find the Most Competitive Subsequence	find-the-most-competitive-subsequence	['Array', 'Stack', 'Greedy', 'Monotonic Stack']	true	false
41.398823	Medium	1,674	false	false	Minimum Moves to Make Array Complementary	minimum-moves-to-make-array-complementary	['Array', 'Hash Table', 'Prefix Sum']	false	false
53.915997	Hard	1,675	false	false	Minimize Deviation in Array	minimize-deviation-in-array	['Array', 'Greedy', 'Heap (Priority Queue)', 'Ordered Set']	true	false
78.906194	Medium	1,676	false	true	Lowest Common Ancestor of a Binary Tree IV	lowest-common-ancestor-of-a-binary-tree-iv	['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree']	false	false
38.448632	Easy	1,677	false	true	Product's Worth Over Invoices	products-worth-over-invoices	['Database']	false	false
87.62145	Easy	1,678	false	false	Goal Parser Interpretation	goal-parser-interpretation	['String']	false	false
56.00951	Medium	1,679	false	false	Max Number of K-Sum Pairs	max-number-of-k-sum-pairs	['Array', 'Hash Table', 'Two Pointers', 'Sorting']	true	false
56.632111	Medium	1,680	false	false	Concatenation of Consecutive Binary Numbers	concatenation-of-consecutive-binary-numbers	['Math', 'Bit Manipulation', 'Simulation']	true	false
39.66224	Hard	1,681	false	false	Minimum Incompatibility	minimum-incompatibility	['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']	false	false
50.181266	Medium	1,682	false	true	Longest Palindromic Subsequence II	longest-palindromic-subsequence-ii	['String', 'Dynamic Programming']	false	false
85.610243	Easy	1,683	false	false	Invalid Tweets	invalid-tweets	['Database']	true	false
88.23005	Easy	1,684	false	false	Count the Number of Consistent Strings	count-the-number-of-consistent-strings	['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Counting']	true	false
68.165329	Medium	1,685	false	false	Sum of Absolute Differences in a Sorted Array	sum-of-absolute-differences-in-a-sorted-array	['Array', 'Math', 'Prefix Sum']	true	false
58.468383	Medium	1,686	false	false	Stone Game VI	stone-game-vi	['Array', 'Math', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Game Theory']	false	false
39.177522	Hard	1,687	false	false	Delivering Boxes from Storage to Ports	delivering-boxes-from-storage-to-ports	['Array', 'Dynamic Programming', 'Segment Tree', 'Queue', 'Heap (Priority Queue)', 'Prefix Sum', 'Monotonic Queue']	false	false
85.859377	Easy	1,688	false	false	Count of Matches in Tournament	count-of-matches-in-tournament	['Math', 'Simulation']	true	false
88.598349	Medium	1,689	false	false	Partitioning Into Minimum Number Of Deci-Binary Numbers	partitioning-into-minimum-number-of-deci-binary-numbers	['String', 'Greedy']	true	false
58.23769	Medium	1,690	false	false	Stone Game VII	stone-game-vii	['Array', 'Math', 'Dynamic Programming', 'Game Theory']	true	false
59.638159	Hard	1,691	false	false	Maximum Height by Stacking Cuboids	maximum-height-by-stacking-cuboids	['Array', 'Dynamic Programming', 'Sorting']	false	false
63.035278	Hard	1,692	false	true	Count Ways to Distribute Candies	count-ways-to-distribute-candies	['Dynamic Programming']	false	false
86.568007	Easy	1,693	false	false	Daily Leads and Partners	daily-leads-and-partners	['Database']	true	false
66.760962	Easy	1,694	false	false	Reformat Phone Number	reformat-phone-number	['String']	false	false
59.131099	Medium	1,695	false	false	Maximum Erasure Value	maximum-erasure-value	['Array', 'Hash Table', 'Sliding Window']	true	false
45.884057	Medium	1,696	false	false	Jump Game VI	jump-game-vi	['Array', 'Dynamic Programming', 'Queue', 'Heap (Priority Queue)', 'Monotonic Queue']	true	false
62.71076	Hard	1,697	false	false	Checking Existence of Edge Length Limited Paths	checking-existence-of-edge-length-limited-paths	['Array', 'Two Pointers', 'Union Find', 'Graph', 'Sorting']	true	false
64.374841	Medium	1,698	false	true	Number of Distinct Substrings in a String	number-of-distinct-substrings-in-a-string	['String', 'Trie', 'Rolling Hash', 'Suffix Array', 'Hash Function']	false	false
80.964874	Medium	1,699	false	true	Number of Calls Between Two Persons	number-of-calls-between-two-persons	['Database']	false	false
78.573797	Easy	1,700	false	false	Number of Students Unable to Eat Lunch	number-of-students-unable-to-eat-lunch	['Array', 'Stack', 'Queue', 'Simulation']	true	false

64.421087

Hard

1,601

false

Maximum Number of Achievable Transfer Requests

maximum-number-of-achievable-transfer-requests

['Array', 'Backtracking', 'Bit Manipulation', 'Enumeration']

true

false

75.016292

Medium

1,602

false

true

Find Nearest Right Node in Binary Tree

find-nearest-right-node-in-binary-tree

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

true

88.039657

Easy

1,603

false

Design Parking System

design-parking-system

['Design', 'Simulation', 'Counting']

true

false

45.928264

Medium

1,604

false

Alert Using Same Key-Card Three or More Times in a One Hour Period

alert-using-same-key-card-three-or-more-times-in-a-one-hour-period

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

false

82.858093

Medium

1,605

false

Find Valid Matrix Given Row and Column Sums

find-valid-matrix-given-row-and-column-sums

['Array', 'Greedy', 'Matrix']

true

false

43.780779

Hard

1,606

false

Find Servers That Handled Most Number of Requests

find-servers-that-handled-most-number-of-requests

['Array', 'Greedy', 'Heap (Priority Queue)', 'Ordered Set']

true

false

54.461143

Easy

1,607

false

true

Sellers With No Sales

sellers-with-no-sales

['Database']

true

false

66.582636

Easy

1,608

false

Special Array With X Elements Greater Than or Equal X

special-array-with-x-elements-greater-than-or-equal-x

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

true

false

66.463435

Medium

1,609

false

Even Odd Tree

even-odd-tree

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

true

false

37.519006

Hard

1,610

false

Maximum Number of Visible Points

maximum-number-of-visible-points

['Array', 'Math', 'Geometry', 'Sliding Window', 'Sorting']

false

73.279798

Hard

1,611

false

Minimum One Bit Operations to Make Integers Zero

minimum-one-bit-operations-to-make-integers-zero

['Dynamic Programming', 'Bit Manipulation', 'Memoization']

true

false

71.056594

Medium

1,612

false

true

Check If Two Expression Trees are Equivalent

check-if-two-expression-trees-are-equivalent

['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree', 'Counting']

false

73.115038

Medium

1,613

false

true

Find the Missing IDs

find-the-missing-ids

['Database']

false

84.216934

Easy

1,614

false

Maximum Nesting Depth of the Parentheses

maximum-nesting-depth-of-the-parentheses

['String', 'Stack']

true

false

65.36765

Medium

1,615

false

Maximal Network Rank

maximal-network-rank

['Graph']

true

false

31.282136

Medium

1,616

false

Split Two Strings to Make Palindrome

split-two-strings-to-make-palindrome

['Two Pointers', 'String']

false

66.647468

Hard

1,617

false

Count Subtrees With Max Distance Between Cities

count-subtrees-with-max-distance-between-cities

['Dynamic Programming', 'Bit Manipulation', 'Tree', 'Enumeration', 'Bitmask']

false

61.233216

Medium

1,618

false

true

Maximum Font to Fit a Sentence in a Screen

maximum-font-to-fit-a-sentence-in-a-screen

['Array', 'String', 'Binary Search', 'Interactive']

false

70.110366

Easy

1,619

false

Mean of Array After Removing Some Elements

mean-of-array-after-removing-some-elements

['Array', 'Sorting']

false

38.17188

Medium

1,620

false

Coordinate With Maximum Network Quality

coordinate-with-maximum-network-quality

['Array', 'Enumeration']

false

44.419505

Medium

1,621

false

Number of Sets of K Non-Overlapping Line Segments

number-of-sets-of-k-non-overlapping-line-segments

['Math', 'Dynamic Programming', 'Combinatorics']

false

18.124865

Hard

1,622

false

Fancy Sequence

fancy-sequence

['Math', 'Design', 'Segment Tree']

false

80.935265

Easy

1,623

false

true

All Valid Triplets That Can Represent a Country

all-valid-triplets-that-can-represent-a-country

['Database']

false

68.234983

Easy

1,624

false

Largest Substring Between Two Equal Characters

largest-substring-between-two-equal-characters

['Hash Table', 'String']

true

false

64.88669

Medium

1,625

false

Lexicographically Smallest String After Applying Operations

lexicographically-smallest-string-after-applying-operations

['String', 'Depth-First Search', 'Breadth-First Search', 'Enumeration']

false

50.354503

Medium

1,626

false

Best Team With No Conflicts

best-team-with-no-conflicts

['Array', 'Dynamic Programming', 'Sorting']

true

false

47.963478

Hard

1,627

false

Graph Connectivity With Threshold

graph-connectivity-with-threshold

['Array', 'Math', 'Union Find', 'Number Theory']

false

82.409335

Medium

1,628

false

true

Design an Expression Tree With Evaluate Function

design-an-expression-tree-with-evaluate-function

['Array', 'Math', 'Stack', 'Tree', 'Design', 'Binary Tree']

false

59.219808

Easy

1,629

false

Slowest Key

slowest-key

['Array', 'String']

true

false

83.683128

Medium

1,630

false

Arithmetic Subarrays

arithmetic-subarrays

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

true

false

60.977361

Medium

1,631

false

Path With Minimum Effort

path-with-minimum-effort

['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix']

true

false

41.343704

Hard

1,632

false

Rank Transform of a Matrix

rank-transform-of-a-matrix

['Array', 'Union Find', 'Graph', 'Topological Sort', 'Sorting', 'Matrix']

true

false

58.490541

Easy

1,633

false

Percentage of Users Attended a Contest

percentage-of-users-attended-a-contest

['Database']

true

false

60.661438

Medium

1,634

false

true

Add Two Polynomials Represented as Linked Lists

add-two-polynomials-represented-as-linked-lists

['Linked List', 'Math', 'Two Pointers']

true

false

48.13176

Hard

1,635

false

true

Hopper Company Queries I

hopper-company-queries-i

['Database']

true

false

80.133346

Easy

1,636

false

Sort Array by Increasing Frequency

sort-array-by-increasing-frequency

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

true

false

87.061776

Easy

1,637

false

Widest Vertical Area Between Two Points Containing No Points

widest-vertical-area-between-two-points-containing-no-points

['Array', 'Sorting']

true

false

71.535257

Medium

1,638

false

Count Substrings That Differ by One Character

count-substrings-that-differ-by-one-character

['Hash Table', 'String', 'Dynamic Programming', 'Enumeration']

false

57.183988

Hard

1,639

false

Number of Ways to Form a Target String Given a Dictionary

number-of-ways-to-form-a-target-string-given-a-dictionary

['Array', 'String', 'Dynamic Programming']

true

false

56.904881

Easy

1,640

false

Check Array Formation Through Concatenation

check-array-formation-through-concatenation

['Array', 'Hash Table']

true

false

78.800814

Medium

1,641

false

Count Sorted Vowel Strings

count-sorted-vowel-strings

['Math', 'Dynamic Programming', 'Combinatorics']

true

false

50.228349

Medium

1,642

false

Furthest Building You Can Reach

furthest-building-you-can-reach

['Array', 'Greedy', 'Heap (Priority Queue)']

true

false

45.583879

Hard

1,643

false

Kth Smallest Instructions

kth-smallest-instructions

['Array', 'Math', 'Dynamic Programming', 'Combinatorics']

false

68.307762

Medium

1,644

false

true

Lowest Common Ancestor of a Binary Tree II

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

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

true

false

39.418265

Hard

1,645

false

true

Hopper Company Queries II

hopper-company-queries-ii

['Database']

false

50.899925

Easy

1,646

false

Get Maximum in Generated Array

get-maximum-in-generated-array

['Array', 'Simulation']

true

false

61.262053

Medium

1,647

false

Minimum Deletions to Make Character Frequencies Unique

minimum-deletions-to-make-character-frequencies-unique

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

true

false

29.916047

Medium

1,648

false

Sell Diminishing-Valued Colored Balls

sell-diminishing-valued-colored-balls

['Array', 'Math', 'Binary Search', 'Greedy', 'Sorting', 'Heap (Priority Queue)']

false

39.715935

Hard

1,649

false

Create Sorted Array through Instructions

create-sorted-array-through-instructions

['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']

true

false

82.143153

Medium

1,650

false

true

Lowest Common Ancestor of a Binary Tree III

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

['Hash Table', 'Two Pointers', 'Tree', 'Binary Tree']

false

65.782111

Hard

1,651

false

true

Hopper Company Queries III

hopper-company-queries-iii

['Database']

false

79.2564

Easy

1,652

false

Defuse the Bomb

defuse-the-bomb

['Array', 'Sliding Window']

true

false

65.589232

Medium

1,653

false

Minimum Deletions to Make String Balanced

minimum-deletions-to-make-string-balanced

['String', 'Dynamic Programming', 'Stack']

true

false

29.998882

Medium

1,654

false

Minimum Jumps to Reach Home

minimum-jumps-to-reach-home

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

false

39.587746

Hard

1,655

false

Distribute Repeating Integers

distribute-repeating-integers

['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']

false

84.45971

Easy

1,656

false

Design an Ordered Stream

design-an-ordered-stream

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

false

54.08105

Medium

1,657

false

Determine if Two Strings Are Close

determine-if-two-strings-are-close

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

true

false

39.981624

Medium

1,658

false

Minimum Operations to Reduce X to Zero

minimum-operations-to-reduce-x-to-zero

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

true

false

39.625985

Hard

1,659

false

Maximize Grid Happiness

maximize-grid-happiness

['Dynamic Programming', 'Bit Manipulation', 'Memoization', 'Bitmask']

false

74.355216

Medium

1,660

false

true

Correct a Binary Tree

correct-a-binary-tree

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

true

false

68.868214

Easy

1,661

false

Average Time of Process per Machine

average-time-of-process-per-machine

['Database']

true

false

85.710708

Easy

1,662

false

Check If Two String Arrays are Equivalent

check-if-two-string-arrays-are-equivalent

['Array', 'String']

true

false

67.002412

Medium

1,663

false

Smallest String With A Given Numeric Value

smallest-string-with-a-given-numeric-value

['String', 'Greedy']

true

false

64.26779

Medium

1,664

false

Ways to Make a Fair Array

ways-to-make-a-fair-array

['Array', 'Prefix Sum']

false

58.988564

Hard

1,665

false

Minimum Initial Energy to Finish Tasks

minimum-initial-energy-to-finish-tasks

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

false

74.477673

Medium

1,666

false

true

Change the Root of a Binary Tree

change-the-root-of-a-binary-tree

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

false

61.036195

Easy

1,667

false

Fix Names in a Table

fix-names-in-a-table

['Database']

true

false

39.319482

Easy

1,668

false

Maximum Repeating Substring

maximum-repeating-substring

['String', 'Dynamic Programming', 'String Matching']

false

82.200753

Medium

1,669

false

Merge In Between Linked Lists

merge-in-between-linked-lists

['Linked List']

true

false

57.049996

Medium

1,670

false

Design Front Middle Back Queue

design-front-middle-back-queue

['Array', 'Linked List', 'Design', 'Queue', 'Data Stream']

false

54.987048

Hard

1,671

false

Minimum Number of Removals to Make Mountain Array

minimum-number-of-removals-to-make-mountain-array

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

true

false

88.50837

Easy

1,672

false

Richest Customer Wealth

richest-customer-wealth

['Array', 'Matrix']

true

51.533647

Medium

1,673

false

Find the Most Competitive Subsequence

find-the-most-competitive-subsequence

['Array', 'Stack', 'Greedy', 'Monotonic Stack']

true

false

41.398823

Medium

1,674

false

Minimum Moves to Make Array Complementary

minimum-moves-to-make-array-complementary

['Array', 'Hash Table', 'Prefix Sum']

false

53.915997

Hard

1,675

false

Minimize Deviation in Array

minimize-deviation-in-array

['Array', 'Greedy', 'Heap (Priority Queue)', 'Ordered Set']

true

false

78.906194

Medium

1,676

false

true

Lowest Common Ancestor of a Binary Tree IV

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

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

false

38.448632

Easy

1,677

false

true

Product's Worth Over Invoices

products-worth-over-invoices

['Database']

false

87.62145

Easy

1,678

false

Goal Parser Interpretation

goal-parser-interpretation

['String']

false

56.00951

Medium

1,679

false

Max Number of K-Sum Pairs

max-number-of-k-sum-pairs

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

true

false

56.632111

Medium

1,680

false

Concatenation of Consecutive Binary Numbers

concatenation-of-consecutive-binary-numbers

['Math', 'Bit Manipulation', 'Simulation']

true

false

39.66224

Hard

1,681

false

Minimum Incompatibility

minimum-incompatibility

['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']

false

50.181266

Medium

1,682

false

true

Longest Palindromic Subsequence II

longest-palindromic-subsequence-ii

['String', 'Dynamic Programming']

false

85.610243

Easy

1,683

false

Invalid Tweets

invalid-tweets

['Database']

true

false

88.23005

Easy

1,684

false

Count the Number of Consistent Strings

count-the-number-of-consistent-strings

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

true

false

68.165329

Medium

1,685

false

Sum of Absolute Differences in a Sorted Array

sum-of-absolute-differences-in-a-sorted-array

['Array', 'Math', 'Prefix Sum']

true

false

58.468383

Medium

1,686

false

Stone Game VI

stone-game-vi

['Array', 'Math', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Game Theory']

false

39.177522

Hard

1,687

false

Delivering Boxes from Storage to Ports

delivering-boxes-from-storage-to-ports

['Array', 'Dynamic Programming', 'Segment Tree', 'Queue', 'Heap (Priority Queue)', 'Prefix Sum', 'Monotonic Queue']

false

85.859377

Easy

1,688

false

Count of Matches in Tournament

count-of-matches-in-tournament

['Math', 'Simulation']

true

false

88.598349

Medium

1,689

false

Partitioning Into Minimum Number Of Deci-Binary Numbers

partitioning-into-minimum-number-of-deci-binary-numbers

['String', 'Greedy']

true

false

58.23769

Medium

1,690

false

Stone Game VII

stone-game-vii

['Array', 'Math', 'Dynamic Programming', 'Game Theory']

true

false

59.638159

Hard

1,691

false

Maximum Height by Stacking Cuboids

maximum-height-by-stacking-cuboids

['Array', 'Dynamic Programming', 'Sorting']

false

63.035278

Hard

1,692

false

true

Count Ways to Distribute Candies

count-ways-to-distribute-candies

['Dynamic Programming']

false

86.568007

Easy

1,693

false

Daily Leads and Partners

daily-leads-and-partners

['Database']

true

false

66.760962

Easy

1,694

false

Reformat Phone Number

reformat-phone-number

['String']

false

59.131099

Medium

1,695

false

Maximum Erasure Value

maximum-erasure-value

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

true

false

45.884057

Medium

1,696

false

Jump Game VI

jump-game-vi

['Array', 'Dynamic Programming', 'Queue', 'Heap (Priority Queue)', 'Monotonic Queue']

true

false

62.71076

Hard

1,697

false

Checking Existence of Edge Length Limited Paths

checking-existence-of-edge-length-limited-paths

['Array', 'Two Pointers', 'Union Find', 'Graph', 'Sorting']

true

false

64.374841

Medium

1,698

false

true

Number of Distinct Substrings in a String

number-of-distinct-substrings-in-a-string

['String', 'Trie', 'Rolling Hash', 'Suffix Array', 'Hash Function']

false

80.964874

Medium

1,699

false

true

Number of Calls Between Two Persons

number-of-calls-between-two-persons

['Database']

false

78.573797

Easy

1,700

false

Number of Students Unable to Eat Lunch

number-of-students-unable-to-eat-lunch

['Array', 'Stack', 'Queue', 'Simulation']

true

false