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
36.09344	Medium	3,301	false	false	Maximize the Total Height of Unique Towers	maximize-the-total-height-of-unique-towers	['Array', 'Greedy', 'Sorting']	false	false
19.990319	Medium	3,302	false	false	Find the Lexicographically Smallest Valid Sequence	find-the-lexicographically-smallest-valid-sequence	['Two Pointers', 'String', 'Dynamic Programming', 'Greedy']	false	false
13.469653	Hard	3,303	false	false	Find the Occurrence of First Almost Equal Substring	find-the-occurrence-of-first-almost-equal-substring	['String', 'String Matching']	false	false
72.726911	Easy	3,304	false	false	Find the K-th Character in String Game I	find-the-k-th-character-in-string-game-i	['Math', 'Bit Manipulation', 'Recursion', 'Simulation']	false	false
40.963703	Medium	3,305	false	false	Count of Substrings Containing Every Vowel and K Consonants I	count-of-substrings-containing-every-vowel-and-k-consonants-i	['Hash Table', 'String', 'Sliding Window']	false	false
40.729646	Medium	3,306	false	false	Count of Substrings Containing Every Vowel and K Consonants II	count-of-substrings-containing-every-vowel-and-k-consonants-ii	['Hash Table', 'String', 'Sliding Window']	true	false
28.910287	Hard	3,307	false	false	Find the K-th Character in String Game II	find-the-k-th-character-in-string-game-ii	['Math', 'Bit Manipulation', 'Recursion']	false	false
50.202429	Medium	3,308	false	true	Find Top Performing Driver	find-top-performing-driver	['Database']	false	false
64.921255	Medium	3,309	false	false	Maximum Possible Number by Binary Concatenation	maximum-possible-number-by-binary-concatenation	['Array', 'Bit Manipulation', 'Enumeration']	false	false
49.018658	Medium	3,310	false	false	Remove Methods From Project	remove-methods-from-project	['Depth-First Search', 'Breadth-First Search', 'Graph']	false	false
28.920919	Hard	3,311	false	false	Construct 2D Grid Matching Graph Layout	construct-2d-grid-matching-graph-layout	['Array', 'Hash Table', 'Graph', 'Matrix']	false	false
19.932976	Hard	3,312	false	false	Sorted GCD Pair Queries	sorted-gcd-pair-queries	['Array', 'Hash Table', 'Math', 'Binary Search', 'Combinatorics', 'Counting', 'Number Theory', 'Prefix Sum']	false	false
51.03211	Hard	3,313	false	true	Find the Last Marked Nodes in Tree	find-the-last-marked-nodes-in-tree	['Tree', 'Depth-First Search']	false	false
73.723907	Easy	3,314	false	false	Construct the Minimum Bitwise Array I	construct-the-minimum-bitwise-array-i	['Array', 'Bit Manipulation']	false	false
34.514255	Medium	3,315	false	false	Construct the Minimum Bitwise Array II	construct-the-minimum-bitwise-array-ii	['Array', 'Bit Manipulation']	false	false
38.683647	Medium	3,316	false	false	Find Maximum Removals From Source String	find-maximum-removals-from-source-string	['Array', 'Hash Table', 'Two Pointers', 'String', 'Dynamic Programming']	false	false
32.652317	Hard	3,317	false	false	Find the Number of Possible Ways for an Event	find-the-number-of-possible-ways-for-an-event	['Math', 'Dynamic Programming', 'Combinatorics']	false	false
63.220325	Easy	3,318	false	false	Find X-Sum of All K-Long Subarrays I	find-x-sum-of-all-k-long-subarrays-i	['Array', 'Hash Table', 'Sliding Window', 'Heap (Priority Queue)']	false	false
60.744391	Medium	3,319	false	false	K-th Largest Perfect Subtree Size in Binary Tree	k-th-largest-perfect-subtree-size-in-binary-tree	['Tree', 'Depth-First Search', 'Sorting', 'Binary Tree']	false	false
31.54832	Hard	3,320	false	false	Count The Number of Winning Sequences	count-the-number-of-winning-sequences	['String', 'Dynamic Programming']	false	false
15.532063	Hard	3,321	false	false	Find X-Sum of All K-Long Subarrays II	find-x-sum-of-all-k-long-subarrays-ii	['Array', 'Hash Table', 'Sliding Window', 'Heap (Priority Queue)']	false	false
72.4882	Medium	3,322	false	true	Premier League Table Ranking III	premier-league-table-ranking-iii	['Database']	false	false
50.947731	Medium	3,323	false	true	Minimize Connected Groups by Inserting Interval	minimize-connected-groups-by-inserting-interval	['Array', 'Binary Search', 'Sliding Window', 'Sorting']	false	false
79.010184	Medium	3,324	false	false	Find the Sequence of Strings Appeared on the Screen	find-the-sequence-of-strings-appeared-on-the-screen	['String', 'Simulation']	false	false
54.256495	Medium	3,325	false	false	Count Substrings With K-Frequency Characters I	count-substrings-with-k-frequency-characters-i	['Hash Table', 'String', 'Sliding Window']	false	false
28.374762	Medium	3,326	false	false	Minimum Division Operations to Make Array Non Decreasing	minimum-division-operations-to-make-array-non-decreasing	['Array', 'Math', 'Greedy', 'Number Theory']	false	false
20.643495	Hard	3,327	false	false	Check if DFS Strings Are Palindromes	check-if-dfs-strings-are-palindromes	['Array', 'Hash Table', 'String', 'Tree', 'Depth-First Search', 'Hash Function']	false	false
71.520619	Medium	3,328	false	true	Find Cities in Each State II	find-cities-in-each-state-ii	['Database']	false	false
70.406905	Hard	3,329	false	true	Count Substrings With K-Frequency Characters II	count-substrings-with-k-frequency-characters-ii	['Hash Table', 'String', 'Sliding Window']	false	false
56.36051	Easy	3,330	false	false	Find the Original Typed String I	find-the-original-typed-string-i	['String']	false	false
54.485536	Medium	3,331	false	false	Find Subtree Sizes After Changes	find-subtree-sizes-after-changes	['Array', 'Hash Table', 'String', 'Tree', 'Depth-First Search']	false	false
49.575262	Medium	3,332	false	false	Maximum Points Tourist Can Earn	maximum-points-tourist-can-earn	['Array', 'Dynamic Programming', 'Matrix']	false	false
16.233366	Hard	3,333	false	false	Find the Original Typed String II	find-the-original-typed-string-ii	['String', 'Dynamic Programming', 'Prefix Sum']	false	false
40.172722	Medium	3,334	false	false	Find the Maximum Factor Score of Array	find-the-maximum-factor-score-of-array	['Array', 'Math', 'Number Theory']	false	false
26.347227	Medium	3,335	false	false	Total Characters in String After Transformations I	total-characters-in-string-after-transformations-i	['Hash Table', 'Math', 'String', 'Dynamic Programming', 'Counting']	false	false
37.78229	Hard	3,336	false	false	Find the Number of Subsequences With Equal GCD	find-the-number-of-subsequences-with-equal-gcd	['Array', 'Math', 'Dynamic Programming', 'Number Theory']	false	false
32.642666	Hard	3,337	false	false	Total Characters in String After Transformations II	total-characters-in-string-after-transformations-ii	['Hash Table', 'Math', 'String', 'Dynamic Programming', 'Counting']	false	false
89.583333	Medium	3,338	false	true	Second Highest Salary II	second-highest-salary-ii	['Database']	false	false
56.72043	Medium	3,339	false	true	Find the Number of K-Even Arrays	find-the-number-of-k-even-arrays	['Dynamic Programming']	false	false
84.03494	Easy	3,340	false	false	Check Balanced String	check-balanced-string	['String']	false	false
35.642862	Medium	3,341	false	false	Find Minimum Time to Reach Last Room I	find-minimum-time-to-reach-last-room-i	['Array', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']	false	false
49.868173	Medium	3,342	false	false	Find Minimum Time to Reach Last Room II	find-minimum-time-to-reach-last-room-ii	['Array', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']	false	false
15.737731	Hard	3,343	false	false	Count Number of Balanced Permutations	count-number-of-balanced-permutations	['Math', 'String', 'Dynamic Programming', 'Combinatorics']	false	false
52.281134	Medium	3,344	false	true	Maximum Sized Array	maximum-sized-array	['Binary Search', 'Bit Manipulation']	false	false
63.826533	Easy	3,345	false	false	Smallest Divisible Digit Product I	smallest-divisible-digit-product-i	['Math', 'Enumeration']	false	false
20.605724	Medium	3,346	false	false	Maximum Frequency of an Element After Performing Operations I	maximum-frequency-of-an-element-after-performing-operations-i	['Array', 'Binary Search', 'Sliding Window', 'Sorting', 'Prefix Sum']	false	false
37.229342	Hard	3,347	false	false	Maximum Frequency of an Element After Performing Operations II	maximum-frequency-of-an-element-after-performing-operations-ii	['Array', 'Binary Search', 'Sliding Window', 'Sorting', 'Prefix Sum']	false	false
9.99207	Hard	3,348	false	false	Smallest Divisible Digit Product II	smallest-divisible-digit-product-ii	['Math', 'String', 'Backtracking', 'Greedy', 'Number Theory']	false	false
39.726774	Easy	3,349	false	false	Adjacent Increasing Subarrays Detection I	adjacent-increasing-subarrays-detection-i	['Array']	false	false
40.699943	Medium	3,350	false	false	Adjacent Increasing Subarrays Detection II	adjacent-increasing-subarrays-detection-ii	['Array', 'Binary Search']	false	false
29.391101	Hard	3,351	false	false	Sum of Good Subsequences	sum-of-good-subsequences	['Array', 'Hash Table', 'Dynamic Programming']	false	false
28.16416	Hard	3,352	false	false	Count K-Reducible Numbers Less Than N	count-k-reducible-numbers-less-than-n	['Math', 'String', 'Dynamic Programming', 'Combinatorics']	false	false
63.45733	Easy	3,353	false	true	Minimum Total Operations	minimum-total-operations	['Array']	false	false
55.303331	Easy	3,354	false	false	Make Array Elements Equal to Zero	make-array-elements-equal-to-zero	['Array', 'Simulation', 'Prefix Sum']	false	false
45.71284	Medium	3,355	false	false	Zero Array Transformation I	zero-array-transformation-i	['Array', 'Prefix Sum']	false	false
43.8164	Medium	3,356	false	false	Zero Array Transformation II	zero-array-transformation-ii	['Array', 'Binary Search', 'Prefix Sum']	true	false
15.121214	Hard	3,357	false	false	Minimize the Maximum Adjacent Element Difference	minimize-the-maximum-adjacent-element-difference	['Array', 'Binary Search', 'Greedy']	false	false
92.832255	Easy	3,358	false	true	Books with NULL Ratings	books-with-null-ratings	['Database']	false	false
50.305499	Hard	3,359	false	true	Find Sorted Submatrices With Maximum Element at Most K	find-sorted-submatrices-with-maximum-element-at-most-k	['Array', 'Stack', 'Matrix', 'Monotonic Stack']	false	false
41.382036	Easy	3,360	false	false	Stone Removal Game	stone-removal-game	['Math', 'Simulation']	false	false
52.43502	Medium	3,361	false	false	Shift Distance Between Two Strings	shift-distance-between-two-strings	['Array', 'String', 'Prefix Sum']	false	false
25.868948	Medium	3,362	false	false	Zero Array Transformation III	zero-array-transformation-iii	['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Prefix Sum']	false	false
39.219074	Hard	3,363	false	false	Find the Maximum Number of Fruits Collected	find-the-maximum-number-of-fruits-collected	['Array', 'Dynamic Programming', 'Matrix']	false	false
45.12178	Easy	3,364	false	false	Minimum Positive Sum Subarray	minimum-positive-sum-subarray	['Array', 'Sliding Window', 'Prefix Sum']	false	false
52.102431	Medium	3,365	false	false	Rearrange K Substrings to Form Target String	rearrange-k-substrings-to-form-target-string	['Hash Table', 'String', 'Sorting']	false	false
29.209443	Medium	3,366	false	false	Minimum Array Sum	minimum-array-sum	['Array', 'Dynamic Programming']	false	false
28.527821	Hard	3,367	false	false	Maximize Sum of Weights after Edge Removals	maximize-sum-of-weights-after-edge-removals	['Dynamic Programming', 'Tree', 'Depth-First Search']	false	false
87.535411	Hard	3,368	false	true	First Letter Capitalization	first-letter-capitalization	['Database']	false	false
33.984648	Hard	3,369	false	true	Design an Array Statistics Tracker	design-an-array-statistics-tracker	['Hash Table', 'Binary Search', 'Design', 'Queue', 'Heap (Priority Queue)', 'Data Stream', 'Ordered Set']	false	false
75.462265	Easy	3,370	false	false	Smallest Number With All Set Bits	smallest-number-with-all-set-bits	['Math', 'Bit Manipulation']	false	false
34.694076	Medium	3,371	false	false	Identify the Largest Outlier in an Array	identify-the-largest-outlier-in-an-array	['Array', 'Hash Table', 'Counting', 'Enumeration']	false	false
47.904617	Medium	3,372	false	false	Maximize the Number of Target Nodes After Connecting Trees I	maximize-the-number-of-target-nodes-after-connecting-trees-i	['Tree', 'Depth-First Search', 'Breadth-First Search']	false	false
53.752104	Hard	3,373	false	false	Maximize the Number of Target Nodes After Connecting Trees II	maximize-the-number-of-target-nodes-after-connecting-trees-ii	['Tree', 'Depth-First Search', 'Breadth-First Search']	false	false
77.191107	Hard	3,374	false	false	First Letter Capitalization II	first-letter-capitalization-ii	['Database']	false	false
73.138786	Easy	3,375	false	false	Minimum Operations to Make Array Values Equal to K	minimum-operations-to-make-array-values-equal-to-k	['Array', 'Hash Table']	true	false
30.35613	Medium	3,376	false	false	Minimum Time to Break Locks I	minimum-time-to-break-locks-i	['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Depth-First Search', 'Bitmask']	false	false
31.100457	Medium	3,377	false	false	Digit Operations to Make Two Integers Equal	digit-operations-to-make-two-integers-equal	['Math', 'Graph', 'Heap (Priority Queue)', 'Number Theory', 'Shortest Path']	false	false
27.667771	Hard	3,378	false	false	Count Connected Components in LCM Graph	count-connected-components-in-lcm-graph	['Array', 'Hash Table', 'Math', 'Union Find', 'Number Theory']	false	false
56.225419	Easy	3,379	false	false	Transformed Array	transformed-array	['Array', 'Simulation']	false	false
50.963187	Medium	3,380	false	false	Maximum Area Rectangle With Point Constraints I	maximum-area-rectangle-with-point-constraints-i	['Array', 'Math', 'Binary Indexed Tree', 'Segment Tree', 'Geometry', 'Sorting', 'Enumeration']	false	false
27.845114	Medium	3,381	false	false	Maximum Subarray Sum With Length Divisible by K	maximum-subarray-sum-with-length-divisible-by-k	['Array', 'Hash Table', 'Prefix Sum']	false	false
20.103243	Hard	3,382	false	false	Maximum Area Rectangle With Point Constraints II	maximum-area-rectangle-with-point-constraints-ii	['Array', 'Math', 'Binary Indexed Tree', 'Segment Tree', 'Geometry', 'Sorting']	false	false
45.903361	Hard	3,383	false	true	Minimum Runes to Add to Cast Spell	minimum-runes-to-add-to-cast-spell	['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph', 'Topological Sort']	false	false
77.508269	Hard	3,384	false	true	Team Dominance by Pass Success	team-dominance-by-pass-success	['Database']	false	false
46.420824	Hard	3,385	false	true	Minimum Time to Break Locks II	minimum-time-to-break-locks-ii	['Array', 'Depth-First Search', 'Graph']	false	false
40.412732	Easy	3,386	false	false	Button with Longest Push Time	button-with-longest-push-time	['Array']	false	false
59.841684	Medium	3,387	false	false	Maximize Amount After Two Days of Conversions	maximize-amount-after-two-days-of-conversions	['Array', 'String', 'Depth-First Search', 'Breadth-First Search', 'Graph']	false	false
15.632492	Medium	3,388	false	false	Count Beautiful Splits in an Array	count-beautiful-splits-in-an-array	['Array', 'Dynamic Programming']	false	false
24.153578	Hard	3,389	false	false	Minimum Operations to Make Character Frequencies Equal	minimum-operations-to-make-character-frequencies-equal	['Hash Table', 'String', 'Dynamic Programming', 'Counting', 'Enumeration']	false	false
42.964554	Hard	3,390	false	true	Longest Team Pass Streak	longest-team-pass-streak	['Database']	false	false
68	Medium	3,391	false	true	Design a 3D Binary Matrix with Efficient Layer Tracking	design-a-3d-binary-matrix-with-efficient-layer-tracking	['Array', 'Hash Table', 'Design', 'Heap (Priority Queue)', 'Matrix', 'Ordered Set']	false	false
51.643217	Easy	3,392	false	false	Count Subarrays of Length Three With a Condition	count-subarrays-of-length-three-with-a-condition	['Array']	false	false
39.73299	Medium	3,393	false	false	Count Paths With the Given XOR Value	count-paths-with-the-given-xor-value	['Array', 'Dynamic Programming', 'Bit Manipulation', 'Matrix']	false	false
69.140726	Medium	3,394	false	false	Check if Grid can be Cut into Sections	check-if-grid-can-be-cut-into-sections	['Array', 'Sorting']	true	false
16.565675	Hard	3,395	false	false	Subsequences with a Unique Middle Mode I	subsequences-with-a-unique-middle-mode-i	['Array', 'Hash Table', 'Math', 'Combinatorics']	false	false
71.561699	Easy	3,396	false	false	Minimum Number of Operations to Make Elements in Array Distinct	minimum-number-of-operations-to-make-elements-in-array-distinct	['Array', 'Hash Table']	true	false
31.17351	Medium	3,397	false	false	Maximum Number of Distinct Elements After Operations	maximum-number-of-distinct-elements-after-operations	['Array', 'Greedy', 'Sorting']	false	false
18.88691	Hard	3,398	false	false	Smallest Substring With Identical Characters I	smallest-substring-with-identical-characters-i	['Array', 'Binary Search', 'Enumeration']	false	false
40.565763	Hard	3,399	false	false	Smallest Substring With Identical Characters II	smallest-substring-with-identical-characters-ii	['String', 'Binary Search']	false	false
85.467128	Medium	3,400	false	true	Maximum Number of Matching Indices After Right Shifts	maximum-number-of-matching-indices-after-right-shifts	['Array', 'Two Pointers', 'Simulation']	false	false

36.09344

Medium

3,301

false

Maximize the Total Height of Unique Towers

maximize-the-total-height-of-unique-towers

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

false

19.990319

Medium

3,302

false

Find the Lexicographically Smallest Valid Sequence

find-the-lexicographically-smallest-valid-sequence

['Two Pointers', 'String', 'Dynamic Programming', 'Greedy']

false

13.469653

Hard

3,303

false

Find the Occurrence of First Almost Equal Substring

find-the-occurrence-of-first-almost-equal-substring

['String', 'String Matching']

false

72.726911

Easy

3,304

false

Find the K-th Character in String Game I

find-the-k-th-character-in-string-game-i

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

false

40.963703

Medium

3,305

false

Count of Substrings Containing Every Vowel and K Consonants I

count-of-substrings-containing-every-vowel-and-k-consonants-i

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

false

40.729646

Medium

3,306

false

Count of Substrings Containing Every Vowel and K Consonants II

count-of-substrings-containing-every-vowel-and-k-consonants-ii

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

true

false

28.910287

Hard

3,307

false

Find the K-th Character in String Game II

find-the-k-th-character-in-string-game-ii

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

false

50.202429

Medium

3,308

false

true

Find Top Performing Driver

find-top-performing-driver

['Database']

false

64.921255

Medium

3,309

false

Maximum Possible Number by Binary Concatenation

maximum-possible-number-by-binary-concatenation

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

false

49.018658

Medium

3,310

false

Remove Methods From Project

remove-methods-from-project

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

false

28.920919

Hard

3,311

false

Construct 2D Grid Matching Graph Layout

construct-2d-grid-matching-graph-layout

['Array', 'Hash Table', 'Graph', 'Matrix']

false

19.932976

Hard

3,312

false

Sorted GCD Pair Queries

sorted-gcd-pair-queries

['Array', 'Hash Table', 'Math', 'Binary Search', 'Combinatorics', 'Counting', 'Number Theory', 'Prefix Sum']

false

51.03211

Hard

3,313

false

true

Find the Last Marked Nodes in Tree

find-the-last-marked-nodes-in-tree

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

false

73.723907

Easy

3,314

false

Construct the Minimum Bitwise Array I

construct-the-minimum-bitwise-array-i

['Array', 'Bit Manipulation']

false

34.514255

Medium

3,315

false

Construct the Minimum Bitwise Array II

construct-the-minimum-bitwise-array-ii

['Array', 'Bit Manipulation']

false

38.683647

Medium

3,316

false

Find Maximum Removals From Source String

find-maximum-removals-from-source-string

['Array', 'Hash Table', 'Two Pointers', 'String', 'Dynamic Programming']

false

32.652317

Hard

3,317

false

Find the Number of Possible Ways for an Event

find-the-number-of-possible-ways-for-an-event

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

false

63.220325

Easy

3,318

false

Find X-Sum of All K-Long Subarrays I

find-x-sum-of-all-k-long-subarrays-i

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

false

60.744391

Medium

3,319

false

K-th Largest Perfect Subtree Size in Binary Tree

k-th-largest-perfect-subtree-size-in-binary-tree

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

false

31.54832

Hard

3,320

false

Count The Number of Winning Sequences

count-the-number-of-winning-sequences

['String', 'Dynamic Programming']

false

15.532063

Hard

3,321

false

Find X-Sum of All K-Long Subarrays II

find-x-sum-of-all-k-long-subarrays-ii

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

false

72.4882

Medium

3,322

false

true

Premier League Table Ranking III

premier-league-table-ranking-iii

['Database']

false

50.947731

Medium

3,323

false

true

Minimize Connected Groups by Inserting Interval

minimize-connected-groups-by-inserting-interval

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

false

79.010184

Medium

3,324

false

Find the Sequence of Strings Appeared on the Screen

find-the-sequence-of-strings-appeared-on-the-screen

['String', 'Simulation']

false

54.256495

Medium

3,325

false

Count Substrings With K-Frequency Characters I

count-substrings-with-k-frequency-characters-i

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

false

28.374762

Medium

3,326

false

Minimum Division Operations to Make Array Non Decreasing

minimum-division-operations-to-make-array-non-decreasing

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

false

20.643495

Hard

3,327

false

Check if DFS Strings Are Palindromes

check-if-dfs-strings-are-palindromes

['Array', 'Hash Table', 'String', 'Tree', 'Depth-First Search', 'Hash Function']

false

71.520619

Medium

3,328

false

true

Find Cities in Each State II

find-cities-in-each-state-ii

['Database']

false

70.406905

Hard

3,329

false

true

Count Substrings With K-Frequency Characters II

count-substrings-with-k-frequency-characters-ii

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

false

56.36051

Easy

3,330

false

Find the Original Typed String I

find-the-original-typed-string-i

['String']

false

54.485536

Medium

3,331

false

Find Subtree Sizes After Changes

find-subtree-sizes-after-changes

['Array', 'Hash Table', 'String', 'Tree', 'Depth-First Search']

false

49.575262

Medium

3,332

false

Maximum Points Tourist Can Earn

maximum-points-tourist-can-earn

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

false

16.233366

Hard

3,333

false

Find the Original Typed String II

find-the-original-typed-string-ii

['String', 'Dynamic Programming', 'Prefix Sum']

false

40.172722

Medium

3,334

false

Find the Maximum Factor Score of Array

find-the-maximum-factor-score-of-array

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

false

26.347227

Medium

3,335

false

Total Characters in String After Transformations I

total-characters-in-string-after-transformations-i

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

false

37.78229

Hard

3,336

false

Find the Number of Subsequences With Equal GCD

find-the-number-of-subsequences-with-equal-gcd

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

false

32.642666

Hard

3,337

false

Total Characters in String After Transformations II

total-characters-in-string-after-transformations-ii

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

false

89.583333

Medium

3,338

false

true

Second Highest Salary II

second-highest-salary-ii

['Database']

false

56.72043

Medium

3,339

false

true

Find the Number of K-Even Arrays

find-the-number-of-k-even-arrays

['Dynamic Programming']

false

84.03494

Easy

3,340

false

Check Balanced String

check-balanced-string

['String']

false

35.642862

Medium

3,341

false

Find Minimum Time to Reach Last Room I

find-minimum-time-to-reach-last-room-i

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

false

49.868173

Medium

3,342

false

Find Minimum Time to Reach Last Room II

find-minimum-time-to-reach-last-room-ii

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

false

15.737731

Hard

3,343

false

Count Number of Balanced Permutations

count-number-of-balanced-permutations

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

false

52.281134

Medium

3,344

false

true

Maximum Sized Array

maximum-sized-array

['Binary Search', 'Bit Manipulation']

false

63.826533

Easy

3,345

false

Smallest Divisible Digit Product I

smallest-divisible-digit-product-i

['Math', 'Enumeration']

false

20.605724

Medium

3,346

false

Maximum Frequency of an Element After Performing Operations I

maximum-frequency-of-an-element-after-performing-operations-i

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

false

37.229342

Hard

3,347

false

Maximum Frequency of an Element After Performing Operations II

maximum-frequency-of-an-element-after-performing-operations-ii

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

false

9.99207

Hard

3,348

false

Smallest Divisible Digit Product II

smallest-divisible-digit-product-ii

['Math', 'String', 'Backtracking', 'Greedy', 'Number Theory']

false

39.726774

Easy

3,349

false

Adjacent Increasing Subarrays Detection I

adjacent-increasing-subarrays-detection-i

['Array']

false

40.699943

Medium

3,350

false

Adjacent Increasing Subarrays Detection II

adjacent-increasing-subarrays-detection-ii

['Array', 'Binary Search']

false

29.391101

Hard

3,351

false

Sum of Good Subsequences

sum-of-good-subsequences

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

false

28.16416

Hard

3,352

false

Count K-Reducible Numbers Less Than N

count-k-reducible-numbers-less-than-n

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

false

63.45733

Easy

3,353

false

true

Minimum Total Operations

minimum-total-operations

['Array']

false

55.303331

Easy

3,354

false

Make Array Elements Equal to Zero

make-array-elements-equal-to-zero

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

false

45.71284

Medium

3,355

false

Zero Array Transformation I

zero-array-transformation-i

['Array', 'Prefix Sum']

false

43.8164

Medium

3,356

false

Zero Array Transformation II

zero-array-transformation-ii

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

true

false

15.121214

Hard

3,357

false

Minimize the Maximum Adjacent Element Difference

minimize-the-maximum-adjacent-element-difference

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

false

92.832255

Easy

3,358

false

true

Books with NULL Ratings

books-with-null-ratings

['Database']

false

50.305499

Hard

3,359

false

true

Find Sorted Submatrices With Maximum Element at Most K

find-sorted-submatrices-with-maximum-element-at-most-k

['Array', 'Stack', 'Matrix', 'Monotonic Stack']

false

41.382036

Easy

3,360

false

Stone Removal Game

stone-removal-game

['Math', 'Simulation']

false

52.43502

Medium

3,361

false

Shift Distance Between Two Strings

shift-distance-between-two-strings

['Array', 'String', 'Prefix Sum']

false

25.868948

Medium

3,362

false

Zero Array Transformation III

zero-array-transformation-iii

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

false

39.219074

Hard

3,363

false

Find the Maximum Number of Fruits Collected

find-the-maximum-number-of-fruits-collected

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

false

45.12178

Easy

3,364

false

Minimum Positive Sum Subarray

minimum-positive-sum-subarray

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

false

52.102431

Medium

3,365

false

Rearrange K Substrings to Form Target String

rearrange-k-substrings-to-form-target-string

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

false

29.209443

Medium

3,366

false

Minimum Array Sum

minimum-array-sum

['Array', 'Dynamic Programming']

false

28.527821

Hard

3,367

false

Maximize Sum of Weights after Edge Removals

maximize-sum-of-weights-after-edge-removals

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

false

87.535411

Hard

3,368

false

true

First Letter Capitalization

first-letter-capitalization

['Database']

false

33.984648

Hard

3,369

false

true

Design an Array Statistics Tracker

design-an-array-statistics-tracker

['Hash Table', 'Binary Search', 'Design', 'Queue', 'Heap (Priority Queue)', 'Data Stream', 'Ordered Set']

false

75.462265

Easy

3,370

false

Smallest Number With All Set Bits

smallest-number-with-all-set-bits

['Math', 'Bit Manipulation']

false

34.694076

Medium

3,371

false

Identify the Largest Outlier in an Array

identify-the-largest-outlier-in-an-array

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

false

47.904617

Medium

3,372

false

Maximize the Number of Target Nodes After Connecting Trees I

maximize-the-number-of-target-nodes-after-connecting-trees-i

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

false

53.752104

Hard

3,373

false

Maximize the Number of Target Nodes After Connecting Trees II

maximize-the-number-of-target-nodes-after-connecting-trees-ii

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

false

77.191107

Hard

3,374

false

First Letter Capitalization II

first-letter-capitalization-ii

['Database']

false

73.138786

Easy

3,375

false

Minimum Operations to Make Array Values Equal to K

minimum-operations-to-make-array-values-equal-to-k

['Array', 'Hash Table']

true

false

30.35613

Medium

3,376

false

Minimum Time to Break Locks I

minimum-time-to-break-locks-i

['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Depth-First Search', 'Bitmask']

false

31.100457

Medium

3,377

false

Digit Operations to Make Two Integers Equal

digit-operations-to-make-two-integers-equal

['Math', 'Graph', 'Heap (Priority Queue)', 'Number Theory', 'Shortest Path']

false

27.667771

Hard

3,378

false

Count Connected Components in LCM Graph

count-connected-components-in-lcm-graph

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

false

56.225419

Easy

3,379

false

Transformed Array

transformed-array

['Array', 'Simulation']

false

50.963187

Medium

3,380

false

Maximum Area Rectangle With Point Constraints I

maximum-area-rectangle-with-point-constraints-i

['Array', 'Math', 'Binary Indexed Tree', 'Segment Tree', 'Geometry', 'Sorting', 'Enumeration']

false

27.845114

Medium

3,381

false

Maximum Subarray Sum With Length Divisible by K

maximum-subarray-sum-with-length-divisible-by-k

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

false

20.103243

Hard

3,382

false

Maximum Area Rectangle With Point Constraints II

maximum-area-rectangle-with-point-constraints-ii

['Array', 'Math', 'Binary Indexed Tree', 'Segment Tree', 'Geometry', 'Sorting']

false

45.903361

Hard

3,383

false

true

Minimum Runes to Add to Cast Spell

minimum-runes-to-add-to-cast-spell

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

false

77.508269

Hard

3,384

false

true

Team Dominance by Pass Success

team-dominance-by-pass-success

['Database']

false

46.420824

Hard

3,385

false

true

Minimum Time to Break Locks II

minimum-time-to-break-locks-ii

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

false

40.412732

Easy

3,386

false

Button with Longest Push Time

button-with-longest-push-time

['Array']

false

59.841684

Medium

3,387

false

Maximize Amount After Two Days of Conversions

maximize-amount-after-two-days-of-conversions

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

false

15.632492

Medium

3,388

false

Count Beautiful Splits in an Array

count-beautiful-splits-in-an-array

['Array', 'Dynamic Programming']

false

24.153578

Hard

3,389

false

Minimum Operations to Make Character Frequencies Equal

minimum-operations-to-make-character-frequencies-equal

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

false

42.964554

Hard

3,390

false

true

Longest Team Pass Streak

longest-team-pass-streak

['Database']

false

68

Medium

3,391

false

true

Design a 3D Binary Matrix with Efficient Layer Tracking

design-a-3d-binary-matrix-with-efficient-layer-tracking

['Array', 'Hash Table', 'Design', 'Heap (Priority Queue)', 'Matrix', 'Ordered Set']

false

51.643217

Easy

3,392

false

Count Subarrays of Length Three With a Condition

count-subarrays-of-length-three-with-a-condition

['Array']

false

39.73299

Medium

3,393

false

Count Paths With the Given XOR Value

count-paths-with-the-given-xor-value

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

false

69.140726

Medium

3,394

false

Check if Grid can be Cut into Sections

check-if-grid-can-be-cut-into-sections

['Array', 'Sorting']

true

false

16.565675

Hard

3,395

false

Subsequences with a Unique Middle Mode I

subsequences-with-a-unique-middle-mode-i

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

false

71.561699

Easy

3,396

false

Minimum Number of Operations to Make Elements in Array Distinct

minimum-number-of-operations-to-make-elements-in-array-distinct

['Array', 'Hash Table']

true

false

31.17351

Medium

3,397

false

Maximum Number of Distinct Elements After Operations

maximum-number-of-distinct-elements-after-operations

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

false

18.88691

Hard

3,398

false

Smallest Substring With Identical Characters I

smallest-substring-with-identical-characters-i

['Array', 'Binary Search', 'Enumeration']

false

40.565763

Hard

3,399

false

Smallest Substring With Identical Characters II

smallest-substring-with-identical-characters-ii

['String', 'Binary Search']

false

85.467128

Medium

3,400

false

true

Maximum Number of Matching Indices After Right Shifts

maximum-number-of-matching-indices-after-right-shifts

['Array', 'Two Pointers', 'Simulation']

false