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
56.814979	Medium	3,101	false	false	Count Alternating Subarrays	count-alternating-subarrays	['Array', 'Math']	false	false
31.227467	Hard	3,102	false	false	Minimize Manhattan Distances	minimize-manhattan-distances	['Array', 'Math', 'Geometry', 'Sorting', 'Ordered Set']	false	false
65.668907	Hard	3,103	false	true	Find Trending Hashtags II	find-trending-hashtags-ii	['Database']	false	false
58.869941	Hard	3,104	false	true	Find Longest Self-Contained Substring	find-longest-self-contained-substring	['Hash Table', 'String', 'Binary Search', 'Prefix Sum']	false	false
65.093424	Easy	3,105	false	false	Longest Strictly Increasing or Strictly Decreasing Subarray	longest-strictly-increasing-or-strictly-decreasing-subarray	['Array']	true	false
62.059119	Medium	3,106	false	false	Lexicographically Smallest String After Operations With Constraint	lexicographically-smallest-string-after-operations-with-constraint	['String', 'Greedy']	false	false
46.475302	Medium	3,107	false	false	Minimum Operations to Make Median of Array Equal to K	minimum-operations-to-make-median-of-array-equal-to-k	['Array', 'Greedy', 'Sorting']	false	false
68.617854	Hard	3,108	false	false	Minimum Cost Walk in Weighted Graph	minimum-cost-walk-in-weighted-graph	['Array', 'Bit Manipulation', 'Union Find', 'Graph']	true	false
36.680698	Medium	3,109	false	true	Find the Index of Permutation	find-the-index-of-permutation	['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']	false	false
91.969052	Easy	3,110	false	false	Score of a String	score-of-a-string	['String']	true	false
61.999278	Medium	3,111	false	false	Minimum Rectangles to Cover Points	minimum-rectangles-to-cover-points	['Array', 'Greedy', 'Sorting']	false	false
35.177158	Medium	3,112	false	false	Minimum Time to Visit Disappearing Nodes	minimum-time-to-visit-disappearing-nodes	['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']	false	false
29.580414	Hard	3,113	false	false	Find the Number of Subarrays Where Boundary Elements Are Maximum	find-the-number-of-subarrays-where-boundary-elements-are-maximum	['Array', 'Binary Search', 'Stack', 'Monotonic Stack']	false	false
35.418778	Easy	3,114	false	false	Latest Time You Can Obtain After Replacing Characters	latest-time-you-can-obtain-after-replacing-characters	['String', 'Enumeration']	false	false
57.1778	Medium	3,115	false	false	Maximum Prime Difference	maximum-prime-difference	['Array', 'Math', 'Number Theory']	false	false
18.176393	Hard	3,116	false	false	Kth Smallest Amount With Single Denomination Combination	kth-smallest-amount-with-single-denomination-combination	['Array', 'Math', 'Binary Search', 'Bit Manipulation', 'Combinatorics', 'Number Theory']	false	false
26.910946	Hard	3,117	false	false	Minimum Sum of Values by Dividing Array	minimum-sum-of-values-by-dividing-array	['Array', 'Binary Search', 'Dynamic Programming', 'Bit Manipulation', 'Segment Tree', 'Queue']	false	false
57.222017	Medium	3,118	false	true	Friday Purchase III	friday-purchase-iii	['Database']	false	false
54.013822	Medium	3,119	false	true	Maximum Number of Potholes That Can Be Fixed	maximum-number-of-potholes-that-can-be-fixed	['String', 'Greedy', 'Sorting']	false	false
65.064954	Easy	3,120	false	false	Count the Number of Special Characters I	count-the-number-of-special-characters-i	['Hash Table', 'String']	false	false
41.75434	Medium	3,121	false	false	Count the Number of Special Characters II	count-the-number-of-special-characters-ii	['Hash Table', 'String']	false	false
40.089569	Medium	3,122	false	false	Minimum Number of Operations to Satisfy Conditions	minimum-number-of-operations-to-satisfy-conditions	['Array', 'Dynamic Programming', 'Matrix']	false	false
45.285973	Hard	3,123	false	false	Find Edges in Shortest Paths	find-edges-in-shortest-paths	['Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']	false	false
62.275242	Medium	3,124	false	true	Find Longest Calls	find-longest-calls	['Database']	false	false
68	Medium	3,125	false	true	Maximum Number That Makes Result of Bitwise AND Zero	maximum-number-that-makes-result-of-bitwise-and-zero	['String', 'Greedy', 'Sorting']	false	false
61.627907	Medium	3,126	false	true	Server Utilization Time	server-utilization-time	['Database']	false	false
51.605587	Easy	3,127	false	false	Make a Square with the Same Color	make-a-square-with-the-same-color	['Array', 'Matrix', 'Enumeration']	false	false
46.577772	Medium	3,128	false	false	Right Triangles	right-triangles	['Array', 'Hash Table', 'Math', 'Combinatorics', 'Counting']	false	false
25.961709	Medium	3,129	false	false	Find All Possible Stable Binary Arrays I	find-all-possible-stable-binary-arrays-i	['Dynamic Programming', 'Prefix Sum']	false	false
25.450197	Hard	3,130	false	false	Find All Possible Stable Binary Arrays II	find-all-possible-stable-binary-arrays-ii	['Dynamic Programming', 'Prefix Sum']	false	false
81.88177	Easy	3,131	false	false	Find the Integer Added to Array I	find-the-integer-added-to-array-i	['Array']	false	false
31.577103	Medium	3,132	false	false	Find the Integer Added to Array II	find-the-integer-added-to-array-ii	['Array', 'Two Pointers', 'Sorting', 'Enumeration']	false	false
55.548204	Medium	3,133	false	false	Minimum Array End	minimum-array-end	['Bit Manipulation']	true	false
27.686611	Hard	3,134	false	false	Find the Median of the Uniqueness Array	find-the-median-of-the-uniqueness-array	['Array', 'Hash Table', 'Binary Search', 'Sliding Window']	false	false
55.023184	Medium	3,135	false	true	Equalize Strings by Adding or Removing Characters at Ends	equalize-strings-by-adding-or-removing-characters-at-ends	['String', 'Binary Search', 'Dynamic Programming', 'Sliding Window', 'Hash Function']	false	false
38.431156	Easy	3,136	false	false	Valid Word	valid-word	['String']	false	false
59.502713	Medium	3,137	false	false	Minimum Number of Operations to Make Word K-Periodic	minimum-number-of-operations-to-make-word-k-periodic	['Hash Table', 'String', 'Counting']	false	false
40.532054	Medium	3,138	false	false	Minimum Length of Anagram Concatenation	minimum-length-of-anagram-concatenation	['Hash Table', 'String', 'Counting']	false	false
17.618923	Hard	3,139	false	false	Minimum Cost to Equalize Array	minimum-cost-to-equalize-array	['Array', 'Greedy', 'Enumeration']	false	false
57.579701	Medium	3,140	false	true	Consecutive Available Seats II	consecutive-available-seats-ii	['Database']	false	false
46.708747	Hard	3,141	false	true	Maximum Hamming Distances	maximum-hamming-distances	['Array', 'Bit Manipulation', 'Breadth-First Search']	false	false
43.273136	Easy	3,142	false	false	Check if Grid Satisfies Conditions	check-if-grid-satisfies-conditions	['Array', 'Matrix']	false	false
37.875827	Medium	3,143	false	false	Maximum Points Inside the Square	maximum-points-inside-the-square	['Array', 'Hash Table', 'String', 'Binary Search', 'Sorting']	false	false
38.720589	Medium	3,144	false	false	Minimum Substring Partition of Equal Character Frequency	minimum-substring-partition-of-equal-character-frequency	['Hash Table', 'String', 'Dynamic Programming', 'Counting']	false	false
21.462412	Hard	3,145	false	false	Find Products of Elements of Big Array	find-products-of-elements-of-big-array	['Array', 'Binary Search', 'Bit Manipulation']	false	false
87.048816	Easy	3,146	false	false	Permutation Difference between Two Strings	permutation-difference-between-two-strings	['Hash Table', 'String']	false	false
40.864802	Medium	3,147	false	false	Taking Maximum Energy From the Mystic Dungeon	taking-maximum-energy-from-the-mystic-dungeon	['Array', 'Prefix Sum']	false	false
46.48086	Medium	3,148	false	false	Maximum Difference Score in a Grid	maximum-difference-score-in-a-grid	['Array', 'Dynamic Programming', 'Matrix']	false	false
22.834679	Hard	3,149	false	false	Find the Minimum Cost Array Permutation	find-the-minimum-cost-array-permutation	['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']	false	false
86.759814	Easy	3,150	false	true	Invalid Tweets II	invalid-tweets-ii	['Database']	false	false
81.83247	Easy	3,151	false	false	Special Array I	special-array-i	['Array']	true	false
45.675347	Medium	3,152	false	false	Special Array II	special-array-ii	['Array', 'Binary Search', 'Prefix Sum']	true	false
42.323341	Medium	3,153	false	false	Sum of Digit Differences of All Pairs	sum-of-digit-differences-of-all-pairs	['Array', 'Hash Table', 'Math', 'Counting']	false	false
35.812942	Hard	3,154	false	false	Find Number of Ways to Reach the K-th Stair	find-number-of-ways-to-reach-the-k-th-stair	['Math', 'Dynamic Programming', 'Bit Manipulation', 'Memoization', 'Combinatorics']	false	false
40.177778	Medium	3,155	false	true	Maximum Number of Upgradable Servers	maximum-number-of-upgradable-servers	['Array', 'Math', 'Binary Search']	false	false
45.628903	Hard	3,156	false	true	Employee Task Duration and Concurrent Tasks	employee-task-duration-and-concurrent-tasks	['Database']	false	false
68.569712	Medium	3,157	false	true	Find the Level of Tree with Minimum Sum	find-the-level-of-tree-with-minimum-sum	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	false	false
79.510518	Easy	3,158	false	false	Find the XOR of Numbers Which Appear Twice	find-the-xor-of-numbers-which-appear-twice	['Array', 'Hash Table', 'Bit Manipulation']	false	false
72.313766	Medium	3,159	false	false	Find Occurrences of an Element in an Array	find-occurrences-of-an-element-in-an-array	['Array', 'Hash Table']	false	false
54.213314	Medium	3,160	false	false	Find the Number of Distinct Colors Among the Balls	find-the-number-of-distinct-colors-among-the-balls	['Array', 'Hash Table', 'Simulation']	true	false
16.062246	Hard	3,161	false	false	Block Placement Queries	block-placement-queries	['Array', 'Binary Search', 'Binary Indexed Tree', 'Segment Tree']	false	false
85.468205	Easy	3,162	false	false	Find the Number of Good Pairs I	find-the-number-of-good-pairs-i	['Array', 'Hash Table']	false	false
68.016874	Medium	3,163	false	false	String Compression III	string-compression-iii	['String']	true	false
25.938914	Medium	3,164	false	false	Find the Number of Good Pairs II	find-the-number-of-good-pairs-ii	['Array', 'Hash Table']	false	false
15.938947	Hard	3,165	false	false	Maximum Sum of Subsequence With Non-adjacent Elements	maximum-sum-of-subsequence-with-non-adjacent-elements	['Array', 'Divide and Conquer', 'Dynamic Programming', 'Segment Tree']	false	false
52.758402	Medium	3,166	false	true	Calculate Parking Fees and Duration	calculate-parking-fees-and-duration	['Database']	false	false
75.494723	Medium	3,167	false	true	Better Compression of String	better-compression-of-string	['Hash Table', 'String', 'Sorting', 'Counting']	false	false
78.676518	Easy	3,168	false	false	Minimum Number of Chairs in a Waiting Room	minimum-number-of-chairs-in-a-waiting-room	['String', 'Simulation']	false	false
47.822243	Medium	3,169	false	false	Count Days Without Meetings	count-days-without-meetings	['Array', 'Sorting']	true	false
35.193636	Medium	3,170	false	false	Lexicographically Minimum String After Removing Stars	lexicographically-minimum-string-after-removing-stars	['Hash Table', 'String', 'Stack', 'Greedy', 'Heap (Priority Queue)']	false	false
29.453313	Hard	3,171	false	false	Find Subarray With Bitwise OR Closest to K	find-subarray-with-bitwise-or-closest-to-k	['Array', 'Binary Search', 'Bit Manipulation', 'Segment Tree']	false	false
68.113899	Easy	3,172	false	true	Second Day Verification	second-day-verification	['Database']	false	false
95.267143	Easy	3,173	false	true	Bitwise OR of Adjacent Elements	bitwise-or-of-adjacent-elements	['Array', 'Bit Manipulation']	false	false
82.568833	Easy	3,174	false	false	Clear Digits	clear-digits	['String', 'Stack', 'Simulation']	true	false
39.290572	Medium	3,175	false	false	Find The First Player to win K Games in a Row	find-the-first-player-to-win-k-games-in-a-row	['Array', 'Simulation']	false	false
31.210591	Medium	3,176	false	false	Find the Maximum Length of a Good Subsequence I	find-the-maximum-length-of-a-good-subsequence-i	['Array', 'Hash Table', 'Dynamic Programming']	false	false
23.636907	Hard	3,177	false	false	Find the Maximum Length of a Good Subsequence II	find-the-maximum-length-of-a-good-subsequence-ii	['Array', 'Hash Table', 'Dynamic Programming']	false	false
61.474404	Easy	3,178	false	false	Find the Child Who Has the Ball After K Seconds	find-the-child-who-has-the-ball-after-k-seconds	['Math', 'Simulation']	false	false
53.574125	Medium	3,179	false	false	Find the N-th Value After K Seconds	find-the-n-th-value-after-k-seconds	['Array', 'Math', 'Simulation', 'Combinatorics', 'Prefix Sum']	false	false
29.722342	Medium	3,180	false	false	Maximum Total Reward Using Operations I	maximum-total-reward-using-operations-i	['Array', 'Dynamic Programming']	false	false
20.455909	Hard	3,181	false	false	Maximum Total Reward Using Operations II	maximum-total-reward-using-operations-ii	['Array', 'Dynamic Programming', 'Bit Manipulation']	false	false
49.906191	Medium	3,182	false	true	Find Top Scoring Students	find-top-scoring-students	['Database']	false	false
52.454243	Medium	3,183	false	true	The Number of Ways to Make the Sum	the-number-of-ways-to-make-the-sum	['Array', 'Dynamic Programming']	false	false
77.390406	Easy	3,184	false	false	Count Pairs That Form a Complete Day I	count-pairs-that-form-a-complete-day-i	['Array', 'Hash Table', 'Counting']	false	false
42.857282	Medium	3,185	false	false	Count Pairs That Form a Complete Day II	count-pairs-that-form-a-complete-day-ii	['Array', 'Hash Table', 'Counting']	false	false
27.426315	Medium	3,186	false	false	Maximum Total Damage With Spell Casting	maximum-total-damage-with-spell-casting	['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Dynamic Programming', 'Sorting', 'Counting']	false	false
25.911129	Hard	3,187	false	false	Peaks in Array	peaks-in-array	['Array', 'Binary Indexed Tree', 'Segment Tree']	false	false
38.241206	Hard	3,188	false	true	Find Top Scoring Students II	find-top-scoring-students-ii	['Database']	false	false
76.071002	Medium	3,189	false	true	Minimum Moves to Get a Peaceful Board	minimum-moves-to-get-a-peaceful-board	['Array', 'Greedy', 'Sorting', 'Counting Sort']	true	false
88.652973	Easy	3,190	false	false	Find Minimum Operations to Make All Elements Divisible by Three	find-minimum-operations-to-make-all-elements-divisible-by-three	['Array', 'Math']	false	false
80.516658	Medium	3,191	false	false	Minimum Operations to Make Binary Array Elements Equal to One I	minimum-operations-to-make-binary-array-elements-equal-to-one-i	['Array', 'Bit Manipulation', 'Queue', 'Sliding Window', 'Prefix Sum']	true	false
63.754819	Medium	3,192	false	false	Minimum Operations to Make Binary Array Elements Equal to One II	minimum-operations-to-make-binary-array-elements-equal-to-one-ii	['Array', 'Dynamic Programming', 'Greedy']	false	false
32.457667	Hard	3,193	false	false	Count the Number of Inversions	count-the-number-of-inversions	['Array', 'Dynamic Programming']	false	false
84.653568	Easy	3,194	false	false	Minimum Average of Smallest and Largest Elements	minimum-average-of-smallest-and-largest-elements	['Array', 'Two Pointers', 'Sorting']	false	false
71.090885	Medium	3,195	false	false	Find the Minimum Area to Cover All Ones I	find-the-minimum-area-to-cover-all-ones-i	['Array', 'Matrix']	false	false
28.470669	Medium	3,196	false	false	Maximize Total Cost of Alternating Subarrays	maximize-total-cost-of-alternating-subarrays	['Array', 'Dynamic Programming']	false	false
35.681661	Hard	3,197	false	false	Find the Minimum Area to Cover All Ones II	find-the-minimum-area-to-cover-all-ones-ii	['Array', 'Matrix', 'Enumeration']	false	false
82.961672	Easy	3,198	false	true	Find Cities in Each State	find-cities-in-each-state	['Database']	false	false
82.993197	Easy	3,199	false	true	Count Triplets with Even XOR Set Bits I	count-triplets-with-even-xor-set-bits-i	['Array', 'Bit Manipulation']	false	false
43.02771	Easy	3,200	false	false	Maximum Height of a Triangle	maximum-height-of-a-triangle	['Array', 'Enumeration']	false	false

56.814979

Medium

3,101

false

Count Alternating Subarrays

count-alternating-subarrays

['Array', 'Math']

false

31.227467

Hard

3,102

false

Minimize Manhattan Distances

minimize-manhattan-distances

['Array', 'Math', 'Geometry', 'Sorting', 'Ordered Set']

false

65.668907

Hard

3,103

false

true

Find Trending Hashtags II

find-trending-hashtags-ii

['Database']

false

58.869941

Hard

3,104

false

true

Find Longest Self-Contained Substring

find-longest-self-contained-substring

['Hash Table', 'String', 'Binary Search', 'Prefix Sum']

false

65.093424

Easy

3,105

false

Longest Strictly Increasing or Strictly Decreasing Subarray

longest-strictly-increasing-or-strictly-decreasing-subarray

['Array']

true

false

62.059119

Medium

3,106

false

Lexicographically Smallest String After Operations With Constraint

lexicographically-smallest-string-after-operations-with-constraint

['String', 'Greedy']

false

46.475302

Medium

3,107

false

Minimum Operations to Make Median of Array Equal to K

minimum-operations-to-make-median-of-array-equal-to-k

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

false

68.617854

Hard

3,108

false

Minimum Cost Walk in Weighted Graph

minimum-cost-walk-in-weighted-graph

['Array', 'Bit Manipulation', 'Union Find', 'Graph']

true

false

36.680698

Medium

3,109

false

true

Find the Index of Permutation

find-the-index-of-permutation

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

false

91.969052

Easy

3,110

false

Score of a String

score-of-a-string

['String']

true

false

61.999278

Medium

3,111

false

Minimum Rectangles to Cover Points

minimum-rectangles-to-cover-points

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

false

35.177158

Medium

3,112

false

Minimum Time to Visit Disappearing Nodes

minimum-time-to-visit-disappearing-nodes

['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']

false

29.580414

Hard

3,113

false

Find the Number of Subarrays Where Boundary Elements Are Maximum

find-the-number-of-subarrays-where-boundary-elements-are-maximum

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

false

35.418778

Easy

3,114

false

Latest Time You Can Obtain After Replacing Characters

latest-time-you-can-obtain-after-replacing-characters

['String', 'Enumeration']

false

57.1778

Medium

3,115

false

Maximum Prime Difference

maximum-prime-difference

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

false

18.176393

Hard

3,116

false

Kth Smallest Amount With Single Denomination Combination

kth-smallest-amount-with-single-denomination-combination

['Array', 'Math', 'Binary Search', 'Bit Manipulation', 'Combinatorics', 'Number Theory']

false

26.910946

Hard

3,117

false

Minimum Sum of Values by Dividing Array

minimum-sum-of-values-by-dividing-array

['Array', 'Binary Search', 'Dynamic Programming', 'Bit Manipulation', 'Segment Tree', 'Queue']

false

57.222017

Medium

3,118

false

true

Friday Purchase III

friday-purchase-iii

['Database']

false

54.013822

Medium

3,119

false

true

Maximum Number of Potholes That Can Be Fixed

maximum-number-of-potholes-that-can-be-fixed

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

false

65.064954

Easy

3,120

false

Count the Number of Special Characters I

count-the-number-of-special-characters-i

['Hash Table', 'String']

false

41.75434

Medium

3,121

false

Count the Number of Special Characters II

count-the-number-of-special-characters-ii

['Hash Table', 'String']

false

40.089569

Medium

3,122

false

Minimum Number of Operations to Satisfy Conditions

minimum-number-of-operations-to-satisfy-conditions

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

false

45.285973

Hard

3,123

false

Find Edges in Shortest Paths

find-edges-in-shortest-paths

['Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']

false

62.275242

Medium

3,124

false

true

Find Longest Calls

find-longest-calls

['Database']

false

68

Medium

3,125

false

true

Maximum Number That Makes Result of Bitwise AND Zero

maximum-number-that-makes-result-of-bitwise-and-zero

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

false

61.627907

Medium

3,126

false

true

Server Utilization Time

server-utilization-time

['Database']

false

51.605587

Easy

3,127

false

Make a Square with the Same Color

make-a-square-with-the-same-color

['Array', 'Matrix', 'Enumeration']

false

46.577772

Medium

3,128

false

Right Triangles

right-triangles

['Array', 'Hash Table', 'Math', 'Combinatorics', 'Counting']

false

25.961709

Medium

3,129

false

Find All Possible Stable Binary Arrays I

find-all-possible-stable-binary-arrays-i

['Dynamic Programming', 'Prefix Sum']

false

25.450197

Hard

3,130

false

Find All Possible Stable Binary Arrays II

find-all-possible-stable-binary-arrays-ii

['Dynamic Programming', 'Prefix Sum']

false

81.88177

Easy

3,131

false

Find the Integer Added to Array I

find-the-integer-added-to-array-i

['Array']

false

31.577103

Medium

3,132

false

Find the Integer Added to Array II

find-the-integer-added-to-array-ii

['Array', 'Two Pointers', 'Sorting', 'Enumeration']

false

55.548204

Medium

3,133

false

Minimum Array End

minimum-array-end

['Bit Manipulation']

true

false

27.686611

Hard

3,134

false

Find the Median of the Uniqueness Array

find-the-median-of-the-uniqueness-array

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

false

55.023184

Medium

3,135

false

true

Equalize Strings by Adding or Removing Characters at Ends

equalize-strings-by-adding-or-removing-characters-at-ends

['String', 'Binary Search', 'Dynamic Programming', 'Sliding Window', 'Hash Function']

false

38.431156

Easy

3,136

false

Valid Word

valid-word

['String']

false

59.502713

Medium

3,137

false

Minimum Number of Operations to Make Word K-Periodic

minimum-number-of-operations-to-make-word-k-periodic

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

false

40.532054

Medium

3,138

false

Minimum Length of Anagram Concatenation

minimum-length-of-anagram-concatenation

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

false

17.618923

Hard

3,139

false

Minimum Cost to Equalize Array

minimum-cost-to-equalize-array

['Array', 'Greedy', 'Enumeration']

false

57.579701

Medium

3,140

false

true

Consecutive Available Seats II

consecutive-available-seats-ii

['Database']

false

46.708747

Hard

3,141

false

true

Maximum Hamming Distances

maximum-hamming-distances

['Array', 'Bit Manipulation', 'Breadth-First Search']

false

43.273136

Easy

3,142

false

Check if Grid Satisfies Conditions

check-if-grid-satisfies-conditions

['Array', 'Matrix']

false

37.875827

Medium

3,143

false

Maximum Points Inside the Square

maximum-points-inside-the-square

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

false

38.720589

Medium

3,144

false

Minimum Substring Partition of Equal Character Frequency

minimum-substring-partition-of-equal-character-frequency

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

false

21.462412

Hard

3,145

false

Find Products of Elements of Big Array

find-products-of-elements-of-big-array

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

false

87.048816

Easy

3,146

false

Permutation Difference between Two Strings

permutation-difference-between-two-strings

['Hash Table', 'String']

false

40.864802

Medium

3,147

false

Taking Maximum Energy From the Mystic Dungeon

taking-maximum-energy-from-the-mystic-dungeon

['Array', 'Prefix Sum']

false

46.48086

Medium

3,148

false

Maximum Difference Score in a Grid

maximum-difference-score-in-a-grid

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

false

22.834679

Hard

3,149

false

Find the Minimum Cost Array Permutation

find-the-minimum-cost-array-permutation

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

false

86.759814

Easy

3,150

false

true

Invalid Tweets II

invalid-tweets-ii

['Database']

false

81.83247

Easy

3,151

false

Special Array I

special-array-i

['Array']

true

false

45.675347

Medium

3,152

false

Special Array II

special-array-ii

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

true

false

42.323341

Medium

3,153

false

Sum of Digit Differences of All Pairs

sum-of-digit-differences-of-all-pairs

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

false

35.812942

Hard

3,154

false

Find Number of Ways to Reach the K-th Stair

find-number-of-ways-to-reach-the-k-th-stair

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

false

40.177778

Medium

3,155

false

true

Maximum Number of Upgradable Servers

maximum-number-of-upgradable-servers

['Array', 'Math', 'Binary Search']

false

45.628903

Hard

3,156

false

true

Employee Task Duration and Concurrent Tasks

employee-task-duration-and-concurrent-tasks

['Database']

false

68.569712

Medium

3,157

false

true

Find the Level of Tree with Minimum Sum

find-the-level-of-tree-with-minimum-sum

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

false

79.510518

Easy

3,158

false

Find the XOR of Numbers Which Appear Twice

find-the-xor-of-numbers-which-appear-twice

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

false

72.313766

Medium

3,159

false

Find Occurrences of an Element in an Array

find-occurrences-of-an-element-in-an-array

['Array', 'Hash Table']

false

54.213314

Medium

3,160

false

Find the Number of Distinct Colors Among the Balls

find-the-number-of-distinct-colors-among-the-balls

['Array', 'Hash Table', 'Simulation']

true

false

16.062246

Hard

3,161

false

Block Placement Queries

block-placement-queries

['Array', 'Binary Search', 'Binary Indexed Tree', 'Segment Tree']

false

85.468205

Easy

3,162

false

Find the Number of Good Pairs I

find-the-number-of-good-pairs-i

['Array', 'Hash Table']

false

68.016874

Medium

3,163

false

String Compression III

string-compression-iii

['String']

true

false

25.938914

Medium

3,164

false

Find the Number of Good Pairs II

find-the-number-of-good-pairs-ii

['Array', 'Hash Table']

false

15.938947

Hard

3,165

false

Maximum Sum of Subsequence With Non-adjacent Elements

maximum-sum-of-subsequence-with-non-adjacent-elements

['Array', 'Divide and Conquer', 'Dynamic Programming', 'Segment Tree']

false

52.758402

Medium

3,166

false

true

Calculate Parking Fees and Duration

calculate-parking-fees-and-duration

['Database']

false

75.494723

Medium

3,167

false

true

Better Compression of String

better-compression-of-string

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

false

78.676518

Easy

3,168

false

Minimum Number of Chairs in a Waiting Room

minimum-number-of-chairs-in-a-waiting-room

['String', 'Simulation']

false

47.822243

Medium

3,169

false

Count Days Without Meetings

count-days-without-meetings

['Array', 'Sorting']

true

false

35.193636

Medium

3,170

false

Lexicographically Minimum String After Removing Stars

lexicographically-minimum-string-after-removing-stars

['Hash Table', 'String', 'Stack', 'Greedy', 'Heap (Priority Queue)']

false

29.453313

Hard

3,171

false

Find Subarray With Bitwise OR Closest to K

find-subarray-with-bitwise-or-closest-to-k

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

false

68.113899

Easy

3,172

false

true

Second Day Verification

second-day-verification

['Database']

false

95.267143

Easy

3,173

false

true

Bitwise OR of Adjacent Elements

bitwise-or-of-adjacent-elements

['Array', 'Bit Manipulation']

false

82.568833

Easy

3,174

false

Clear Digits

clear-digits

['String', 'Stack', 'Simulation']

true

false

39.290572

Medium

3,175

false

Find The First Player to win K Games in a Row

find-the-first-player-to-win-k-games-in-a-row

['Array', 'Simulation']

false

31.210591

Medium

3,176

false

Find the Maximum Length of a Good Subsequence I

find-the-maximum-length-of-a-good-subsequence-i

['Array', 'Hash Table', 'Dynamic Programming']

false

23.636907

Hard

3,177

false

Find the Maximum Length of a Good Subsequence II

find-the-maximum-length-of-a-good-subsequence-ii

['Array', 'Hash Table', 'Dynamic Programming']

false

61.474404

Easy

3,178

false

Find the Child Who Has the Ball After K Seconds

find-the-child-who-has-the-ball-after-k-seconds

['Math', 'Simulation']

false

53.574125

Medium

3,179

false

Find the N-th Value After K Seconds

find-the-n-th-value-after-k-seconds

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

false

29.722342

Medium

3,180

false

Maximum Total Reward Using Operations I

maximum-total-reward-using-operations-i

['Array', 'Dynamic Programming']

false

20.455909

Hard

3,181

false

Maximum Total Reward Using Operations II

maximum-total-reward-using-operations-ii

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

false

49.906191

Medium

3,182

false

true

Find Top Scoring Students

find-top-scoring-students

['Database']

false

52.454243

Medium

3,183

false

true

The Number of Ways to Make the Sum

the-number-of-ways-to-make-the-sum

['Array', 'Dynamic Programming']

false

77.390406

Easy

3,184

false

Count Pairs That Form a Complete Day I

count-pairs-that-form-a-complete-day-i

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

false

42.857282

Medium

3,185

false

Count Pairs That Form a Complete Day II

count-pairs-that-form-a-complete-day-ii

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

false

27.426315

Medium

3,186

false

Maximum Total Damage With Spell Casting

maximum-total-damage-with-spell-casting

['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Dynamic Programming', 'Sorting', 'Counting']

false

25.911129

Hard

3,187

false

Peaks in Array

peaks-in-array

['Array', 'Binary Indexed Tree', 'Segment Tree']

false

38.241206

Hard

3,188

false

true

Find Top Scoring Students II

find-top-scoring-students-ii

['Database']

false

76.071002

Medium

3,189

false

true

Minimum Moves to Get a Peaceful Board

minimum-moves-to-get-a-peaceful-board

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

true

false

88.652973

Easy

3,190

false

Find Minimum Operations to Make All Elements Divisible by Three

find-minimum-operations-to-make-all-elements-divisible-by-three

['Array', 'Math']

false

80.516658

Medium

3,191

false

Minimum Operations to Make Binary Array Elements Equal to One I

minimum-operations-to-make-binary-array-elements-equal-to-one-i

['Array', 'Bit Manipulation', 'Queue', 'Sliding Window', 'Prefix Sum']

true

false

63.754819

Medium

3,192

false

Minimum Operations to Make Binary Array Elements Equal to One II

minimum-operations-to-make-binary-array-elements-equal-to-one-ii

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

false

32.457667

Hard

3,193

false

Count the Number of Inversions

count-the-number-of-inversions

['Array', 'Dynamic Programming']

false

84.653568

Easy

3,194

false

Minimum Average of Smallest and Largest Elements

minimum-average-of-smallest-and-largest-elements

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

false

71.090885

Medium

3,195

false

Find the Minimum Area to Cover All Ones I

find-the-minimum-area-to-cover-all-ones-i

['Array', 'Matrix']

false

28.470669

Medium

3,196

false

Maximize Total Cost of Alternating Subarrays

maximize-total-cost-of-alternating-subarrays

['Array', 'Dynamic Programming']

false

35.681661

Hard

3,197

false

Find the Minimum Area to Cover All Ones II

find-the-minimum-area-to-cover-all-ones-ii

['Array', 'Matrix', 'Enumeration']

false

82.961672

Easy

3,198

false

true

Find Cities in Each State

find-cities-in-each-state

['Database']

false

82.993197

Easy

3,199

false

true

Count Triplets with Even XOR Set Bits I

count-triplets-with-even-xor-set-bits-i

['Array', 'Bit Manipulation']

false

43.02771

Easy

3,200

false

Maximum Height of a Triangle

maximum-height-of-a-triangle

['Array', 'Enumeration']

false