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
37.495026	Medium	3,201	false	false	Find the Maximum Length of Valid Subsequence I	find-the-maximum-length-of-valid-subsequence-i	['Array', 'Dynamic Programming']	false	false
39.322703	Medium	3,202	false	false	Find the Maximum Length of Valid Subsequence II	find-the-maximum-length-of-valid-subsequence-ii	['Array', 'Dynamic Programming']	false	false
57.567742	Hard	3,203	false	false	Find Minimum Diameter After Merging Two Trees	find-minimum-diameter-after-merging-two-trees	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph']	true	false
93.526786	Medium	3,204	false	true	Bitwise User Permissions Analysis	bitwise-user-permissions-analysis	['Database']	false	false
77.095682	Medium	3,205	false	true	Maximum Array Hopping Score I	maximum-array-hopping-score-i	['Array', 'Dynamic Programming', 'Stack', 'Greedy', 'Monotonic Stack']	false	false
67.359047	Easy	3,206	false	false	Alternating Groups I	alternating-groups-i	['Array', 'Sliding Window']	false	false
32.343944	Medium	3,207	false	false	Maximum Points After Enemy Battles	maximum-points-after-enemy-battles	['Array', 'Greedy']	false	false
59.826259	Medium	3,208	false	false	Alternating Groups II	alternating-groups-ii	['Array', 'Sliding Window']	true	false
33.563718	Hard	3,209	false	false	Number of Subarrays With AND Value of K	number-of-subarrays-with-and-value-of-k	['Array', 'Binary Search', 'Bit Manipulation', 'Segment Tree']	false	false
67.822952	Easy	3,210	false	false	Find the Encrypted String	find-the-encrypted-string	['String']	false	false
86.864595	Medium	3,211	false	false	Generate Binary Strings Without Adjacent Zeros	generate-binary-strings-without-adjacent-zeros	['String', 'Backtracking', 'Bit Manipulation']	false	false
50.33301	Medium	3,212	false	false	Count Submatrices With Equal Frequency of X and Y	count-submatrices-with-equal-frequency-of-x-and-y	['Array', 'Matrix', 'Prefix Sum']	false	false
19.243845	Hard	3,213	false	false	Construct String with Minimum Cost	construct-string-with-minimum-cost	['Array', 'String', 'Dynamic Programming', 'Suffix Array']	false	false
52.738892	Hard	3,214	false	true	Year on Year Growth Rate	year-on-year-growth-rate	['Database']	false	false
59.030418	Medium	3,215	false	true	Count Triplets with Even XOR Set Bits II	count-triplets-with-even-xor-set-bits-ii	['Array', 'Bit Manipulation']	false	false
53.465251	Easy	3,216	false	false	Lexicographically Smallest String After a Swap	lexicographically-smallest-string-after-a-swap	['String', 'Greedy']	false	false
67.946682	Medium	3,217	false	false	Delete Nodes From Linked List Present in Array	delete-nodes-from-linked-list-present-in-array	['Array', 'Hash Table', 'Linked List']	true	false
57.443243	Medium	3,218	false	false	Minimum Cost for Cutting Cake I	minimum-cost-for-cutting-cake-i	['Array', 'Dynamic Programming', 'Greedy', 'Sorting']	false	false
54.509513	Hard	3,219	false	false	Minimum Cost for Cutting Cake II	minimum-cost-for-cutting-cake-ii	['Array', 'Greedy', 'Sorting']	false	false
69.90704	Medium	3,220	false	false	Odd and Even Transactions	odd-and-even-transactions	['Database']	false	false
56.534091	Medium	3,221	false	true	Maximum Array Hopping Score II	maximum-array-hopping-score-ii	['Array', 'Stack', 'Greedy', 'Monotonic Stack']	false	false
52.359501	Easy	3,222	false	false	Find the Winning Player in Coin Game	find-the-winning-player-in-coin-game	['Math', 'Simulation', 'Game Theory']	false	false
74.924858	Medium	3,223	false	false	Minimum Length of String After Operations	minimum-length-of-string-after-operations	['Hash Table', 'String', 'Counting']	true	false
23.053957	Medium	3,224	false	false	Minimum Array Changes to Make Differences Equal	minimum-array-changes-to-make-differences-equal	['Array', 'Hash Table', 'Prefix Sum']	false	false
23.274818	Hard	3,225	false	false	Maximum Score From Grid Operations	maximum-score-from-grid-operations	['Array', 'Dynamic Programming', 'Matrix', 'Prefix Sum']	false	false
63.719516	Easy	3,226	false	false	Number of Bit Changes to Make Two Integers Equal	number-of-bit-changes-to-make-two-integers-equal	['Bit Manipulation']	false	false
61.848024	Medium	3,227	false	false	Vowels Game in a String	vowels-game-in-a-string	['Math', 'String', 'Brainteaser', 'Game Theory']	false	false
52.984824	Medium	3,228	false	false	Maximum Number of Operations to Move Ones to the End	maximum-number-of-operations-to-move-ones-to-the-end	['String', 'Greedy', 'Counting']	false	false
38.541942	Hard	3,229	false	false	Minimum Operations to Make Array Equal to Target	minimum-operations-to-make-array-equal-to-target	['Array', 'Dynamic Programming', 'Stack', 'Greedy', 'Monotonic Stack']	false	false
37.490237	Medium	3,230	false	true	Customer Purchasing Behavior Analysis	customer-purchasing-behavior-analysis	['Database']	false	false
42.455775	Hard	3,231	false	true	Minimum Number of Increasing Subsequence to Be Removed	minimum-number-of-increasing-subsequence-to-be-removed	['Array', 'Binary Search']	false	false
81.095255	Easy	3,232	false	false	Find if Digit Game Can Be Won	find-if-digit-game-can-be-won	['Array', 'Math']	false	false
26.792397	Medium	3,233	false	false	Find the Count of Numbers Which Are Not Special	find-the-count-of-numbers-which-are-not-special	['Array', 'Math', 'Number Theory']	false	false
16.612193	Medium	3,234	false	false	Count the Number of Substrings With Dominant Ones	count-the-number-of-substrings-with-dominant-ones	['String', 'Sliding Window', 'Enumeration']	false	false
26.580209	Hard	3,235	false	false	Check if the Rectangle Corner Is Reachable	check-if-the-rectangle-corner-is-reachable	['Array', 'Math', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Geometry']	false	false
71.79093	Hard	3,236	false	true	CEO Subordinate Hierarchy	ceo-subordinate-hierarchy	['Database']	false	false
47.989556	Medium	3,237	false	true	Alt and Tab Simulation	alt-and-tab-simulation	['Array', 'Hash Table', 'Simulation']	false	false
59.566842	Easy	3,238	false	false	Find the Number of Winning Players	find-the-number-of-winning-players	['Array', 'Hash Table', 'Counting']	false	false
74.152285	Medium	3,239	false	false	Minimum Number of Flips to Make Binary Grid Palindromic I	minimum-number-of-flips-to-make-binary-grid-palindromic-i	['Array', 'Two Pointers', 'Matrix']	false	false
23.859979	Medium	3,240	false	false	Minimum Number of Flips to Make Binary Grid Palindromic II	minimum-number-of-flips-to-make-binary-grid-palindromic-ii	['Array', 'Two Pointers', 'Matrix']	false	false
23.793354	Hard	3,241	false	false	Time Taken to Mark All Nodes	time-taken-to-mark-all-nodes	['Dynamic Programming', 'Tree', 'Depth-First Search', 'Graph']	false	false
82.604926	Easy	3,242	false	false	Design Neighbor Sum Service	design-neighbor-sum-service	['Array', 'Hash Table', 'Design', 'Matrix', 'Simulation']	false	false
62.079411	Medium	3,243	false	false	Shortest Distance After Road Addition Queries I	shortest-distance-after-road-addition-queries-i	['Array', 'Breadth-First Search', 'Graph']	true	false
25.028768	Hard	3,244	false	false	Shortest Distance After Road Addition Queries II	shortest-distance-after-road-addition-queries-ii	['Array', 'Greedy', 'Graph', 'Ordered Set']	false	false
14.471371	Hard	3,245	false	false	Alternating Groups III	alternating-groups-iii	['Array', 'Binary Indexed Tree']	false	false
82.021634	Easy	3,246	false	true	Premier League Table Ranking	premier-league-table-ranking	['Database']	false	false
47.120098	Medium	3,247	false	true	Number of Subsequences with Odd Sum	number-of-subsequences-with-odd-sum	['Array', 'Math', 'Dynamic Programming', 'Combinatorics']	false	false
81.414989	Easy	3,248	false	false	Snake in Matrix	snake-in-matrix	['Array', 'String', 'Simulation']	false	false
54.459703	Medium	3,249	false	false	Count the Number of Good Nodes	count-the-number-of-good-nodes	['Tree', 'Depth-First Search']	false	false
45.406238	Hard	3,250	false	false	Find the Count of Monotonic Pairs I	find-the-count-of-monotonic-pairs-i	['Array', 'Math', 'Dynamic Programming', 'Combinatorics', 'Prefix Sum']	false	false
22.626323	Hard	3,251	false	false	Find the Count of Monotonic Pairs II	find-the-count-of-monotonic-pairs-ii	['Array', 'Math', 'Dynamic Programming', 'Combinatorics', 'Prefix Sum']	false	false
60.16385	Medium	3,252	false	true	Premier League Table Ranking II	premier-league-table-ranking-ii	['Database']	false	false
58.333333	Medium	3,253	false	true	Construct String with Minimum Cost (Easy)	construct-string-with-minimum-cost-easy	[]	false	false
62.546707	Medium	3,254	false	false	Find the Power of K-Size Subarrays I	find-the-power-of-k-size-subarrays-i	['Array', 'Sliding Window']	true	false
29.002454	Medium	3,255	false	false	Find the Power of K-Size Subarrays II	find-the-power-of-k-size-subarrays-ii	['Array', 'Sliding Window']	false	false
14.943766	Hard	3,256	false	false	Maximum Value Sum by Placing Three Rooks I	maximum-value-sum-by-placing-three-rooks-i	['Array', 'Dynamic Programming', 'Matrix', 'Enumeration']	false	false
26.253927	Hard	3,257	false	false	Maximum Value Sum by Placing Three Rooks II	maximum-value-sum-by-placing-three-rooks-ii	['Array', 'Dynamic Programming', 'Matrix', 'Enumeration']	false	false
77.618193	Easy	3,258	false	false	Count Substrings That Satisfy K-Constraint I	count-substrings-that-satisfy-k-constraint-i	['String', 'Sliding Window']	false	false
49.164833	Medium	3,259	false	false	Maximum Energy Boost From Two Drinks	maximum-energy-boost-from-two-drinks	['Array', 'Dynamic Programming']	false	false
15.196882	Hard	3,260	false	false	Find the Largest Palindrome Divisible by K	find-the-largest-palindrome-divisible-by-k	['Math', 'String', 'Dynamic Programming', 'Greedy', 'Number Theory']	false	false
21.209578	Hard	3,261	false	false	Count Substrings That Satisfy K-Constraint II	count-substrings-that-satisfy-k-constraint-ii	['Array', 'String', 'Binary Search', 'Sliding Window', 'Prefix Sum']	false	false
61.990741	Medium	3,262	false	true	Find Overlapping Shifts	find-overlapping-shifts	['Database']	false	false
94.758796	Easy	3,263	false	true	Convert Doubly Linked List to Array I	convert-doubly-linked-list-to-array-i	['Array', 'Linked List', 'Doubly-Linked List']	false	false
87.171984	Easy	3,264	false	false	Final Array State After K Multiplication Operations I	final-array-state-after-k-multiplication-operations-i	['Array', 'Math', 'Heap (Priority Queue)', 'Simulation']	true	false
37.364648	Medium	3,265	false	false	Count Almost Equal Pairs I	count-almost-equal-pairs-i	['Array', 'Hash Table', 'Sorting', 'Counting', 'Enumeration']	false	false
11.630572	Hard	3,266	false	false	Final Array State After K Multiplication Operations II	final-array-state-after-k-multiplication-operations-ii	['Array', 'Heap (Priority Queue)', 'Simulation']	false	false
20.95127	Hard	3,267	false	false	Count Almost Equal Pairs II	count-almost-equal-pairs-ii	['Array', 'Hash Table', 'Sorting', 'Counting', 'Enumeration']	false	false
59.792166	Hard	3,268	false	true	Find Overlapping Shifts II	find-overlapping-shifts-ii	['Database']	false	false
63.728814	Hard	3,269	false	true	Constructing Two Increasing Arrays	constructing-two-increasing-arrays	['Array', 'Dynamic Programming']	false	false
75.933014	Easy	3,270	false	false	Find the Key of the Numbers	find-the-key-of-the-numbers	['Math']	false	false
82.919043	Medium	3,271	false	false	Hash Divided String	hash-divided-string	['String', 'Simulation']	false	false
30.931813	Hard	3,272	false	false	Find the Count of Good Integers	find-the-count-of-good-integers	['Hash Table', 'Math', 'Combinatorics', 'Enumeration']	true	false
37.627453	Hard	3,273	false	false	Minimum Amount of Damage Dealt to Bob	minimum-amount-of-damage-dealt-to-bob	['Array', 'Greedy', 'Sorting']	false	false
70.809547	Easy	3,274	false	false	Check if Two Chessboard Squares Have the Same Color	check-if-two-chessboard-squares-have-the-same-color	['Math', 'String']	false	false
47.886709	Medium	3,275	false	false	K-th Nearest Obstacle Queries	k-th-nearest-obstacle-queries	['Array', 'Heap (Priority Queue)']	false	false
14.269562	Hard	3,276	false	false	Select Cells in Grid With Maximum Score	select-cells-in-grid-with-maximum-score	['Array', 'Dynamic Programming', 'Bit Manipulation', 'Matrix', 'Bitmask']	false	false
41.697878	Hard	3,277	false	false	Maximum XOR Score Subarray Queries	maximum-xor-score-subarray-queries	['Array', 'Dynamic Programming']	false	false
43.797745	Medium	3,278	false	true	Find Candidates for Data Scientist Position II	find-candidates-for-data-scientist-position-ii	['Database']	false	false
54.754098	Hard	3,279	false	true	Maximum Total Area Occupied by Pistons	maximum-total-area-occupied-by-pistons	['Array', 'Hash Table', 'String', 'Simulation', 'Counting', 'Prefix Sum']	false	false
88.778284	Easy	3,280	false	false	Convert Date to Binary	convert-date-to-binary	['Math', 'String']	false	false
34.308085	Medium	3,281	false	false	Maximize Score of Numbers in Ranges	maximize-score-of-numbers-in-ranges	['Array', 'Binary Search', 'Greedy', 'Sorting']	false	false
32.450688	Medium	3,282	false	false	Reach End of Array With Max Score	reach-end-of-array-with-max-score	['Array', 'Greedy']	false	false
31.889478	Hard	3,283	false	false	Maximum Number of Moves to Kill All Pawns	maximum-number-of-moves-to-kill-all-pawns	['Array', 'Math', 'Bit Manipulation', 'Breadth-First Search', 'Game Theory', 'Bitmask']	false	false
41.284404	Medium	3,284	false	true	Sum of Consecutive Subarrays	sum-of-consecutive-subarrays	['Array', 'Two Pointers', 'Dynamic Programming']	false	false
85.835884	Easy	3,285	false	false	Find Indices of Stable Mountains	find-indices-of-stable-mountains	['Array']	false	false
29.881199	Medium	3,286	false	false	Find a Safe Walk Through a Grid	find-a-safe-walk-through-a-grid	['Array', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']	false	false
18.206195	Hard	3,287	false	false	Find the Maximum Sequence Value of Array	find-the-maximum-sequence-value-of-array	['Array', 'Dynamic Programming', 'Bit Manipulation']	false	false
16.775677	Hard	3,288	false	false	Length of the Longest Increasing Path	length-of-the-longest-increasing-path	['Array', 'Binary Search', 'Sorting']	false	false
88.17962	Easy	3,289	false	false	The Two Sneaky Numbers of Digitville	the-two-sneaky-numbers-of-digitville	['Array', 'Hash Table', 'Math']	false	false
40.896635	Medium	3,290	false	false	Maximum Multiplication Score	maximum-multiplication-score	['Array', 'Dynamic Programming']	false	false
19.723302	Medium	3,291	false	false	Minimum Number of Valid Strings to Form Target I	minimum-number-of-valid-strings-to-form-target-i	['Array', 'String', 'Binary Search', 'Dynamic Programming', 'Trie', 'Segment Tree', 'Rolling Hash', 'String Matching', 'Hash Function']	false	false
17.81332	Hard	3,292	false	false	Minimum Number of Valid Strings to Form Target II	minimum-number-of-valid-strings-to-form-target-ii	['Array', 'String', 'Binary Search', 'Dynamic Programming', 'Segment Tree', 'Rolling Hash', 'String Matching', 'Hash Function']	false	false
80.712009	Medium	3,293	false	true	Calculate Product Final Price	calculate-product-final-price	['Database']	false	false
81.476898	Medium	3,294	false	true	Convert Doubly Linked List to Array II	convert-doubly-linked-list-to-array-ii	['Array', 'Linked List', 'Doubly-Linked List']	false	false
47.353266	Medium	3,295	false	false	Report Spam Message	report-spam-message	['Array', 'Hash Table', 'String']	false	false
35.681943	Medium	3,296	false	false	Minimum Number of Seconds to Make Mountain Height Zero	minimum-number-of-seconds-to-make-mountain-height-zero	['Array', 'Math', 'Binary Search', 'Greedy', 'Heap (Priority Queue)']	false	false
41.14168	Medium	3,297	false	false	Count Substrings That Can Be Rearranged to Contain a String I	count-substrings-that-can-be-rearranged-to-contain-a-string-i	['Hash Table', 'String', 'Sliding Window']	false	false
55.297263	Hard	3,298	false	false	Count Substrings That Can Be Rearranged to Contain a String II	count-substrings-that-can-be-rearranged-to-contain-a-string-ii	['Hash Table', 'String', 'Sliding Window']	false	false
39.909808	Hard	3,299	false	true	Sum of Consecutive Subsequences	sum-of-consecutive-subsequences	['Array', 'Hash Table', 'Dynamic Programming']	false	false
83.290567	Easy	3,300	false	false	Minimum Element After Replacement With Digit Sum	minimum-element-after-replacement-with-digit-sum	['Array', 'Math']	false	false

37.495026

Medium

3,201

false

Find the Maximum Length of Valid Subsequence I

find-the-maximum-length-of-valid-subsequence-i

['Array', 'Dynamic Programming']

false

39.322703

Medium

3,202

false

Find the Maximum Length of Valid Subsequence II

find-the-maximum-length-of-valid-subsequence-ii

['Array', 'Dynamic Programming']

false

57.567742

Hard

3,203

false

Find Minimum Diameter After Merging Two Trees

find-minimum-diameter-after-merging-two-trees

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

true

false

93.526786

Medium

3,204

false

true

Bitwise User Permissions Analysis

bitwise-user-permissions-analysis

['Database']

false

77.095682

Medium

3,205

false

true

Maximum Array Hopping Score I

maximum-array-hopping-score-i

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

false

67.359047

Easy

3,206

false

Alternating Groups I

alternating-groups-i

['Array', 'Sliding Window']

false

32.343944

Medium

3,207

false

Maximum Points After Enemy Battles

maximum-points-after-enemy-battles

['Array', 'Greedy']

false

59.826259

Medium

3,208

false

Alternating Groups II

alternating-groups-ii

['Array', 'Sliding Window']

true

false

33.563718

Hard

3,209

false

Number of Subarrays With AND Value of K

number-of-subarrays-with-and-value-of-k

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

false

67.822952

Easy

3,210

false

Find the Encrypted String

find-the-encrypted-string

['String']

false

86.864595

Medium

3,211

false

Generate Binary Strings Without Adjacent Zeros

generate-binary-strings-without-adjacent-zeros

['String', 'Backtracking', 'Bit Manipulation']

false

50.33301

Medium

3,212

false

Count Submatrices With Equal Frequency of X and Y

count-submatrices-with-equal-frequency-of-x-and-y

['Array', 'Matrix', 'Prefix Sum']

false

19.243845

Hard

3,213

false

Construct String with Minimum Cost

construct-string-with-minimum-cost

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

false

52.738892

Hard

3,214

false

true

Year on Year Growth Rate

year-on-year-growth-rate

['Database']

false

59.030418

Medium

3,215

false

true

Count Triplets with Even XOR Set Bits II

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

['Array', 'Bit Manipulation']

false

53.465251

Easy

3,216

false

Lexicographically Smallest String After a Swap

lexicographically-smallest-string-after-a-swap

['String', 'Greedy']

false

67.946682

Medium

3,217

false

Delete Nodes From Linked List Present in Array

delete-nodes-from-linked-list-present-in-array

['Array', 'Hash Table', 'Linked List']

true

false

57.443243

Medium

3,218

false

Minimum Cost for Cutting Cake I

minimum-cost-for-cutting-cake-i

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

false

54.509513

Hard

3,219

false

Minimum Cost for Cutting Cake II

minimum-cost-for-cutting-cake-ii

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

false

69.90704

Medium

3,220

false

Odd and Even Transactions

odd-and-even-transactions

['Database']

false

56.534091

Medium

3,221

false

true

Maximum Array Hopping Score II

maximum-array-hopping-score-ii

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

false

52.359501

Easy

3,222

false

Find the Winning Player in Coin Game

find-the-winning-player-in-coin-game

['Math', 'Simulation', 'Game Theory']

false

74.924858

Medium

3,223

false

Minimum Length of String After Operations

minimum-length-of-string-after-operations

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

true

false

23.053957

Medium

3,224

false

Minimum Array Changes to Make Differences Equal

minimum-array-changes-to-make-differences-equal

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

false

23.274818

Hard

3,225

false

Maximum Score From Grid Operations

maximum-score-from-grid-operations

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

false

63.719516

Easy

3,226

false

Number of Bit Changes to Make Two Integers Equal

number-of-bit-changes-to-make-two-integers-equal

['Bit Manipulation']

false

61.848024

Medium

3,227

false

Vowels Game in a String

vowels-game-in-a-string

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

false

52.984824

Medium

3,228

false

Maximum Number of Operations to Move Ones to the End

maximum-number-of-operations-to-move-ones-to-the-end

['String', 'Greedy', 'Counting']

false

38.541942

Hard

3,229

false

Minimum Operations to Make Array Equal to Target

minimum-operations-to-make-array-equal-to-target

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

false

37.490237

Medium

3,230

false

true

Customer Purchasing Behavior Analysis

customer-purchasing-behavior-analysis

['Database']

false

42.455775

Hard

3,231

false

true

Minimum Number of Increasing Subsequence to Be Removed

minimum-number-of-increasing-subsequence-to-be-removed

['Array', 'Binary Search']

false

81.095255

Easy

3,232

false

Find if Digit Game Can Be Won

find-if-digit-game-can-be-won

['Array', 'Math']

false

26.792397

Medium

3,233

false

Find the Count of Numbers Which Are Not Special

find-the-count-of-numbers-which-are-not-special

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

false

16.612193

Medium

3,234

false

Count the Number of Substrings With Dominant Ones

count-the-number-of-substrings-with-dominant-ones

['String', 'Sliding Window', 'Enumeration']

false

26.580209

Hard

3,235

false

Check if the Rectangle Corner Is Reachable

check-if-the-rectangle-corner-is-reachable

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

false

71.79093

Hard

3,236

false

true

CEO Subordinate Hierarchy

ceo-subordinate-hierarchy

['Database']

false

47.989556

Medium

3,237

false

true

Alt and Tab Simulation

alt-and-tab-simulation

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

false

59.566842

Easy

3,238

false

Find the Number of Winning Players

find-the-number-of-winning-players

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

false

74.152285

Medium

3,239

false

Minimum Number of Flips to Make Binary Grid Palindromic I

minimum-number-of-flips-to-make-binary-grid-palindromic-i

['Array', 'Two Pointers', 'Matrix']

false

23.859979

Medium

3,240

false

Minimum Number of Flips to Make Binary Grid Palindromic II

minimum-number-of-flips-to-make-binary-grid-palindromic-ii

['Array', 'Two Pointers', 'Matrix']

false

23.793354

Hard

3,241

false

Time Taken to Mark All Nodes

time-taken-to-mark-all-nodes

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

false

82.604926

Easy

3,242

false

Design Neighbor Sum Service

design-neighbor-sum-service

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

false

62.079411

Medium

3,243

false

Shortest Distance After Road Addition Queries I

shortest-distance-after-road-addition-queries-i

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

true

false

25.028768

Hard

3,244

false

Shortest Distance After Road Addition Queries II

shortest-distance-after-road-addition-queries-ii

['Array', 'Greedy', 'Graph', 'Ordered Set']

false

14.471371

Hard

3,245

false

Alternating Groups III

alternating-groups-iii

['Array', 'Binary Indexed Tree']

false

82.021634

Easy

3,246

false

true

Premier League Table Ranking

premier-league-table-ranking

['Database']

false

47.120098

Medium

3,247

false

true

Number of Subsequences with Odd Sum

number-of-subsequences-with-odd-sum

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

false

81.414989

Easy

3,248

false

Snake in Matrix

snake-in-matrix

['Array', 'String', 'Simulation']

false

54.459703

Medium

3,249

false

Count the Number of Good Nodes

count-the-number-of-good-nodes

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

false

45.406238

Hard

3,250

false

Find the Count of Monotonic Pairs I

find-the-count-of-monotonic-pairs-i

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

false

22.626323

Hard

3,251

false

Find the Count of Monotonic Pairs II

find-the-count-of-monotonic-pairs-ii

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

false

60.16385

Medium

3,252

false

true

Premier League Table Ranking II

premier-league-table-ranking-ii

['Database']

false

58.333333

Medium

3,253

false

true

Construct String with Minimum Cost (Easy)

construct-string-with-minimum-cost-easy

[]

false

62.546707

Medium

3,254

false

Find the Power of K-Size Subarrays I

find-the-power-of-k-size-subarrays-i

['Array', 'Sliding Window']

true

false

29.002454

Medium

3,255

false

Find the Power of K-Size Subarrays II

find-the-power-of-k-size-subarrays-ii

['Array', 'Sliding Window']

false

14.943766

Hard

3,256

false

Maximum Value Sum by Placing Three Rooks I

maximum-value-sum-by-placing-three-rooks-i

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

false

26.253927

Hard

3,257

false

Maximum Value Sum by Placing Three Rooks II

maximum-value-sum-by-placing-three-rooks-ii

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

false

77.618193

Easy

3,258

false

Count Substrings That Satisfy K-Constraint I

count-substrings-that-satisfy-k-constraint-i

['String', 'Sliding Window']

false

49.164833

Medium

3,259

false

Maximum Energy Boost From Two Drinks

maximum-energy-boost-from-two-drinks

['Array', 'Dynamic Programming']

false

15.196882

Hard

3,260

false

Find the Largest Palindrome Divisible by K

find-the-largest-palindrome-divisible-by-k

['Math', 'String', 'Dynamic Programming', 'Greedy', 'Number Theory']

false

21.209578

Hard

3,261

false

Count Substrings That Satisfy K-Constraint II

count-substrings-that-satisfy-k-constraint-ii

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

false

61.990741

Medium

3,262

false

true

Find Overlapping Shifts

find-overlapping-shifts

['Database']

false

94.758796

Easy

3,263

false

true

Convert Doubly Linked List to Array I

convert-doubly-linked-list-to-array-i

['Array', 'Linked List', 'Doubly-Linked List']

false

87.171984

Easy

3,264

false

Final Array State After K Multiplication Operations I

final-array-state-after-k-multiplication-operations-i

['Array', 'Math', 'Heap (Priority Queue)', 'Simulation']

true

false

37.364648

Medium

3,265

false

Count Almost Equal Pairs I

count-almost-equal-pairs-i

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

false

11.630572

Hard

3,266

false

Final Array State After K Multiplication Operations II

final-array-state-after-k-multiplication-operations-ii

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

false

20.95127

Hard

3,267

false

Count Almost Equal Pairs II

count-almost-equal-pairs-ii

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

false

59.792166

Hard

3,268

false

true

Find Overlapping Shifts II

find-overlapping-shifts-ii

['Database']

false

63.728814

Hard

3,269

false

true

Constructing Two Increasing Arrays

constructing-two-increasing-arrays

['Array', 'Dynamic Programming']

false

75.933014

Easy

3,270

false

Find the Key of the Numbers

find-the-key-of-the-numbers

['Math']

false

82.919043

Medium

3,271

false

Hash Divided String

hash-divided-string

['String', 'Simulation']

false

30.931813

Hard

3,272

false

Find the Count of Good Integers

find-the-count-of-good-integers

['Hash Table', 'Math', 'Combinatorics', 'Enumeration']

true

false

37.627453

Hard

3,273

false

Minimum Amount of Damage Dealt to Bob

minimum-amount-of-damage-dealt-to-bob

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

false

70.809547

Easy

3,274

false

Check if Two Chessboard Squares Have the Same Color

check-if-two-chessboard-squares-have-the-same-color

['Math', 'String']

false

47.886709

Medium

3,275

false

K-th Nearest Obstacle Queries

k-th-nearest-obstacle-queries

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

false

14.269562

Hard

3,276

false

Select Cells in Grid With Maximum Score

select-cells-in-grid-with-maximum-score

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

false

41.697878

Hard

3,277

false

Maximum XOR Score Subarray Queries

maximum-xor-score-subarray-queries

['Array', 'Dynamic Programming']

false

43.797745

Medium

3,278

false

true

Find Candidates for Data Scientist Position II

find-candidates-for-data-scientist-position-ii

['Database']

false

54.754098

Hard

3,279

false

true

Maximum Total Area Occupied by Pistons

maximum-total-area-occupied-by-pistons

['Array', 'Hash Table', 'String', 'Simulation', 'Counting', 'Prefix Sum']

false

88.778284

Easy

3,280

false

Convert Date to Binary

convert-date-to-binary

['Math', 'String']

false

34.308085

Medium

3,281

false

Maximize Score of Numbers in Ranges

maximize-score-of-numbers-in-ranges

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

false

32.450688

Medium

3,282

false

Reach End of Array With Max Score

reach-end-of-array-with-max-score

['Array', 'Greedy']

false

31.889478

Hard

3,283

false

Maximum Number of Moves to Kill All Pawns

maximum-number-of-moves-to-kill-all-pawns

['Array', 'Math', 'Bit Manipulation', 'Breadth-First Search', 'Game Theory', 'Bitmask']

false

41.284404

Medium

3,284

false

true

Sum of Consecutive Subarrays

sum-of-consecutive-subarrays

['Array', 'Two Pointers', 'Dynamic Programming']

false

85.835884

Easy

3,285

false

Find Indices of Stable Mountains

find-indices-of-stable-mountains

['Array']

false

29.881199

Medium

3,286

false

Find a Safe Walk Through a Grid

find-a-safe-walk-through-a-grid

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

false

18.206195

Hard

3,287

false

Find the Maximum Sequence Value of Array

find-the-maximum-sequence-value-of-array

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

false

16.775677

Hard

3,288

false

Length of the Longest Increasing Path

length-of-the-longest-increasing-path

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

false

88.17962

Easy

3,289

false

The Two Sneaky Numbers of Digitville

the-two-sneaky-numbers-of-digitville

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

false

40.896635

Medium

3,290

false

Maximum Multiplication Score

maximum-multiplication-score

['Array', 'Dynamic Programming']

false

19.723302

Medium

3,291

false

Minimum Number of Valid Strings to Form Target I

minimum-number-of-valid-strings-to-form-target-i

['Array', 'String', 'Binary Search', 'Dynamic Programming', 'Trie', 'Segment Tree', 'Rolling Hash', 'String Matching', 'Hash Function']

false

17.81332

Hard

3,292

false

Minimum Number of Valid Strings to Form Target II

minimum-number-of-valid-strings-to-form-target-ii

['Array', 'String', 'Binary Search', 'Dynamic Programming', 'Segment Tree', 'Rolling Hash', 'String Matching', 'Hash Function']

false

80.712009

Medium

3,293

false

true

Calculate Product Final Price

calculate-product-final-price

['Database']

false

81.476898

Medium

3,294

false

true

Convert Doubly Linked List to Array II

convert-doubly-linked-list-to-array-ii

['Array', 'Linked List', 'Doubly-Linked List']

false

47.353266

Medium

3,295

false

Report Spam Message

report-spam-message

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

false

35.681943

Medium

3,296

false

Minimum Number of Seconds to Make Mountain Height Zero

minimum-number-of-seconds-to-make-mountain-height-zero

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

false

41.14168

Medium

3,297

false

Count Substrings That Can Be Rearranged to Contain a String I

count-substrings-that-can-be-rearranged-to-contain-a-string-i

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

false

55.297263

Hard

3,298

false

Count Substrings That Can Be Rearranged to Contain a String II

count-substrings-that-can-be-rearranged-to-contain-a-string-ii

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

false

39.909808

Hard

3,299

false

true

Sum of Consecutive Subsequences

sum-of-consecutive-subsequences

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

false

83.290567

Easy

3,300

false

Minimum Element After Replacement With Digit Sum

minimum-element-after-replacement-with-digit-sum

['Array', 'Math']

false