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
27.750881	Medium	2,901	false	false	Longest Unequal Adjacent Groups Subsequence II	longest-unequal-adjacent-groups-subsequence-ii	['Array', 'String', 'Dynamic Programming']	false	false
20.232118	Hard	2,902	false	false	Count of Sub-Multisets With Bounded Sum	count-of-sub-multisets-with-bounded-sum	['Array', 'Hash Table', 'Dynamic Programming', 'Sliding Window']	false	false
60.308862	Easy	2,903	false	false	Find Indices With Index and Value Difference I	find-indices-with-index-and-value-difference-i	['Array', 'Two Pointers']	false	false
39.570041	Medium	2,904	false	false	Shortest and Lexicographically Smallest Beautiful String	shortest-and-lexicographically-smallest-beautiful-string	['String', 'Sliding Window']	false	false
31.607625	Medium	2,905	false	false	Find Indices With Index and Value Difference II	find-indices-with-index-and-value-difference-ii	['Array', 'Two Pointers']	false	false
30.678556	Medium	2,906	false	false	Construct Product Matrix	construct-product-matrix	['Array', 'Matrix', 'Prefix Sum']	false	false
54.577341	Medium	2,907	false	true	Maximum Profitable Triplets With Increasing Prices I	maximum-profitable-triplets-with-increasing-prices-i	['Array', 'Binary Indexed Tree', 'Segment Tree']	false	false
65.610082	Easy	2,908	false	false	Minimum Sum of Mountain Triplets I	minimum-sum-of-mountain-triplets-i	['Array']	false	false
53.404106	Medium	2,909	false	false	Minimum Sum of Mountain Triplets II	minimum-sum-of-mountain-triplets-ii	['Array']	false	false
23.899469	Medium	2,910	false	false	Minimum Number of Groups to Create a Valid Assignment	minimum-number-of-groups-to-create-a-valid-assignment	['Array', 'Hash Table', 'Greedy']	false	false
34.549224	Hard	2,911	false	false	Minimum Changes to Make K Semi-palindromes	minimum-changes-to-make-k-semi-palindromes	['Two Pointers', 'String', 'Dynamic Programming']	false	false
58.595506	Hard	2,912	false	true	Number of Ways to Reach Destination in the Grid	number-of-ways-to-reach-destination-in-the-grid	['Math', 'Dynamic Programming', 'Combinatorics']	false	false
79.356493	Easy	2,913	false	false	Subarrays Distinct Element Sum of Squares I	subarrays-distinct-element-sum-of-squares-i	['Array', 'Hash Table']	false	false
76.492168	Medium	2,914	false	false	Minimum Number of Changes to Make Binary String Beautiful	minimum-number-of-changes-to-make-binary-string-beautiful	['String']	true	false
36.788998	Medium	2,915	false	false	Length of the Longest Subsequence That Sums to Target	length-of-the-longest-subsequence-that-sums-to-target	['Array', 'Dynamic Programming']	false	false
20.43464	Hard	2,916	false	false	Subarrays Distinct Element Sum of Squares II	subarrays-distinct-element-sum-of-squares-ii	['Array', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree']	false	false
71.981874	Easy	2,917	false	false	Find the K-or of an Array	find-the-k-or-of-an-array	['Array', 'Bit Manipulation']	false	false
36.498597	Medium	2,918	false	false	Minimum Equal Sum of Two Arrays After Replacing Zeros	minimum-equal-sum-of-two-arrays-after-replacing-zeros	['Array', 'Greedy']	false	false
33.682316	Medium	2,919	false	false	Minimum Increment Operations to Make Array Beautiful	minimum-increment-operations-to-make-array-beautiful	['Array', 'Dynamic Programming']	false	false
35.419393	Hard	2,920	false	false	Maximum Points After Collecting Coins From All Nodes	maximum-points-after-collecting-coins-from-all-nodes	['Array', 'Dynamic Programming', 'Bit Manipulation', 'Tree', 'Depth-First Search', 'Memoization']	false	false
45.905334	Hard	2,921	false	true	Maximum Profitable Triplets With Increasing Prices II	maximum-profitable-triplets-with-increasing-prices-ii	['Array', 'Binary Indexed Tree', 'Segment Tree']	false	false
41.455331	Medium	2,922	false	true	Market Analysis III	market-analysis-iii	['Database']	false	false
72.179248	Easy	2,923	false	false	Find Champion I	find-champion-i	['Array', 'Matrix']	false	false
69.986362	Medium	2,924	false	false	Find Champion II	find-champion-ii	['Graph']	true	false
46.703507	Medium	2,925	false	false	Maximum Score After Applying Operations on a Tree	maximum-score-after-applying-operations-on-a-tree	['Dynamic Programming', 'Tree', 'Depth-First Search']	false	false
24.622701	Hard	2,926	false	false	Maximum Balanced Subsequence Sum	maximum-balanced-subsequence-sum	['Array', 'Binary Search', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree']	false	false
43.761412	Hard	2,927	false	true	Distribute Candies Among Children III	distribute-candies-among-children-iii	['Math', 'Combinatorics']	false	false
72.986921	Easy	2,928	false	false	Distribute Candies Among Children I	distribute-candies-among-children-i	['Math', 'Combinatorics', 'Enumeration']	false	false
34.823169	Medium	2,929	false	false	Distribute Candies Among Children II	distribute-candies-among-children-ii	['Math', 'Combinatorics', 'Enumeration']	false	false
55.87945	Medium	2,930	false	false	Number of Strings Which Can Be Rearranged to Contain Substring	number-of-strings-which-can-be-rearranged-to-contain-substring	['Math', 'Dynamic Programming', 'Combinatorics']	false	false
59.607879	Hard	2,931	false	false	Maximum Spending After Buying Items	maximum-spending-after-buying-items	['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Matrix']	false	false
74.547129	Easy	2,932	false	false	Maximum Strong Pair XOR I	maximum-strong-pair-xor-i	['Array', 'Hash Table', 'Bit Manipulation', 'Trie', 'Sliding Window']	false	false
45.622374	Medium	2,933	false	false	High-Access Employees	high-access-employees	['Array', 'Hash Table', 'String', 'Sorting']	false	false
42.990654	Medium	2,934	false	false	Minimum Operations to Maximize Last Elements in Arrays	minimum-operations-to-maximize-last-elements-in-arrays	['Array', 'Enumeration']	false	false
30.382075	Hard	2,935	false	false	Maximum Strong Pair XOR II	maximum-strong-pair-xor-ii	['Array', 'Hash Table', 'Bit Manipulation', 'Trie', 'Sliding Window']	false	false
62.559666	Medium	2,936	false	true	Number of Equal Numbers Blocks	number-of-equal-numbers-blocks	['Array', 'Binary Search', 'Interactive']	false	false
42.846862	Easy	2,937	false	false	Make Three Strings Equal	make-three-strings-equal	['String']	false	false
64.667792	Medium	2,938	false	false	Separate Black and White Balls	separate-black-and-white-balls	['Two Pointers', 'String', 'Greedy']	true	false
26.685223	Medium	2,939	false	false	Maximum Xor Product	maximum-xor-product	['Math', 'Greedy', 'Bit Manipulation']	false	false
52.431686	Hard	2,940	false	false	Find Building Where Alice and Bob Can Meet	find-building-where-alice-and-bob-can-meet	['Array', 'Binary Search', 'Stack', 'Binary Indexed Tree', 'Segment Tree', 'Heap (Priority Queue)', 'Monotonic Stack']	true	false
36.287509	Hard	2,941	false	true	Maximum GCD-Sum of a Subarray	maximum-gcd-sum-of-a-subarray	['Array', 'Math', 'Binary Search', 'Number Theory']	false	false
88.374271	Easy	2,942	false	false	Find Words Containing Character	find-words-containing-character	['Array', 'String']	false	false
36.63746	Medium	2,943	false	false	Maximize Area of Square Hole in Grid	maximize-area-of-square-hole-in-grid	['Array', 'Sorting']	false	false
46.361943	Medium	2,944	false	false	Minimum Number of Coins for Fruits	minimum-number-of-coins-for-fruits	['Array', 'Dynamic Programming', 'Queue', 'Heap (Priority Queue)', 'Monotonic Queue']	false	false
16.813165	Hard	2,945	false	false	Find Maximum Non-decreasing Array Length	find-maximum-non-decreasing-array-length	['Array', 'Binary Search', 'Dynamic Programming', 'Stack', 'Queue', 'Monotonic Stack', 'Monotonic Queue']	false	false
57.886439	Easy	2,946	false	false	Matrix Similarity After Cyclic Shifts	matrix-similarity-after-cyclic-shifts	['Array', 'Math', 'Matrix', 'Simulation']	false	false
59.272763	Medium	2,947	false	false	Count Beautiful Substrings I	count-beautiful-substrings-i	['Hash Table', 'Math', 'String', 'Enumeration', 'Number Theory', 'Prefix Sum']	false	false
60.249087	Medium	2,948	false	false	Make Lexicographically Smallest Array by Swapping Elements	make-lexicographically-smallest-array-by-swapping-elements	['Array', 'Union Find', 'Sorting']	true	false
24.511761	Hard	2,949	false	false	Count Beautiful Substrings II	count-beautiful-substrings-ii	['Hash Table', 'Math', 'String', 'Number Theory', 'Prefix Sum']	false	false
73.312153	Medium	2,950	false	true	Number of Divisible Substrings	number-of-divisible-substrings	['Hash Table', 'String', 'Counting', 'Prefix Sum']	false	false
73.93716	Easy	2,951	false	false	Find the Peaks	find-the-peaks	['Array', 'Enumeration']	false	false
56.395023	Medium	2,952	false	false	Minimum Number of Coins to be Added	minimum-number-of-coins-to-be-added	['Array', 'Greedy', 'Sorting']	false	false
28.165423	Hard	2,953	false	false	Count Complete Substrings	count-complete-substrings	['Hash Table', 'String', 'Sliding Window']	false	false
32.976051	Hard	2,954	false	false	Count the Number of Infection Sequences	count-the-number-of-infection-sequences	['Array', 'Math', 'Combinatorics']	false	false
61.33874	Medium	2,955	false	true	Number of Same-End Substrings	number-of-same-end-substrings	['Array', 'Hash Table', 'String', 'Counting', 'Prefix Sum']	true	false
83.380682	Easy	2,956	false	false	Find Common Elements Between Two Arrays	find-common-elements-between-two-arrays	['Array', 'Hash Table']	false	false
51.398983	Medium	2,957	false	false	Remove Adjacent Almost-Equal Characters	remove-adjacent-almost-equal-characters	['String', 'Dynamic Programming', 'Greedy']	false	false
55.615929	Medium	2,958	false	false	Length of Longest Subarray With at Most K Frequency	length-of-longest-subarray-with-at-most-k-frequency	['Array', 'Hash Table', 'Sliding Window']	true	false
47.85674	Hard	2,959	false	false	Number of Possible Sets of Closing Branches	number-of-possible-sets-of-closing-branches	['Bit Manipulation', 'Graph', 'Heap (Priority Queue)', 'Enumeration', 'Shortest Path']	false	false
78.333415	Easy	2,960	false	false	Count Tested Devices After Test Operations	count-tested-devices-after-test-operations	['Array', 'Simulation', 'Counting']	false	false
46.843033	Medium	2,961	false	false	Double Modular Exponentiation	double-modular-exponentiation	['Array', 'Math', 'Simulation']	false	false
58.442057	Medium	2,962	false	false	Count Subarrays Where Max Element Appears at Least K Times	count-subarrays-where-max-element-appears-at-least-k-times	['Array', 'Sliding Window']	true	false
46.22465	Hard	2,963	false	false	Count the Number of Good Partitions	count-the-number-of-good-partitions	['Array', 'Hash Table', 'Math', 'Combinatorics']	false	false
67.205692	Medium	2,964	false	true	Number of Divisible Triplet Sums	number-of-divisible-triplet-sums	['Array', 'Hash Table']	false	false
83.695929	Easy	2,965	false	false	Find Missing and Repeated Values	find-missing-and-repeated-values	['Array', 'Hash Table', 'Math', 'Matrix']	true	false
71.651849	Medium	2,966	false	false	Divide Array Into Arrays With Max Difference	divide-array-into-arrays-with-max-difference	['Array', 'Greedy', 'Sorting']	true	false
22.307621	Medium	2,967	false	false	Minimum Cost to Make Array Equalindromic	minimum-cost-to-make-array-equalindromic	['Array', 'Math', 'Binary Search', 'Greedy', 'Sorting']	false	false
36.008717	Hard	2,968	false	false	Apply Operations to Maximize Frequency Score	apply-operations-to-maximize-frequency-score	['Array', 'Binary Search', 'Sliding Window', 'Sorting', 'Prefix Sum']	false	false
45.028902	Hard	2,969	false	true	Minimum Number of Coins for Fruits II	minimum-number-of-coins-for-fruits-ii	['Array', 'Dynamic Programming', 'Queue', 'Heap (Priority Queue)', 'Monotonic Queue']	false	false
54.267304	Easy	2,970	false	false	Count the Number of Incremovable Subarrays I	count-the-number-of-incremovable-subarrays-i	['Array', 'Two Pointers', 'Binary Search', 'Enumeration']	false	false
65.315676	Medium	2,971	false	false	Find Polygon With the Largest Perimeter	find-polygon-with-the-largest-perimeter	['Array', 'Greedy', 'Sorting', 'Prefix Sum']	true	false
38.644807	Hard	2,972	false	false	Count the Number of Incremovable Subarrays II	count-the-number-of-incremovable-subarrays-ii	['Array', 'Two Pointers', 'Binary Search']	false	false
35.839741	Hard	2,973	false	false	Find Number of Coins to Place in Tree Nodes	find-number-of-coins-to-place-in-tree-nodes	['Dynamic Programming', 'Tree', 'Depth-First Search', 'Sorting', 'Heap (Priority Queue)']	false	false
84.711298	Easy	2,974	false	false	Minimum Number Game	minimum-number-game	['Array', 'Sorting', 'Heap (Priority Queue)', 'Simulation']	false	false
23.829337	Medium	2,975	false	false	Maximum Square Area by Removing Fences From a Field	maximum-square-area-by-removing-fences-from-a-field	['Array', 'Hash Table', 'Enumeration']	false	false
57.714354	Medium	2,976	false	false	Minimum Cost to Convert String I	minimum-cost-to-convert-string-i	['Array', 'String', 'Graph', 'Shortest Path']	true	false
25.285846	Hard	2,977	false	false	Minimum Cost to Convert String II	minimum-cost-to-convert-string-ii	['Array', 'String', 'Dynamic Programming', 'Graph', 'Trie', 'Shortest Path']	false	false
40.727678	Medium	2,978	false	true	Symmetric Coordinates	symmetric-coordinates	['Database']	false	false
80.242441	Medium	2,979	false	true	Most Expensive Item That Can Not Be Bought	most-expensive-item-that-can-not-be-bought	['Math', 'Dynamic Programming', 'Number Theory']	false	false
69.453495	Easy	2,980	false	false	Check if Bitwise OR Has Trailing Zeros	check-if-bitwise-or-has-trailing-zeros	['Array', 'Bit Manipulation']	false	false
61.863103	Medium	2,981	false	false	Find Longest Special Substring That Occurs Thrice I	find-longest-special-substring-that-occurs-thrice-i	['Hash Table', 'String', 'Binary Search', 'Sliding Window', 'Counting']	true	false
38.160685	Medium	2,982	false	false	Find Longest Special Substring That Occurs Thrice II	find-longest-special-substring-that-occurs-thrice-ii	['Hash Table', 'String', 'Binary Search', 'Sliding Window', 'Counting']	true	false
22.866637	Hard	2,983	false	false	Palindrome Rearrangement Queries	palindrome-rearrangement-queries	['Hash Table', 'String', 'Prefix Sum']	false	false
61.969935	Medium	2,984	false	true	Find Peak Calling Hours for Each City	find-peak-calling-hours-for-each-city	['Database']	false	false
88.263421	Easy	2,985	false	true	Calculate Compressed Mean	calculate-compressed-mean	['Database']	false	false
53.644728	Medium	2,986	false	true	Find Third Transaction	find-third-transaction	['Database']	false	false
79.96936	Easy	2,987	false	true	Find Expensive Cities	find-expensive-cities	['Database']	false	false
80.781598	Medium	2,988	false	true	Manager of the Largest Department	manager-of-the-largest-department	['Database']	false	false
89.42428	Medium	2,989	false	true	Class Performance	class-performance	['Database']	false	false
63.662875	Easy	2,990	false	true	Loan Types	loan-types	['Database']	false	false
57.071713	Hard	2,991	false	true	Top Three Wineries	top-three-wineries	['Database']	false	false
71.89277	Medium	2,992	false	true	Number of Self-Divisible Permutations	number-of-self-divisible-permutations	['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']	false	false
80.913904	Medium	2,993	false	true	Friday Purchases I	friday-purchases-i	['Database']	false	false
76.484947	Hard	2,994	false	true	Friday Purchases II	friday-purchases-ii	['Database']	false	false
43.204391	Hard	2,995	false	true	Viewers Turned Streamers	viewers-turned-streamers	['Database']	false	false
33.344903	Easy	2,996	false	false	Smallest Missing Integer Greater Than Sequential Prefix Sum	smallest-missing-integer-greater-than-sequential-prefix-sum	['Array', 'Hash Table', 'Sorting']	false	false
85.735057	Medium	2,997	false	false	Minimum Number of Operations to Make Array XOR Equal to K	minimum-number-of-operations-to-make-array-xor-equal-to-k	['Array', 'Bit Manipulation']	true	false
46.98755	Medium	2,998	false	false	Minimum Number of Operations to Make X and Y Equal	minimum-number-of-operations-to-make-x-and-y-equal	['Dynamic Programming', 'Breadth-First Search', 'Memoization']	false	false
25.592518	Hard	2,999	false	false	Count the Number of Powerful Integers	count-the-number-of-powerful-integers	['Math', 'String', 'Dynamic Programming']	true	false
36.289112	Easy	3,000	false	false	Maximum Area of Longest Diagonal Rectangle	maximum-area-of-longest-diagonal-rectangle	['Array']	false	false

27.750881

Medium

2,901

false

Longest Unequal Adjacent Groups Subsequence II

longest-unequal-adjacent-groups-subsequence-ii

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

false

20.232118

Hard

2,902

false

Count of Sub-Multisets With Bounded Sum

count-of-sub-multisets-with-bounded-sum

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

false

60.308862

Easy

2,903

false

Find Indices With Index and Value Difference I

find-indices-with-index-and-value-difference-i

['Array', 'Two Pointers']

false

39.570041

Medium

2,904

false

Shortest and Lexicographically Smallest Beautiful String

shortest-and-lexicographically-smallest-beautiful-string

['String', 'Sliding Window']

false

31.607625

Medium

2,905

false

Find Indices With Index and Value Difference II

find-indices-with-index-and-value-difference-ii

['Array', 'Two Pointers']

false

30.678556

Medium

2,906

false

Construct Product Matrix

construct-product-matrix

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

false

54.577341

Medium

2,907

false

true

Maximum Profitable Triplets With Increasing Prices I

maximum-profitable-triplets-with-increasing-prices-i

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

false

65.610082

Easy

2,908

false

Minimum Sum of Mountain Triplets I

minimum-sum-of-mountain-triplets-i

['Array']

false

53.404106

Medium

2,909

false

Minimum Sum of Mountain Triplets II

minimum-sum-of-mountain-triplets-ii

['Array']

false

23.899469

Medium

2,910

false

Minimum Number of Groups to Create a Valid Assignment

minimum-number-of-groups-to-create-a-valid-assignment

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

false

34.549224

Hard

2,911

false

Minimum Changes to Make K Semi-palindromes

minimum-changes-to-make-k-semi-palindromes

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

false

58.595506

Hard

2,912

false

true

Number of Ways to Reach Destination in the Grid

number-of-ways-to-reach-destination-in-the-grid

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

false

79.356493

Easy

2,913

false

Subarrays Distinct Element Sum of Squares I

subarrays-distinct-element-sum-of-squares-i

['Array', 'Hash Table']

false

76.492168

Medium

2,914

false

Minimum Number of Changes to Make Binary String Beautiful

minimum-number-of-changes-to-make-binary-string-beautiful

['String']

true

false

36.788998

Medium

2,915

false

Length of the Longest Subsequence That Sums to Target

length-of-the-longest-subsequence-that-sums-to-target

['Array', 'Dynamic Programming']

false

20.43464

Hard

2,916

false

Subarrays Distinct Element Sum of Squares II

subarrays-distinct-element-sum-of-squares-ii

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

false

71.981874

Easy

2,917

false

Find the K-or of an Array

find-the-k-or-of-an-array

['Array', 'Bit Manipulation']

false

36.498597

Medium

2,918

false

Minimum Equal Sum of Two Arrays After Replacing Zeros

minimum-equal-sum-of-two-arrays-after-replacing-zeros

['Array', 'Greedy']

false

33.682316

Medium

2,919

false

Minimum Increment Operations to Make Array Beautiful

minimum-increment-operations-to-make-array-beautiful

['Array', 'Dynamic Programming']

false

35.419393

Hard

2,920

false

Maximum Points After Collecting Coins From All Nodes

maximum-points-after-collecting-coins-from-all-nodes

['Array', 'Dynamic Programming', 'Bit Manipulation', 'Tree', 'Depth-First Search', 'Memoization']

false

45.905334

Hard

2,921

false

true

Maximum Profitable Triplets With Increasing Prices II

maximum-profitable-triplets-with-increasing-prices-ii

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

false

41.455331

Medium

2,922

false

true

Market Analysis III

market-analysis-iii

['Database']

false

72.179248

Easy

2,923

false

Find Champion I

find-champion-i

['Array', 'Matrix']

false

69.986362

Medium

2,924

false

Find Champion II

find-champion-ii

['Graph']

true

false

46.703507

Medium

2,925

false

Maximum Score After Applying Operations on a Tree

maximum-score-after-applying-operations-on-a-tree

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

false

24.622701

Hard

2,926

false

Maximum Balanced Subsequence Sum

maximum-balanced-subsequence-sum

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

false

43.761412

Hard

2,927

false

true

Distribute Candies Among Children III

distribute-candies-among-children-iii

['Math', 'Combinatorics']

false

72.986921

Easy

2,928

false

Distribute Candies Among Children I

distribute-candies-among-children-i

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

false

34.823169

Medium

2,929

false

Distribute Candies Among Children II

distribute-candies-among-children-ii

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

false

55.87945

Medium

2,930

false

Number of Strings Which Can Be Rearranged to Contain Substring

number-of-strings-which-can-be-rearranged-to-contain-substring

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

false

59.607879

Hard

2,931

false

Maximum Spending After Buying Items

maximum-spending-after-buying-items

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

false

74.547129

Easy

2,932

false

Maximum Strong Pair XOR I

maximum-strong-pair-xor-i

['Array', 'Hash Table', 'Bit Manipulation', 'Trie', 'Sliding Window']

false

45.622374

Medium

2,933

false

High-Access Employees

high-access-employees

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

false

42.990654

Medium

2,934

false

Minimum Operations to Maximize Last Elements in Arrays

minimum-operations-to-maximize-last-elements-in-arrays

['Array', 'Enumeration']

false

30.382075

Hard

2,935

false

Maximum Strong Pair XOR II

maximum-strong-pair-xor-ii

['Array', 'Hash Table', 'Bit Manipulation', 'Trie', 'Sliding Window']

false

62.559666

Medium

2,936

false

true

Number of Equal Numbers Blocks

number-of-equal-numbers-blocks

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

false

42.846862

Easy

2,937

false

Make Three Strings Equal

make-three-strings-equal

['String']

false

64.667792

Medium

2,938

false

Separate Black and White Balls

separate-black-and-white-balls

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

true

false

26.685223

Medium

2,939

false

Maximum Xor Product

maximum-xor-product

['Math', 'Greedy', 'Bit Manipulation']

false

52.431686

Hard

2,940

false

Find Building Where Alice and Bob Can Meet

find-building-where-alice-and-bob-can-meet

['Array', 'Binary Search', 'Stack', 'Binary Indexed Tree', 'Segment Tree', 'Heap (Priority Queue)', 'Monotonic Stack']

true

false

36.287509

Hard

2,941

false

true

Maximum GCD-Sum of a Subarray

maximum-gcd-sum-of-a-subarray

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

false

88.374271

Easy

2,942

false

Find Words Containing Character

find-words-containing-character

['Array', 'String']

false

36.63746

Medium

2,943

false

Maximize Area of Square Hole in Grid

maximize-area-of-square-hole-in-grid

['Array', 'Sorting']

false

46.361943

Medium

2,944

false

Minimum Number of Coins for Fruits

minimum-number-of-coins-for-fruits

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

false

16.813165

Hard

2,945

false

Find Maximum Non-decreasing Array Length

find-maximum-non-decreasing-array-length

['Array', 'Binary Search', 'Dynamic Programming', 'Stack', 'Queue', 'Monotonic Stack', 'Monotonic Queue']

false

57.886439

Easy

2,946

false

Matrix Similarity After Cyclic Shifts

matrix-similarity-after-cyclic-shifts

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

false

59.272763

Medium

2,947

false

Count Beautiful Substrings I

count-beautiful-substrings-i

['Hash Table', 'Math', 'String', 'Enumeration', 'Number Theory', 'Prefix Sum']

false

60.249087

Medium

2,948

false

Make Lexicographically Smallest Array by Swapping Elements

make-lexicographically-smallest-array-by-swapping-elements

['Array', 'Union Find', 'Sorting']

true

false

24.511761

Hard

2,949

false

Count Beautiful Substrings II

count-beautiful-substrings-ii

['Hash Table', 'Math', 'String', 'Number Theory', 'Prefix Sum']

false

73.312153

Medium

2,950

false

true

Number of Divisible Substrings

number-of-divisible-substrings

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

false

73.93716

Easy

2,951

false

Find the Peaks

find-the-peaks

['Array', 'Enumeration']

false

56.395023

Medium

2,952

false

Minimum Number of Coins to be Added

minimum-number-of-coins-to-be-added

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

false

28.165423

Hard

2,953

false

Count Complete Substrings

count-complete-substrings

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

false

32.976051

Hard

2,954

false

Count the Number of Infection Sequences

count-the-number-of-infection-sequences

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

false

61.33874

Medium

2,955

false

true

Number of Same-End Substrings

number-of-same-end-substrings

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

true

false

83.380682

Easy

2,956

false

Find Common Elements Between Two Arrays

find-common-elements-between-two-arrays

['Array', 'Hash Table']

false

51.398983

Medium

2,957

false

Remove Adjacent Almost-Equal Characters

remove-adjacent-almost-equal-characters

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

false

55.615929

Medium

2,958

false

Length of Longest Subarray With at Most K Frequency

length-of-longest-subarray-with-at-most-k-frequency

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

true

false

47.85674

Hard

2,959

false

Number of Possible Sets of Closing Branches

number-of-possible-sets-of-closing-branches

['Bit Manipulation', 'Graph', 'Heap (Priority Queue)', 'Enumeration', 'Shortest Path']

false

78.333415

Easy

2,960

false

Count Tested Devices After Test Operations

count-tested-devices-after-test-operations

['Array', 'Simulation', 'Counting']

false

46.843033

Medium

2,961

false

Double Modular Exponentiation

double-modular-exponentiation

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

false

58.442057

Medium

2,962

false

Count Subarrays Where Max Element Appears at Least K Times

count-subarrays-where-max-element-appears-at-least-k-times

['Array', 'Sliding Window']

true

false

46.22465

Hard

2,963

false

Count the Number of Good Partitions

count-the-number-of-good-partitions

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

false

67.205692

Medium

2,964

false

true

Number of Divisible Triplet Sums

number-of-divisible-triplet-sums

['Array', 'Hash Table']

false

83.695929

Easy

2,965

false

Find Missing and Repeated Values

find-missing-and-repeated-values

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

true

false

71.651849

Medium

2,966

false

Divide Array Into Arrays With Max Difference

divide-array-into-arrays-with-max-difference

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

true

false

22.307621

Medium

2,967

false

Minimum Cost to Make Array Equalindromic

minimum-cost-to-make-array-equalindromic

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

false

36.008717

Hard

2,968

false

Apply Operations to Maximize Frequency Score

apply-operations-to-maximize-frequency-score

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

false

45.028902

Hard

2,969

false

true

Minimum Number of Coins for Fruits II

minimum-number-of-coins-for-fruits-ii

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

false

54.267304

Easy

2,970

false

Count the Number of Incremovable Subarrays I

count-the-number-of-incremovable-subarrays-i

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

false

65.315676

Medium

2,971

false

Find Polygon With the Largest Perimeter

find-polygon-with-the-largest-perimeter

['Array', 'Greedy', 'Sorting', 'Prefix Sum']

true

false

38.644807

Hard

2,972

false

Count the Number of Incremovable Subarrays II

count-the-number-of-incremovable-subarrays-ii

['Array', 'Two Pointers', 'Binary Search']

false

35.839741

Hard

2,973

false

Find Number of Coins to Place in Tree Nodes

find-number-of-coins-to-place-in-tree-nodes

['Dynamic Programming', 'Tree', 'Depth-First Search', 'Sorting', 'Heap (Priority Queue)']

false

84.711298

Easy

2,974

false

Minimum Number Game

minimum-number-game

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

false

23.829337

Medium

2,975

false

Maximum Square Area by Removing Fences From a Field

maximum-square-area-by-removing-fences-from-a-field

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

false

57.714354

Medium

2,976

false

Minimum Cost to Convert String I

minimum-cost-to-convert-string-i

['Array', 'String', 'Graph', 'Shortest Path']

true

false

25.285846

Hard

2,977

false

Minimum Cost to Convert String II

minimum-cost-to-convert-string-ii

['Array', 'String', 'Dynamic Programming', 'Graph', 'Trie', 'Shortest Path']

false

40.727678

Medium

2,978

false

true

Symmetric Coordinates

symmetric-coordinates

['Database']

false

80.242441

Medium

2,979

false

true

Most Expensive Item That Can Not Be Bought

most-expensive-item-that-can-not-be-bought

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

false

69.453495

Easy

2,980

false

Check if Bitwise OR Has Trailing Zeros

check-if-bitwise-or-has-trailing-zeros

['Array', 'Bit Manipulation']

false

61.863103

Medium

2,981

false

Find Longest Special Substring That Occurs Thrice I

find-longest-special-substring-that-occurs-thrice-i

['Hash Table', 'String', 'Binary Search', 'Sliding Window', 'Counting']

true

false

38.160685

Medium

2,982

false

Find Longest Special Substring That Occurs Thrice II

find-longest-special-substring-that-occurs-thrice-ii

['Hash Table', 'String', 'Binary Search', 'Sliding Window', 'Counting']

true

false

22.866637

Hard

2,983

false

Palindrome Rearrangement Queries

palindrome-rearrangement-queries

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

false

61.969935

Medium

2,984

false

true

Find Peak Calling Hours for Each City

find-peak-calling-hours-for-each-city

['Database']

false

88.263421

Easy

2,985

false

true

Calculate Compressed Mean

calculate-compressed-mean

['Database']

false

53.644728

Medium

2,986

false

true

Find Third Transaction

find-third-transaction

['Database']

false

79.96936

Easy

2,987

false

true

Find Expensive Cities

find-expensive-cities

['Database']

false

80.781598

Medium

2,988

false

true

Manager of the Largest Department

manager-of-the-largest-department

['Database']

false

89.42428

Medium

2,989

false

true

Class Performance

class-performance

['Database']

false

63.662875

Easy

2,990

false

true

Loan Types

loan-types

['Database']

false

57.071713

Hard

2,991

false

true

Top Three Wineries

top-three-wineries

['Database']

false

71.89277

Medium

2,992

false

true

Number of Self-Divisible Permutations

number-of-self-divisible-permutations

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

false

80.913904

Medium

2,993

false

true

Friday Purchases I

friday-purchases-i

['Database']

false

76.484947

Hard

2,994

false

true

Friday Purchases II

friday-purchases-ii

['Database']

false

43.204391

Hard

2,995

false

true

Viewers Turned Streamers

viewers-turned-streamers

['Database']

false

33.344903

Easy

2,996

false

Smallest Missing Integer Greater Than Sequential Prefix Sum

smallest-missing-integer-greater-than-sequential-prefix-sum

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

false

85.735057

Medium

2,997

false

Minimum Number of Operations to Make Array XOR Equal to K

minimum-number-of-operations-to-make-array-xor-equal-to-k

['Array', 'Bit Manipulation']

true

false

46.98755

Medium

2,998

false

Minimum Number of Operations to Make X and Y Equal

minimum-number-of-operations-to-make-x-and-y-equal

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

false

25.592518

Hard

2,999

false

Count the Number of Powerful Integers

count-the-number-of-powerful-integers

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

true

false

36.289112

Easy

3,000

false

Maximum Area of Longest Diagonal Rectangle

maximum-area-of-longest-diagonal-rectangle

['Array']

false