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
55.331412	Hard	3,401	false	true	Find Circular Gift Exchange Chains	find-circular-gift-exchange-chains	['Database']	false	false
73.069473	Easy	3,402	false	false	Minimum Operations to Make Columns Strictly Increasing	minimum-operations-to-make-columns-strictly-increasing	['Array', 'Greedy', 'Matrix']	false	false
23.659383	Medium	3,403	false	false	Find the Lexicographically Largest String From the Box I	find-the-lexicographically-largest-string-from-the-box-i	['Two Pointers', 'String', 'Enumeration']	false	false
28.425389	Medium	3,404	false	false	Count Special Subsequences	count-special-subsequences	['Array', 'Hash Table', 'Math', 'Enumeration']	false	false
37.67532	Hard	3,405	false	false	Count the Number of Arrays with K Matching Adjacent Elements	count-the-number-of-arrays-with-k-matching-adjacent-elements	['Math', 'Combinatorics']	false	false
51.29683	Hard	3,406	false	true	Find the Lexicographically Largest String From the Box II	find-the-lexicographically-largest-string-from-the-box-ii	['Two Pointers', 'String']	false	false
26.385918	Easy	3,407	false	false	Substring Matching Pattern	substring-matching-pattern	['String', 'String Matching']	false	false
34.138626	Medium	3,408	false	false	Design Task Manager	design-task-manager	['Hash Table', 'Design', 'Heap (Priority Queue)', 'Ordered Set']	false	false
14.123585	Medium	3,409	false	false	Longest Subsequence With Decreasing Adjacent Difference	longest-subsequence-with-decreasing-adjacent-difference	['Array', 'Dynamic Programming']	false	false
20.269433	Hard	3,410	false	false	Maximize Subarray Sum After Removing All Occurrences of One Element	maximize-subarray-sum-after-removing-all-occurrences-of-one-element	['Array', 'Dynamic Programming', 'Segment Tree']	false	false
45.935761	Easy	3,411	false	false	Maximum Subarray With Equal Products	maximum-subarray-with-equal-products	['Array', 'Math', 'Sliding Window', 'Enumeration', 'Number Theory']	false	false
36.115888	Medium	3,412	false	false	Find Mirror Score of a String	find-mirror-score-of-a-string	['Hash Table', 'String', 'Stack', 'Simulation']	false	false
23.546982	Medium	3,413	false	false	Maximum Coins From K Consecutive Bags	maximum-coins-from-k-consecutive-bags	['Array', 'Binary Search', 'Greedy', 'Sliding Window', 'Sorting', 'Prefix Sum']	false	false
32.267681	Hard	3,414	false	false	Maximum Score of Non-overlapping Intervals	maximum-score-of-non-overlapping-intervals	['Array', 'Binary Search', 'Dynamic Programming', 'Sorting']	false	false
82.502444	Easy	3,415	false	true	Find Products with Three Consecutive Digits	find-products-with-three-consecutive-digits	['Database']	false	false
43.661972	Hard	3,416	false	true	Subsequences with a Unique Middle Mode II	subsequences-with-a-unique-middle-mode-ii	['Array', 'Hash Table', 'Math', 'Combinatorics']	false	false
64.118935	Easy	3,417	false	false	Zigzag Grid Traversal With Skip	zigzag-grid-traversal-with-skip	['Array', 'Matrix', 'Simulation']	false	false
29.797272	Medium	3,418	false	false	Maximum Amount of Money Robot Can Earn	maximum-amount-of-money-robot-can-earn	['Array', 'Dynamic Programming', 'Matrix']	false	false
43.237499	Medium	3,419	false	false	Minimize the Maximum Edge Weight of Graph	minimize-the-maximum-edge-weight-of-graph	['Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Shortest Path']	false	false
21.819031	Hard	3,420	false	false	Count Non-Decreasing Subarrays After K Operations	count-non-decreasing-subarrays-after-k-operations	['Array', 'Stack', 'Segment Tree', 'Queue', 'Sliding Window', 'Monotonic Stack', 'Monotonic Queue']	false	false
48.444185	Medium	3,421	false	false	Find Students Who Improved	find-students-who-improved	['Database']	false	false
49.94012	Medium	3,422	false	true	Minimum Operations to Make Subarray Elements Equal	minimum-operations-to-make-subarray-elements-equal	['Array', 'Hash Table', 'Math', 'Sliding Window', 'Heap (Priority Queue)']	false	false
73.75963	Easy	3,423	false	false	Maximum Difference Between Adjacent Elements in a Circular Array	maximum-difference-between-adjacent-elements-in-a-circular-array	['Array']	false	false
36.686333	Medium	3,424	false	false	Minimum Cost to Make Arrays Identical	minimum-cost-to-make-arrays-identical	['Array', 'Greedy', 'Sorting']	false	false
20.078017	Hard	3,425	false	false	Longest Special Path	longest-special-path	['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Prefix Sum']	false	false
35.793743	Hard	3,426	false	false	Manhattan Distances of All Arrangements of Pieces	manhattan-distances-of-all-arrangements-of-pieces	['Math', 'Combinatorics']	false	false
85.986081	Easy	3,427	false	false	Sum of Variable Length Subarrays	sum-of-variable-length-subarrays	['Array', 'Prefix Sum']	false	false
21.036	Medium	3,428	false	false	Maximum and Minimum Sums of at Most Size K Subsequences	maximum-and-minimum-sums-of-at-most-size-k-subsequences	['Array', 'Math', 'Dynamic Programming', 'Sorting', 'Combinatorics']	false	false
45.371578	Medium	3,429	false	false	Paint House IV	paint-house-iv	['Array', 'Dynamic Programming']	false	false
23.47743	Hard	3,430	false	false	Maximum and Minimum Sums of at Most Size K Subarrays	maximum-and-minimum-sums-of-at-most-size-k-subarrays	['Array', 'Math', 'Stack', 'Monotonic Stack']	false	false
59.52381	Medium	3,431	false	true	Minimum Unlocked Indices to Sort Nums	minimum-unlocked-indices-to-sort-nums	['Array', 'Hash Table']	false	false
80.65976	Easy	3,432	false	false	Count Partitions with Even Sum Difference	count-partitions-with-even-sum-difference	['Array', 'Math', 'Prefix Sum']	false	false
30.139104	Medium	3,433	false	false	Count Mentions Per User	count-mentions-per-user	['Array', 'Math', 'Sorting', 'Simulation']	false	false
23.498356	Medium	3,434	false	false	Maximum Frequency After Subarray Operation	maximum-frequency-after-subarray-operation	['Array', 'Hash Table', 'Dynamic Programming', 'Greedy', 'Enumeration', 'Prefix Sum']	false	false
24.601687	Hard	3,435	false	false	Frequencies of Shortest Supersequences	frequencies-of-shortest-supersequences	['Array', 'String', 'Bit Manipulation', 'Graph', 'Topological Sort', 'Enumeration']	false	false
58.497785	Easy	3,436	false	false	Find Valid Emails	find-valid-emails	['Database']	false	false
87.054632	Medium	3,437	false	true	Permutations III	permutations-iii	['Array', 'Backtracking']	false	false
61.608362	Easy	3,438	false	false	Find Valid Pair of Adjacent Digits in String	find-valid-pair-of-adjacent-digits-in-string	['Hash Table', 'String', 'Counting']	false	false
31.431496	Medium	3,439	false	false	Reschedule Meetings for Maximum Free Time I	reschedule-meetings-for-maximum-free-time-i	['Array', 'Greedy', 'Sliding Window']	false	false
40.185821	Medium	3,440	false	false	Reschedule Meetings for Maximum Free Time II	reschedule-meetings-for-maximum-free-time-ii	['Array', 'Greedy', 'Enumeration']	false	false
19.180449	Hard	3,441	false	false	Minimum Cost Good Caption	minimum-cost-good-caption	['String', 'Dynamic Programming']	false	false
49.123524	Easy	3,442	false	false	Maximum Difference Between Even and Odd Frequency I	maximum-difference-between-even-and-odd-frequency-i	['Hash Table', 'String', 'Counting']	false	false
30.998767	Medium	3,443	false	false	Maximum Manhattan Distance After K Changes	maximum-manhattan-distance-after-k-changes	['Hash Table', 'Math', 'String', 'Counting']	false	false
25.63427	Hard	3,444	false	false	Minimum Increments for Target Multiples in an Array	minimum-increments-for-target-multiples-in-an-array	['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Number Theory', 'Bitmask']	false	false
19.318287	Hard	3,445	false	false	Maximum Difference Between Even and Odd Frequency II	maximum-difference-between-even-and-odd-frequency-ii	['String', 'Sliding Window', 'Enumeration', 'Prefix Sum']	false	false
72.548714	Medium	3,446	false	false	Sort Matrix by Diagonals	sort-matrix-by-diagonals	['Array', 'Sorting', 'Matrix']	false	false
27.040024	Medium	3,447	false	false	Assign Elements to Groups with Constraints	assign-elements-to-groups-with-constraints	['Array', 'Hash Table']	false	false
20.895784	Hard	3,448	false	false	Count Substrings Divisible By Last Digit	count-substrings-divisible-by-last-digit	['String', 'Dynamic Programming']	false	false
24.473617	Hard	3,449	false	false	Maximize the Minimum Game Score	maximize-the-minimum-game-score	['Array', 'Binary Search', 'Greedy']	false	false
86.326861	Easy	3,450	false	true	Maximum Students on a Single Bench	maximum-students-on-a-single-bench	['Array', 'Hash Table']	false	false
58.381823	Hard	3,451	false	false	Find Invalid IP Addresses	find-invalid-ip-addresses	['Database']	false	false
69.893479	Easy	3,452	false	false	Sum of Good Numbers	sum-of-good-numbers	['Array']	false	false
36.594288	Medium	3,453	false	false	Separate Squares I	separate-squares-i	['Array', 'Binary Search']	false	false
19.371981	Hard	3,454	false	false	Separate Squares II	separate-squares-ii	['Array', 'Binary Search', 'Segment Tree', 'Line Sweep']	false	false
24.51695	Hard	3,455	false	false	Shortest Matching Substring	shortest-matching-substring	['Two Pointers', 'String', 'Binary Search', 'String Matching']	false	false
35.308896	Easy	3,456	false	false	Find Special Substring of Length K	find-special-substring-of-length-k	['String']	false	false
32.621201	Medium	3,457	false	false	Eat Pizzas!	eat-pizzas	['Array', 'Greedy', 'Sorting']	false	false
17.815273	Medium	3,458	false	false	Select K Disjoint Special Substrings	select-k-disjoint-special-substrings	['Hash Table', 'String', 'Dynamic Programming', 'Greedy', 'Sorting']	false	false
39.880952	Hard	3,459	false	false	Length of Longest V-Shaped Diagonal Segment	length-of-longest-v-shaped-diagonal-segment	['Array', 'Dynamic Programming', 'Memoization', 'Matrix']	false	false
68.735632	Medium	3,460	false	true	Longest Common Prefix After at Most One Removal	longest-common-prefix-after-at-most-one-removal	['Two Pointers', 'String']	false	false
80.117066	Easy	3,461	false	false	Check If Digits Are Equal in String After Operations I	check-if-digits-are-equal-in-string-after-operations-i	['Math', 'String', 'Simulation', 'Combinatorics', 'Number Theory']	false	false
60.334033	Medium	3,462	false	false	Maximum Sum With at Most K Elements	maximum-sum-with-at-most-k-elements	['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Matrix']	false	false
9.919019	Hard	3,463	false	false	Check If Digits Are Equal in String After Operations II	check-if-digits-are-equal-in-string-after-operations-ii	['Math', 'String', 'Combinatorics', 'Number Theory']	false	false
18.705574	Hard	3,464	false	false	Maximize the Distance Between Points on a Square	maximize-the-distance-between-points-on-a-square	['Array', 'Binary Search', 'Greedy']	false	false
84.807978	Easy	3,465	false	false	Find Products with Valid Serial Numbers	find-products-with-valid-serial-numbers	['Database']	false	false
54.008604	Medium	3,466	false	true	Maximum Coin Collection	maximum-coin-collection	['Array', 'Dynamic Programming']	false	false
89.019452	Easy	3,467	false	false	Transform Array by Parity	transform-array-by-parity	['Array', 'Sorting', 'Counting']	false	false
45.503654	Medium	3,468	false	false	Find the Number of Copy Arrays	find-the-number-of-copy-arrays	['Array', 'Math']	false	false
17.477188	Medium	3,469	false	false	Find Minimum Cost to Remove Array Elements	find-minimum-cost-to-remove-array-elements	['Array', 'Dynamic Programming']	false	false
26.495923	Hard	3,470	false	false	Permutations IV	permutations-iv	['Array', 'Math', 'Combinatorics', 'Enumeration']	false	false
36.47558	Easy	3,471	false	false	Find the Largest Almost Missing Integer	find-the-largest-almost-missing-integer	['Array', 'Hash Table']	false	false
35.780079	Medium	3,472	false	false	Longest Palindromic Subsequence After at Most K Operations	longest-palindromic-subsequence-after-at-most-k-operations	['String', 'Dynamic Programming']	false	false
24.306669	Medium	3,473	false	false	Sum of K Subarrays With Length at Least M	sum-of-k-subarrays-with-length-at-least-m	['Array', 'Dynamic Programming', 'Prefix Sum']	false	false
28.741983	Hard	3,474	false	false	Lexicographically Smallest Generated String	lexicographically-smallest-generated-string	['String', 'Greedy', 'String Matching']	false	false
87.444477	Medium	3,475	false	false	DNA Pattern Recognition	dna-pattern-recognition	['Database']	false	false
63.157895	Medium	3,476	false	true	Maximize Profit from Task Assignment	maximize-profit-from-task-assignment	['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']	false	false
51.228546	Easy	3,477	false	false	Fruits Into Baskets II	fruits-into-baskets-ii	['Array', 'Binary Search', 'Segment Tree', 'Simulation']	false	false
30.630987	Medium	3,478	false	false	Choose K Elements With Maximum Sum	choose-k-elements-with-maximum-sum	['Array', 'Sorting', 'Heap (Priority Queue)']	false	false
21.131025	Medium	3,479	false	false	Fruits Into Baskets III	fruits-into-baskets-iii	['Array', 'Binary Search', 'Segment Tree', 'Ordered Set']	false	false
31.538903	Hard	3,480	false	false	Maximize Subarrays After Removing One Conflicting Pair	maximize-subarrays-after-removing-one-conflicting-pair	['Array', 'Segment Tree', 'Enumeration', 'Prefix Sum']	false	false
77.129751	Medium	3,481	false	true	Apply Substitutions	apply-substitutions	['Array', 'Hash Table', 'String', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']	false	false
64.463397	Hard	3,482	false	false	Analyze Organization Hierarchy	analyze-organization-hierarchy	['Database']	false	false
65.74973	Easy	3,483	false	false	Unique 3-Digit Even Numbers	unique-3-digit-even-numbers	['Array', 'Hash Table', 'Recursion', 'Enumeration']	false	false
68.002214	Medium	3,484	false	false	Design Spreadsheet	design-spreadsheet	['Array', 'Hash Table', 'String', 'Design', 'Matrix']	false	false
19.530542	Hard	3,485	false	false	Longest Common Prefix of K Strings After Removal	longest-common-prefix-of-k-strings-after-removal	['Array', 'String', 'Trie']	false	false
15.505139	Hard	3,486	false	false	Longest Special Path II	longest-special-path-ii	['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Prefix Sum']	false	false
26.803501	Easy	3,487	false	false	Maximum Unique Subarray Sum After Deletion	maximum-unique-subarray-sum-after-deletion	['Array', 'Hash Table', 'Greedy']	false	false
30.449218	Medium	3,488	false	false	Closest Equal Element Queries	closest-equal-element-queries	['Array', 'Hash Table', 'Binary Search']	false	false
28.86251	Medium	3,489	false	false	Zero Array Transformation IV	zero-array-transformation-iv	['Array', 'Dynamic Programming']	false	false
20.052068	Hard	3,490	false	false	Count Beautiful Numbers	count-beautiful-numbers	['Dynamic Programming']	false	false
75.406284	Easy	3,491	false	true	Phone Number Prefix	phone-number-prefix	['Array', 'String', 'Trie', 'Sorting']	false	false
74.304139	Easy	3,492	false	false	Maximum Containers on a Ship	maximum-containers-on-a-ship	['Math']	false	false
46.280773	Medium	3,493	false	false	Properties Graph	properties-graph	['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']	false	false
32.821637	Medium	3,494	false	false	Find the Minimum Amount of Time to Brew Potions	find-the-minimum-amount-of-time-to-brew-potions	['Array', 'Simulation', 'Prefix Sum']	false	false
30.406494	Hard	3,495	false	false	Minimum Operations to Make Array Elements Zero	minimum-operations-to-make-array-elements-zero	['Array', 'Math', 'Bit Manipulation']	false	false
62.450593	Medium	3,496	false	true	Maximize Score After Pair Deletions	maximize-score-after-pair-deletions	['Array', 'Greedy']	false	false
84.670782	Medium	3,497	false	false	Analyze Subscription Conversion	analyze-subscription-conversion	['Database']	false	false
88.753774	Easy	3,498	false	false	Reverse Degree of a String	reverse-degree-of-a-string	['String', 'Simulation']	false	false
29.863252	Medium	3,499	false	false	Maximize Active Section with Trade I	maximize-active-section-with-trade-i	['String', 'Enumeration']	false	false
21.903417	Hard	3,500	false	false	Minimum Cost to Divide Array Into Subarrays	minimum-cost-to-divide-array-into-subarrays	['Array', 'Dynamic Programming', 'Prefix Sum']	false	false

55.331412

Hard

3,401

false

true

Find Circular Gift Exchange Chains

find-circular-gift-exchange-chains

['Database']

false

73.069473

Easy

3,402

false

Minimum Operations to Make Columns Strictly Increasing

minimum-operations-to-make-columns-strictly-increasing

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

false

23.659383

Medium

3,403

false

Find the Lexicographically Largest String From the Box I

find-the-lexicographically-largest-string-from-the-box-i

['Two Pointers', 'String', 'Enumeration']

false

28.425389

Medium

3,404

false

Count Special Subsequences

count-special-subsequences

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

false

37.67532

Hard

3,405

false

Count the Number of Arrays with K Matching Adjacent Elements

count-the-number-of-arrays-with-k-matching-adjacent-elements

['Math', 'Combinatorics']

false

51.29683

Hard

3,406

false

true

Find the Lexicographically Largest String From the Box II

find-the-lexicographically-largest-string-from-the-box-ii

['Two Pointers', 'String']

false

26.385918

Easy

3,407

false

Substring Matching Pattern

substring-matching-pattern

['String', 'String Matching']

false

34.138626

Medium

3,408

false

Design Task Manager

design-task-manager

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

false

14.123585

Medium

3,409

false

Longest Subsequence With Decreasing Adjacent Difference

longest-subsequence-with-decreasing-adjacent-difference

['Array', 'Dynamic Programming']

false

20.269433

Hard

3,410

false

Maximize Subarray Sum After Removing All Occurrences of One Element

maximize-subarray-sum-after-removing-all-occurrences-of-one-element

['Array', 'Dynamic Programming', 'Segment Tree']

false

45.935761

Easy

3,411

false

Maximum Subarray With Equal Products

maximum-subarray-with-equal-products

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

false

36.115888

Medium

3,412

false

Find Mirror Score of a String

find-mirror-score-of-a-string

['Hash Table', 'String', 'Stack', 'Simulation']

false

23.546982

Medium

3,413

false

Maximum Coins From K Consecutive Bags

maximum-coins-from-k-consecutive-bags

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

false

32.267681

Hard

3,414

false

Maximum Score of Non-overlapping Intervals

maximum-score-of-non-overlapping-intervals

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

false

82.502444

Easy

3,415

false

true

Find Products with Three Consecutive Digits

find-products-with-three-consecutive-digits

['Database']

false

43.661972

Hard

3,416

false

true

Subsequences with a Unique Middle Mode II

subsequences-with-a-unique-middle-mode-ii

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

false

64.118935

Easy

3,417

false

Zigzag Grid Traversal With Skip

zigzag-grid-traversal-with-skip

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

false

29.797272

Medium

3,418

false

Maximum Amount of Money Robot Can Earn

maximum-amount-of-money-robot-can-earn

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

false

43.237499

Medium

3,419

false

Minimize the Maximum Edge Weight of Graph

minimize-the-maximum-edge-weight-of-graph

['Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Shortest Path']

false

21.819031

Hard

3,420

false

Count Non-Decreasing Subarrays After K Operations

count-non-decreasing-subarrays-after-k-operations

['Array', 'Stack', 'Segment Tree', 'Queue', 'Sliding Window', 'Monotonic Stack', 'Monotonic Queue']

false

48.444185

Medium

3,421

false

Find Students Who Improved

find-students-who-improved

['Database']

false

49.94012

Medium

3,422

false

true

Minimum Operations to Make Subarray Elements Equal

minimum-operations-to-make-subarray-elements-equal

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

false

73.75963

Easy

3,423

false

Maximum Difference Between Adjacent Elements in a Circular Array

maximum-difference-between-adjacent-elements-in-a-circular-array

['Array']

false

36.686333

Medium

3,424

false

Minimum Cost to Make Arrays Identical

minimum-cost-to-make-arrays-identical

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

false

20.078017

Hard

3,425

false

Longest Special Path

longest-special-path

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

false

35.793743

Hard

3,426

false

Manhattan Distances of All Arrangements of Pieces

manhattan-distances-of-all-arrangements-of-pieces

['Math', 'Combinatorics']

false

85.986081

Easy

3,427

false

Sum of Variable Length Subarrays

sum-of-variable-length-subarrays

['Array', 'Prefix Sum']

false

21.036

Medium

3,428

false

Maximum and Minimum Sums of at Most Size K Subsequences

maximum-and-minimum-sums-of-at-most-size-k-subsequences

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

false

45.371578

Medium

3,429

false

Paint House IV

paint-house-iv

['Array', 'Dynamic Programming']

false

23.47743

Hard

3,430

false

Maximum and Minimum Sums of at Most Size K Subarrays

maximum-and-minimum-sums-of-at-most-size-k-subarrays

['Array', 'Math', 'Stack', 'Monotonic Stack']

false

59.52381

Medium

3,431

false

true

Minimum Unlocked Indices to Sort Nums

minimum-unlocked-indices-to-sort-nums

['Array', 'Hash Table']

false

80.65976

Easy

3,432

false

Count Partitions with Even Sum Difference

count-partitions-with-even-sum-difference

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

false

30.139104

Medium

3,433

false

Count Mentions Per User

count-mentions-per-user

['Array', 'Math', 'Sorting', 'Simulation']

false

23.498356

Medium

3,434

false

Maximum Frequency After Subarray Operation

maximum-frequency-after-subarray-operation

['Array', 'Hash Table', 'Dynamic Programming', 'Greedy', 'Enumeration', 'Prefix Sum']

false

24.601687

Hard

3,435

false

Frequencies of Shortest Supersequences

frequencies-of-shortest-supersequences

['Array', 'String', 'Bit Manipulation', 'Graph', 'Topological Sort', 'Enumeration']

false

58.497785

Easy

3,436

false

Find Valid Emails

find-valid-emails

['Database']

false

87.054632

Medium

3,437

false

true

Permutations III

permutations-iii

['Array', 'Backtracking']

false

61.608362

Easy

3,438

false

Find Valid Pair of Adjacent Digits in String

find-valid-pair-of-adjacent-digits-in-string

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

false

31.431496

Medium

3,439

false

Reschedule Meetings for Maximum Free Time I

reschedule-meetings-for-maximum-free-time-i

['Array', 'Greedy', 'Sliding Window']

false

40.185821

Medium

3,440

false

Reschedule Meetings for Maximum Free Time II

reschedule-meetings-for-maximum-free-time-ii

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

false

19.180449

Hard

3,441

false

Minimum Cost Good Caption

minimum-cost-good-caption

['String', 'Dynamic Programming']

false

49.123524

Easy

3,442

false

Maximum Difference Between Even and Odd Frequency I

maximum-difference-between-even-and-odd-frequency-i

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

false

30.998767

Medium

3,443

false

Maximum Manhattan Distance After K Changes

maximum-manhattan-distance-after-k-changes

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

false

25.63427

Hard

3,444

false

Minimum Increments for Target Multiples in an Array

minimum-increments-for-target-multiples-in-an-array

['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Number Theory', 'Bitmask']

false

19.318287

Hard

3,445

false

Maximum Difference Between Even and Odd Frequency II

maximum-difference-between-even-and-odd-frequency-ii

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

false

72.548714

Medium

3,446

false

Sort Matrix by Diagonals

sort-matrix-by-diagonals

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

false

27.040024

Medium

3,447

false

Assign Elements to Groups with Constraints

assign-elements-to-groups-with-constraints

['Array', 'Hash Table']

false

20.895784

Hard

3,448

false

Count Substrings Divisible By Last Digit

count-substrings-divisible-by-last-digit

['String', 'Dynamic Programming']

false

24.473617

Hard

3,449

false

Maximize the Minimum Game Score

maximize-the-minimum-game-score

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

false

86.326861

Easy

3,450

false

true

Maximum Students on a Single Bench

maximum-students-on-a-single-bench

['Array', 'Hash Table']

false

58.381823

Hard

3,451

false

Find Invalid IP Addresses

find-invalid-ip-addresses

['Database']

false

69.893479

Easy

3,452

false

Sum of Good Numbers

sum-of-good-numbers

['Array']

false

36.594288

Medium

3,453

false

Separate Squares I

separate-squares-i

['Array', 'Binary Search']

false

19.371981

Hard

3,454

false

Separate Squares II

separate-squares-ii

['Array', 'Binary Search', 'Segment Tree', 'Line Sweep']

false

24.51695

Hard

3,455

false

Shortest Matching Substring

shortest-matching-substring

['Two Pointers', 'String', 'Binary Search', 'String Matching']

false

35.308896

Easy

3,456

false

Find Special Substring of Length K

find-special-substring-of-length-k

['String']

false

32.621201

Medium

3,457

false

Eat Pizzas!

eat-pizzas

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

false

17.815273

Medium

3,458

false

Select K Disjoint Special Substrings

select-k-disjoint-special-substrings

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

false

39.880952

Hard

3,459

false

Length of Longest V-Shaped Diagonal Segment

length-of-longest-v-shaped-diagonal-segment

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

false

68.735632

Medium

3,460

false

true

Longest Common Prefix After at Most One Removal

longest-common-prefix-after-at-most-one-removal

['Two Pointers', 'String']

false

80.117066

Easy

3,461

false

Check If Digits Are Equal in String After Operations I

check-if-digits-are-equal-in-string-after-operations-i

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

false

60.334033

Medium

3,462

false

Maximum Sum With at Most K Elements

maximum-sum-with-at-most-k-elements

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

false

9.919019

Hard

3,463

false

Check If Digits Are Equal in String After Operations II

check-if-digits-are-equal-in-string-after-operations-ii

['Math', 'String', 'Combinatorics', 'Number Theory']

false

18.705574

Hard

3,464

false

Maximize the Distance Between Points on a Square

maximize-the-distance-between-points-on-a-square

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

false

84.807978

Easy

3,465

false

Find Products with Valid Serial Numbers

find-products-with-valid-serial-numbers

['Database']

false

54.008604

Medium

3,466

false

true

Maximum Coin Collection

maximum-coin-collection

['Array', 'Dynamic Programming']

false

89.019452

Easy

3,467

false

Transform Array by Parity

transform-array-by-parity

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

false

45.503654

Medium

3,468

false

Find the Number of Copy Arrays

find-the-number-of-copy-arrays

['Array', 'Math']

false

17.477188

Medium

3,469

false

Find Minimum Cost to Remove Array Elements

find-minimum-cost-to-remove-array-elements

['Array', 'Dynamic Programming']

false

26.495923

Hard

3,470

false

Permutations IV

permutations-iv

['Array', 'Math', 'Combinatorics', 'Enumeration']

false

36.47558

Easy

3,471

false

Find the Largest Almost Missing Integer

find-the-largest-almost-missing-integer

['Array', 'Hash Table']

false

35.780079

Medium

3,472

false

Longest Palindromic Subsequence After at Most K Operations

longest-palindromic-subsequence-after-at-most-k-operations

['String', 'Dynamic Programming']

false

24.306669

Medium

3,473

false

Sum of K Subarrays With Length at Least M

sum-of-k-subarrays-with-length-at-least-m

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

false

28.741983

Hard

3,474

false

Lexicographically Smallest Generated String

lexicographically-smallest-generated-string

['String', 'Greedy', 'String Matching']

false

87.444477

Medium

3,475

false

DNA Pattern Recognition

dna-pattern-recognition

['Database']

false

63.157895

Medium

3,476

false

true

Maximize Profit from Task Assignment

maximize-profit-from-task-assignment

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

false

51.228546

Easy

3,477

false

Fruits Into Baskets II

fruits-into-baskets-ii

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

false

30.630987

Medium

3,478

false

Choose K Elements With Maximum Sum

choose-k-elements-with-maximum-sum

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

false

21.131025

Medium

3,479

false

Fruits Into Baskets III

fruits-into-baskets-iii

['Array', 'Binary Search', 'Segment Tree', 'Ordered Set']

false

31.538903

Hard

3,480

false

Maximize Subarrays After Removing One Conflicting Pair

maximize-subarrays-after-removing-one-conflicting-pair

['Array', 'Segment Tree', 'Enumeration', 'Prefix Sum']

false

77.129751

Medium

3,481

false

true

Apply Substitutions

apply-substitutions

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

false

64.463397

Hard

3,482

false

Analyze Organization Hierarchy

analyze-organization-hierarchy

['Database']

false

65.74973

Easy

3,483

false

Unique 3-Digit Even Numbers

unique-3-digit-even-numbers

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

false

68.002214

Medium

3,484

false

Design Spreadsheet

design-spreadsheet

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

false

19.530542

Hard

3,485

false

Longest Common Prefix of K Strings After Removal

longest-common-prefix-of-k-strings-after-removal

['Array', 'String', 'Trie']

false

15.505139

Hard

3,486

false

Longest Special Path II

longest-special-path-ii

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

false

26.803501

Easy

3,487

false

Maximum Unique Subarray Sum After Deletion

maximum-unique-subarray-sum-after-deletion

['Array', 'Hash Table', 'Greedy']

false

30.449218

Medium

3,488

false

Closest Equal Element Queries

closest-equal-element-queries

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

false

28.86251

Medium

3,489

false

Zero Array Transformation IV

zero-array-transformation-iv

['Array', 'Dynamic Programming']

false

20.052068

Hard

3,490

false

Count Beautiful Numbers

count-beautiful-numbers

['Dynamic Programming']

false

75.406284

Easy

3,491

false

true

Phone Number Prefix

phone-number-prefix

['Array', 'String', 'Trie', 'Sorting']

false

74.304139

Easy

3,492

false

Maximum Containers on a Ship

maximum-containers-on-a-ship

['Math']

false

46.280773

Medium

3,493

false

Properties Graph

properties-graph

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

false

32.821637

Medium

3,494

false

Find the Minimum Amount of Time to Brew Potions

find-the-minimum-amount-of-time-to-brew-potions

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

false

30.406494

Hard

3,495

false

Minimum Operations to Make Array Elements Zero

minimum-operations-to-make-array-elements-zero

['Array', 'Math', 'Bit Manipulation']

false

62.450593

Medium

3,496

false

true

Maximize Score After Pair Deletions

maximize-score-after-pair-deletions

['Array', 'Greedy']

false

84.670782

Medium

3,497

false

Analyze Subscription Conversion

analyze-subscription-conversion

['Database']

false

88.753774

Easy

3,498

false

Reverse Degree of a String

reverse-degree-of-a-string

['String', 'Simulation']

false

29.863252

Medium

3,499

false

Maximize Active Section with Trade I

maximize-active-section-with-trade-i

['String', 'Enumeration']

false

21.903417

Hard

3,500

false

Minimum Cost to Divide Array Into Subarrays

minimum-cost-to-divide-array-into-subarrays

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

false