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
25.587035	Hard	2,801	false	false	Count Stepping Numbers in Range	count-stepping-numbers-in-range	['String', 'Dynamic Programming']	false	false
75.997966	Medium	2,802	false	true	Find The K-th Lucky Number	find-the-k-th-lucky-number	['Math', 'String', 'Bit Manipulation']	true	false
87.206823	Easy	2,803	false	true	Factorial Generator	factorial-generator	[]	true	false
89.246525	Easy	2,804	false	true	Array Prototype ForEach	array-prototype-foreach	[]	true	false
82.758621	Medium	2,805	false	true	Custom Interval	custom-interval	[]	true	false
54.777476	Easy	2,806	false	false	Account Balance After Rounded Purchase	account-balance-after-rounded-purchase	['Math']	false	false
91.533737	Medium	2,807	false	false	Insert Greatest Common Divisors in Linked List	insert-greatest-common-divisors-in-linked-list	['Linked List', 'Math', 'Number Theory']	true	false
27.20899	Medium	2,808	false	false	Minimum Seconds to Equalize a Circular Array	minimum-seconds-to-equalize-a-circular-array	['Array', 'Hash Table']	false	false
24.951162	Hard	2,809	false	false	Minimum Time to Make Array Sum At Most x	minimum-time-to-make-array-sum-at-most-x	['Array', 'Dynamic Programming', 'Sorting']	false	false
82.678968	Easy	2,810	false	false	Faulty Keyboard	faulty-keyboard	['String', 'Simulation']	false	false
33.797815	Medium	2,811	false	false	Check if it is Possible to Split Array	check-if-it-is-possible-to-split-array	['Array', 'Dynamic Programming', 'Greedy']	false	false
48.32409	Medium	2,812	false	false	Find the Safest Path in a Grid	find-the-safest-path-in-a-grid	['Array', 'Binary Search', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix']	true	false
29.404052	Hard	2,813	false	false	Maximum Elegance of a K-Length Subsequence	maximum-elegance-of-a-k-length-subsequence	['Array', 'Hash Table', 'Stack', 'Greedy', 'Sorting', 'Heap (Priority Queue)']	false	false
55.178416	Hard	2,814	false	true	Minimum Time Takes to Reach Destination Without Drowning	minimum-time-takes-to-reach-destination-without-drowning	['Array', 'Breadth-First Search', 'Matrix']	false	false
58.79517	Easy	2,815	false	false	Max Pair Sum in an Array	max-pair-sum-in-an-array	['Array', 'Hash Table']	false	false
61.208405	Medium	2,816	false	false	Double a Number Represented as a Linked List	double-a-number-represented-as-a-linked-list	['Linked List', 'Math', 'Stack']	true	false
33.696006	Medium	2,817	false	false	Minimum Absolute Difference Between Elements With Constraint	minimum-absolute-difference-between-elements-with-constraint	['Array', 'Binary Search', 'Ordered Set']	false	false
54.505993	Hard	2,818	false	false	Apply Operations to Maximize Score	apply-operations-to-maximize-score	['Array', 'Math', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack', 'Number Theory']	true	false
41.886151	Hard	2,819	false	true	Minimum Relative Loss After Buying Chocolates	minimum-relative-loss-after-buying-chocolates	['Array', 'Binary Search', 'Sorting', 'Prefix Sum']	false	false
68.395428	Medium	2,820	false	true	Election Results	election-results	[]	false	false
71.300448	Medium	2,821	false	true	Delay the Resolution of Each Promise	delay-the-resolution-of-each-promise	[]	true	false
59.449244	Easy	2,822	false	true	Inversion of Object	inversion-of-object	[]	false	false
55.347871	Medium	2,823	false	true	Deep Object Filter	deep-object-filter	[]	true	false
87.376957	Easy	2,824	false	false	Count Pairs Whose Sum is Less than Target	count-pairs-whose-sum-is-less-than-target	['Array', 'Two Pointers', 'Binary Search', 'Sorting']	false	false
65.661494	Medium	2,825	false	false	Make String a Subsequence Using Cyclic Increments	make-string-a-subsequence-using-cyclic-increments	['Two Pointers', 'String']	true	false
41.597078	Medium	2,826	false	false	Sorting Three Groups	sorting-three-groups	['Array', 'Binary Search', 'Dynamic Programming']	false	false
19.05687	Hard	2,827	false	false	Number of Beautiful Integers in the Range	number-of-beautiful-integers-in-the-range	['Math', 'Dynamic Programming']	false	false
82.510838	Easy	2,828	false	false	Check if a String Is an Acronym of Words	check-if-a-string-is-an-acronym-of-words	['Array', 'String']	false	false
59.704429	Medium	2,829	false	false	Determine the Minimum Sum of a k-avoiding Array	determine-the-minimum-sum-of-a-k-avoiding-array	['Math', 'Greedy']	false	false
36.771761	Medium	2,830	false	false	Maximize the Profit as the Salesman	maximize-the-profit-as-the-salesman	['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Sorting']	false	false
35.801519	Medium	2,831	false	false	Find the Longest Equal Subarray	find-the-longest-equal-subarray	['Array', 'Hash Table', 'Binary Search', 'Sliding Window']	false	false
75.309746	Medium	2,832	false	true	Maximal Range That Each Element Is Maximum in It	maximal-range-that-each-element-is-maximum-in-it	['Array', 'Stack', 'Monotonic Stack']	true	false
64.145535	Easy	2,833	false	false	Furthest Point From Origin	furthest-point-from-origin	['String', 'Counting']	false	false
36.087713	Medium	2,834	false	false	Find the Minimum Possible Sum of a Beautiful Array	find-the-minimum-possible-sum-of-a-beautiful-array	['Math', 'Greedy']	false	false
31.133446	Hard	2,835	false	false	Minimum Operations to Form Subsequence With Target Sum	minimum-operations-to-form-subsequence-with-target-sum	['Array', 'Greedy', 'Bit Manipulation']	false	false
28.129655	Hard	2,836	false	false	Maximize Value of Function in a Ball Passing Game	maximize-value-of-function-in-a-ball-passing-game	['Array', 'Dynamic Programming', 'Bit Manipulation']	false	false
77.358491	Easy	2,837	false	true	Total Traveled Distance	total-traveled-distance	['Database']	true	false
68.530962	Medium	2,838	false	true	Maximum Coins Heroes Can Collect	maximum-coins-heroes-can-collect	['Array', 'Two Pointers', 'Binary Search', 'Sorting', 'Prefix Sum']	true	false
46.917595	Easy	2,839	false	false	Check if Strings Can be Made Equal With Operations I	check-if-strings-can-be-made-equal-with-operations-i	['String']	false	false
54.982883	Medium	2,840	false	false	Check if Strings Can be Made Equal With Operations II	check-if-strings-can-be-made-equal-with-operations-ii	['Hash Table', 'String', 'Sorting']	false	false
38.921172	Medium	2,841	false	false	Maximum Sum of Almost Unique Subarray	maximum-sum-of-almost-unique-subarray	['Array', 'Hash Table', 'Sliding Window']	false	false
29.401757	Hard	2,842	false	false	Count K-Subsequences of a String With Maximum Beauty	count-k-subsequences-of-a-string-with-maximum-beauty	['Hash Table', 'Math', 'String', 'Greedy', 'Combinatorics']	false	false
73.856494	Easy	2,843	false	false	Count Symmetric Integers	count-symmetric-integers	['Math', 'Enumeration']	true	false
37.893969	Medium	2,844	false	false	Minimum Operations to Make a Special Number	minimum-operations-to-make-a-special-number	['Math', 'String', 'Greedy', 'Enumeration']	false	false
35.494309	Medium	2,845	false	false	Count of Interesting Subarrays	count-of-interesting-subarrays	['Array', 'Hash Table', 'Prefix Sum']	false	false
41.941884	Hard	2,846	false	false	Minimum Edge Weight Equilibrium Queries in a Tree	minimum-edge-weight-equilibrium-queries-in-a-tree	['Array', 'Tree', 'Graph', 'Strongly Connected Component']	false	false
43.446244	Medium	2,847	false	true	Smallest Number With Given Digit Product	smallest-number-with-given-digit-product	['Math', 'Greedy']	false	false
72.696402	Easy	2,848	false	false	Points That Intersect With Cars	points-that-intersect-with-cars	['Array', 'Hash Table', 'Prefix Sum']	false	false
35.739481	Medium	2,849	false	false	Determine if a Cell Is Reachable at a Given Time	determine-if-a-cell-is-reachable-at-a-given-time	['Math']	true	false
44.065612	Medium	2,850	false	false	Minimum Moves to Spread Stones Over Grid	minimum-moves-to-spread-stones-over-grid	['Array', 'Dynamic Programming', 'Breadth-First Search', 'Matrix']	false	false
28.790167	Hard	2,851	false	false	String Transformation	string-transformation	['Math', 'String', 'Dynamic Programming', 'String Matching']	false	false
70.753945	Medium	2,852	false	true	Sum of Remoteness of All Cells	sum-of-remoteness-of-all-cells	['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']	true	false
74.060586	Easy	2,853	false	true	Highest Salaries Difference	highest-salaries-difference	['Database']	false	false
70.209845	Medium	2,854	false	true	Rolling Average Steps	rolling-average-steps	['Database']	false	false
56.429243	Easy	2,855	false	false	Minimum Right Shifts to Sort the Array	minimum-right-shifts-to-sort-the-array	['Array']	false	false
24.559637	Medium	2,856	false	false	Minimum Array Length After Pair Removals	minimum-array-length-after-pair-removals	['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Greedy', 'Counting']	false	false
31.914277	Medium	2,857	false	false	Count Pairs of Points With Distance k	count-pairs-of-points-with-distance-k	['Array', 'Hash Table', 'Bit Manipulation']	false	false
55.264266	Hard	2,858	false	false	Minimum Edge Reversals So Every Node Is Reachable	minimum-edge-reversals-so-every-node-is-reachable	['Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Graph']	false	false
85.597378	Easy	2,859	false	false	Sum of Values at Indices With K Set Bits	sum-of-values-at-indices-with-k-set-bits	['Array', 'Bit Manipulation']	false	false
50.013835	Medium	2,860	false	false	Happy Students	happy-students	['Array', 'Sorting', 'Enumeration']	false	false
38.517952	Medium	2,861	false	false	Maximum Number of Alloys	maximum-number-of-alloys	['Array', 'Binary Search']	false	false
41.270073	Hard	2,862	false	false	Maximum Element-Sum of a Complete Subset of Indices	maximum-element-sum-of-a-complete-subset-of-indices	['Array', 'Math', 'Number Theory']	false	false
70.071575	Medium	2,863	false	true	Maximum Length of Semi-Decreasing Subarrays	maximum-length-of-semi-decreasing-subarrays	['Array', 'Stack', 'Sorting', 'Monotonic Stack']	false	false
82.645776	Easy	2,864	false	false	Maximum Odd Binary Number	maximum-odd-binary-number	['Math', 'String', 'Greedy']	true	false
43.166409	Medium	2,865	false	false	Beautiful Towers I	beautiful-towers-i	['Array', 'Stack', 'Monotonic Stack']	false	false
34.154377	Medium	2,866	false	false	Beautiful Towers II	beautiful-towers-ii	['Array', 'Stack', 'Monotonic Stack']	false	false
34.245518	Hard	2,867	false	false	Count Valid Paths in a Tree	count-valid-paths-in-a-tree	['Math', 'Dynamic Programming', 'Tree', 'Depth-First Search', 'Number Theory']	false	false
53.497164	Hard	2,868	false	true	The Wording Game	the-wording-game	['Array', 'Math', 'Two Pointers', 'String', 'Greedy', 'Game Theory']	false	false
60.520105	Easy	2,869	false	false	Minimum Operations to Collect Elements	minimum-operations-to-collect-elements	['Array', 'Hash Table', 'Bit Manipulation']	false	false
61.790156	Medium	2,870	false	false	Minimum Number of Operations to Make Array Empty	minimum-number-of-operations-to-make-array-empty	['Array', 'Hash Table', 'Greedy', 'Counting']	true	false
41.400445	Medium	2,871	false	false	Split Array Into Maximum Number of Subarrays	split-array-into-maximum-number-of-subarrays	['Array', 'Greedy', 'Bit Manipulation']	false	false
69.783429	Hard	2,872	false	false	Maximum Number of K-Divisible Components	maximum-number-of-k-divisible-components	['Tree', 'Depth-First Search']	true	false
58.338917	Easy	2,873	false	false	Maximum Value of an Ordered Triplet I	maximum-value-of-an-ordered-triplet-i	['Array']	true	false
56.858747	Medium	2,874	false	false	Maximum Value of an Ordered Triplet II	maximum-value-of-an-ordered-triplet-ii	['Array']	true	false
30.941482	Medium	2,875	false	false	Minimum Size Subarray in Infinite Array	minimum-size-subarray-in-infinite-array	['Array', 'Hash Table', 'Sliding Window', 'Prefix Sum']	false	false
31.554573	Hard	2,876	false	false	Count Visited Nodes in a Directed Graph	count-visited-nodes-in-a-directed-graph	['Dynamic Programming', 'Graph', 'Memoization']	false	false
81.472752	Easy	2,877	false	false	Create a DataFrame from List	create-a-dataframe-from-list	[]	true	false
85.172315	Easy	2,878	false	false	Get the Size of a DataFrame	get-the-size-of-a-dataframe	[]	true	false
93.074498	Easy	2,879	false	false	Display the First Three Rows	display-the-first-three-rows	[]	true	false
79.28977	Easy	2,880	false	false	Select Data	select-data	[]	true	false
90.261647	Easy	2,881	false	false	Create a New Column	create-a-new-column	[]	true	false
85.597902	Easy	2,882	false	false	Drop Duplicate Rows	drop-duplicate-rows	[]	true	false
64.313432	Easy	2,883	false	false	Drop Missing Data	drop-missing-data	[]	true	false
92.507623	Easy	2,884	false	false	Modify Columns	modify-columns	[]	true	false
85.594038	Easy	2,885	false	false	Rename Columns	rename-columns	[]	true	false
87.4883	Easy	2,886	false	false	Change Data Type	change-data-type	[]	true	false
72.275505	Easy	2,887	false	false	Fill Missing Data	fill-missing-data	[]	true	false
90.737046	Easy	2,888	false	false	Reshape Data: Concatenate	reshape-data-concatenate	[]	true	false
83.557667	Easy	2,889	false	false	Reshape Data: Pivot	reshape-data-pivot	[]	true	false
86.14745	Easy	2,890	false	false	Reshape Data: Melt	reshape-data-melt	[]	true	false
76.63526	Easy	2,891	false	false	Method Chaining	method-chaining	[]	true	false
39.229221	Medium	2,892	false	true	Minimizing Array After Replacing Pairs With Their Product	minimizing-array-after-replacing-pairs-with-their-product	['Array', 'Dynamic Programming', 'Greedy']	false	false
68.141012	Medium	2,893	false	true	Calculate Orders Within Each Interval	calculate-orders-within-each-interval	['Database']	false	false
88.284384	Easy	2,894	false	false	Divisible and Non-divisible Sums Difference	divisible-and-non-divisible-sums-difference	['Math']	false	false
68.853385	Medium	2,895	false	false	Minimum Processing Time	minimum-processing-time	['Array', 'Greedy', 'Sorting']	false	false
27.036648	Medium	2,896	false	false	Apply Operations to Make Two Strings Equal	apply-operations-to-make-two-strings-equal	['String', 'Dynamic Programming']	false	false
42.99869	Hard	2,897	false	false	Apply Operations on Array to Maximize Sum of Squares	apply-operations-on-array-to-maximize-sum-of-squares	['Array', 'Hash Table', 'Greedy', 'Bit Manipulation']	false	false
58.618754	Medium	2,898	false	true	Maximum Linear Stock Score	maximum-linear-stock-score	['Array', 'Hash Table']	false	false
63.370346	Easy	2,899	false	false	Last Visited Integers	last-visited-integers	['Array', 'Simulation']	false	false
59.662363	Easy	2,900	false	false	Longest Unequal Adjacent Groups Subsequence I	longest-unequal-adjacent-groups-subsequence-i	['Array', 'String', 'Dynamic Programming', 'Greedy']	false	false

25.587035

Hard

2,801

false

Count Stepping Numbers in Range

count-stepping-numbers-in-range

['String', 'Dynamic Programming']

false

75.997966

Medium

2,802

false

true

Find The K-th Lucky Number

find-the-k-th-lucky-number

['Math', 'String', 'Bit Manipulation']

true

false

87.206823

Easy

2,803

false

true

Factorial Generator

factorial-generator

[]

true

false

89.246525

Easy

2,804

false

true

Array Prototype ForEach

array-prototype-foreach

[]

true

false

82.758621

Medium

2,805

false

true

Custom Interval

custom-interval

[]

true

false

54.777476

Easy

2,806

false

Account Balance After Rounded Purchase

account-balance-after-rounded-purchase

['Math']

false

91.533737

Medium

2,807

false

Insert Greatest Common Divisors in Linked List

insert-greatest-common-divisors-in-linked-list

['Linked List', 'Math', 'Number Theory']

true

false

27.20899

Medium

2,808

false

Minimum Seconds to Equalize a Circular Array

minimum-seconds-to-equalize-a-circular-array

['Array', 'Hash Table']

false

24.951162

Hard

2,809

false

Minimum Time to Make Array Sum At Most x

minimum-time-to-make-array-sum-at-most-x

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

false

82.678968

Easy

2,810

false

Faulty Keyboard

faulty-keyboard

['String', 'Simulation']

false

33.797815

Medium

2,811

false

Check if it is Possible to Split Array

check-if-it-is-possible-to-split-array

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

false

48.32409

Medium

2,812

false

Find the Safest Path in a Grid

find-the-safest-path-in-a-grid

['Array', 'Binary Search', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix']

true

false

29.404052

Hard

2,813

false

Maximum Elegance of a K-Length Subsequence

maximum-elegance-of-a-k-length-subsequence

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

false

55.178416

Hard

2,814

false

true

Minimum Time Takes to Reach Destination Without Drowning

minimum-time-takes-to-reach-destination-without-drowning

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

false

58.79517

Easy

2,815

false

Max Pair Sum in an Array

max-pair-sum-in-an-array

['Array', 'Hash Table']

false

61.208405

Medium

2,816

false

Double a Number Represented as a Linked List

double-a-number-represented-as-a-linked-list

['Linked List', 'Math', 'Stack']

true

false

33.696006

Medium

2,817

false

Minimum Absolute Difference Between Elements With Constraint

minimum-absolute-difference-between-elements-with-constraint

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

false

54.505993

Hard

2,818

false

Apply Operations to Maximize Score

apply-operations-to-maximize-score

['Array', 'Math', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack', 'Number Theory']

true

false

41.886151

Hard

2,819

false

true

Minimum Relative Loss After Buying Chocolates

minimum-relative-loss-after-buying-chocolates

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

false

68.395428

Medium

2,820

false

true

Election Results

election-results

[]

false

71.300448

Medium

2,821

false

true

Delay the Resolution of Each Promise

delay-the-resolution-of-each-promise

[]

true

false

59.449244

Easy

2,822

false

true

Inversion of Object

inversion-of-object

[]

false

55.347871

Medium

2,823

false

true

Deep Object Filter

deep-object-filter

[]

true

false

87.376957

Easy

2,824

false

Count Pairs Whose Sum is Less than Target

count-pairs-whose-sum-is-less-than-target

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

false

65.661494

Medium

2,825

false

Make String a Subsequence Using Cyclic Increments

make-string-a-subsequence-using-cyclic-increments

['Two Pointers', 'String']

true

false

41.597078

Medium

2,826

false

Sorting Three Groups

sorting-three-groups

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

false

19.05687

Hard

2,827

false

Number of Beautiful Integers in the Range

number-of-beautiful-integers-in-the-range

['Math', 'Dynamic Programming']

false

82.510838

Easy

2,828

false

Check if a String Is an Acronym of Words

check-if-a-string-is-an-acronym-of-words

['Array', 'String']

false

59.704429

Medium

2,829

false

Determine the Minimum Sum of a k-avoiding Array

determine-the-minimum-sum-of-a-k-avoiding-array

['Math', 'Greedy']

false

36.771761

Medium

2,830

false

Maximize the Profit as the Salesman

maximize-the-profit-as-the-salesman

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

false

35.801519

Medium

2,831

false

Find the Longest Equal Subarray

find-the-longest-equal-subarray

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

false

75.309746

Medium

2,832

false

true

Maximal Range That Each Element Is Maximum in It

maximal-range-that-each-element-is-maximum-in-it

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

true

false

64.145535

Easy

2,833

false

Furthest Point From Origin

furthest-point-from-origin

['String', 'Counting']

false

36.087713

Medium

2,834

false

Find the Minimum Possible Sum of a Beautiful Array

find-the-minimum-possible-sum-of-a-beautiful-array

['Math', 'Greedy']

false

31.133446

Hard

2,835

false

Minimum Operations to Form Subsequence With Target Sum

minimum-operations-to-form-subsequence-with-target-sum

['Array', 'Greedy', 'Bit Manipulation']

false

28.129655

Hard

2,836

false

Maximize Value of Function in a Ball Passing Game

maximize-value-of-function-in-a-ball-passing-game

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

false

77.358491

Easy

2,837

false

true

Total Traveled Distance

total-traveled-distance

['Database']

true

false

68.530962

Medium

2,838

false

true

Maximum Coins Heroes Can Collect

maximum-coins-heroes-can-collect

['Array', 'Two Pointers', 'Binary Search', 'Sorting', 'Prefix Sum']

true

false

46.917595

Easy

2,839

false

Check if Strings Can be Made Equal With Operations I

check-if-strings-can-be-made-equal-with-operations-i

['String']

false

54.982883

Medium

2,840

false

Check if Strings Can be Made Equal With Operations II

check-if-strings-can-be-made-equal-with-operations-ii

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

false

38.921172

Medium

2,841

false

Maximum Sum of Almost Unique Subarray

maximum-sum-of-almost-unique-subarray

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

false

29.401757

Hard

2,842

false

Count K-Subsequences of a String With Maximum Beauty

count-k-subsequences-of-a-string-with-maximum-beauty

['Hash Table', 'Math', 'String', 'Greedy', 'Combinatorics']

false

73.856494

Easy

2,843

false

Count Symmetric Integers

count-symmetric-integers

['Math', 'Enumeration']

true

false

37.893969

Medium

2,844

false

Minimum Operations to Make a Special Number

minimum-operations-to-make-a-special-number

['Math', 'String', 'Greedy', 'Enumeration']

false

35.494309

Medium

2,845

false

Count of Interesting Subarrays

count-of-interesting-subarrays

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

false

41.941884

Hard

2,846

false

Minimum Edge Weight Equilibrium Queries in a Tree

minimum-edge-weight-equilibrium-queries-in-a-tree

['Array', 'Tree', 'Graph', 'Strongly Connected Component']

false

43.446244

Medium

2,847

false

true

Smallest Number With Given Digit Product

smallest-number-with-given-digit-product

['Math', 'Greedy']

false

72.696402

Easy

2,848

false

Points That Intersect With Cars

points-that-intersect-with-cars

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

false

35.739481

Medium

2,849

false

Determine if a Cell Is Reachable at a Given Time

determine-if-a-cell-is-reachable-at-a-given-time

['Math']

true

false

44.065612

Medium

2,850

false

Minimum Moves to Spread Stones Over Grid

minimum-moves-to-spread-stones-over-grid

['Array', 'Dynamic Programming', 'Breadth-First Search', 'Matrix']

false

28.790167

Hard

2,851

false

String Transformation

string-transformation

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

false

70.753945

Medium

2,852

false

true

Sum of Remoteness of All Cells

sum-of-remoteness-of-all-cells

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

true

false

74.060586

Easy

2,853

false

true

Highest Salaries Difference

highest-salaries-difference

['Database']

false

70.209845

Medium

2,854

false

true

Rolling Average Steps

rolling-average-steps

['Database']

false

56.429243

Easy

2,855

false

Minimum Right Shifts to Sort the Array

minimum-right-shifts-to-sort-the-array

['Array']

false

24.559637

Medium

2,856

false

Minimum Array Length After Pair Removals

minimum-array-length-after-pair-removals

['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Greedy', 'Counting']

false

31.914277

Medium

2,857

false

Count Pairs of Points With Distance k

count-pairs-of-points-with-distance-k

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

false

55.264266

Hard

2,858

false

Minimum Edge Reversals So Every Node Is Reachable

minimum-edge-reversals-so-every-node-is-reachable

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

false

85.597378

Easy

2,859

false

Sum of Values at Indices With K Set Bits

sum-of-values-at-indices-with-k-set-bits

['Array', 'Bit Manipulation']

false

50.013835

Medium

2,860

false

Happy Students

happy-students

['Array', 'Sorting', 'Enumeration']

false

38.517952

Medium

2,861

false

Maximum Number of Alloys

maximum-number-of-alloys

['Array', 'Binary Search']

false

41.270073

Hard

2,862

false

Maximum Element-Sum of a Complete Subset of Indices

maximum-element-sum-of-a-complete-subset-of-indices

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

false

70.071575

Medium

2,863

false

true

Maximum Length of Semi-Decreasing Subarrays

maximum-length-of-semi-decreasing-subarrays

['Array', 'Stack', 'Sorting', 'Monotonic Stack']

false

82.645776

Easy

2,864

false

Maximum Odd Binary Number

maximum-odd-binary-number

['Math', 'String', 'Greedy']

true

false

43.166409

Medium

2,865

false

Beautiful Towers I

beautiful-towers-i

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

false

34.154377

Medium

2,866

false

Beautiful Towers II

beautiful-towers-ii

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

false

34.245518

Hard

2,867

false

Count Valid Paths in a Tree

count-valid-paths-in-a-tree

['Math', 'Dynamic Programming', 'Tree', 'Depth-First Search', 'Number Theory']

false

53.497164

Hard

2,868

false

true

The Wording Game

the-wording-game

['Array', 'Math', 'Two Pointers', 'String', 'Greedy', 'Game Theory']

false

60.520105

Easy

2,869

false

Minimum Operations to Collect Elements

minimum-operations-to-collect-elements

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

false

61.790156

Medium

2,870

false

Minimum Number of Operations to Make Array Empty

minimum-number-of-operations-to-make-array-empty

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

true

false

41.400445

Medium

2,871

false

Split Array Into Maximum Number of Subarrays

split-array-into-maximum-number-of-subarrays

['Array', 'Greedy', 'Bit Manipulation']

false

69.783429

Hard

2,872

false

Maximum Number of K-Divisible Components

maximum-number-of-k-divisible-components

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

true

false

58.338917

Easy

2,873

false

Maximum Value of an Ordered Triplet I

maximum-value-of-an-ordered-triplet-i

['Array']

true

false

56.858747

Medium

2,874

false

Maximum Value of an Ordered Triplet II

maximum-value-of-an-ordered-triplet-ii

['Array']

true

false

30.941482

Medium

2,875

false

Minimum Size Subarray in Infinite Array

minimum-size-subarray-in-infinite-array

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

false

31.554573

Hard

2,876

false

Count Visited Nodes in a Directed Graph

count-visited-nodes-in-a-directed-graph

['Dynamic Programming', 'Graph', 'Memoization']

false

81.472752

Easy

2,877

false

Create a DataFrame from List

create-a-dataframe-from-list

[]

true

false

85.172315

Easy

2,878

false

Get the Size of a DataFrame

get-the-size-of-a-dataframe

[]

true

false

93.074498

Easy

2,879

false

Display the First Three Rows

display-the-first-three-rows

[]

true

false

79.28977

Easy

2,880

false

Select Data

select-data

[]

true

false

90.261647

Easy

2,881

false

Create a New Column

create-a-new-column

[]

true

false

85.597902

Easy

2,882

false

Drop Duplicate Rows

drop-duplicate-rows

[]

true

false

64.313432

Easy

2,883

false

Drop Missing Data

drop-missing-data

[]

true

false

92.507623

Easy

2,884

false

Modify Columns

modify-columns

[]

true

false

85.594038

Easy

2,885

false

Rename Columns

rename-columns

[]

true

false

87.4883

Easy

2,886

false

Change Data Type

change-data-type

[]

true

false

72.275505

Easy

2,887

false

Fill Missing Data

fill-missing-data

[]

true

false

90.737046

Easy

2,888

false

Reshape Data: Concatenate

reshape-data-concatenate

[]

true

false

83.557667

Easy

2,889

false

Reshape Data: Pivot

reshape-data-pivot

[]

true

false

86.14745

Easy

2,890

false

Reshape Data: Melt

reshape-data-melt

[]

true

false

76.63526

Easy

2,891

false

Method Chaining

method-chaining

[]

true

false

39.229221

Medium

2,892

false

true

Minimizing Array After Replacing Pairs With Their Product

minimizing-array-after-replacing-pairs-with-their-product

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

false

68.141012

Medium

2,893

false

true

Calculate Orders Within Each Interval

calculate-orders-within-each-interval

['Database']

false

88.284384

Easy

2,894

false

Divisible and Non-divisible Sums Difference

divisible-and-non-divisible-sums-difference

['Math']

false

68.853385

Medium

2,895

false

Minimum Processing Time

minimum-processing-time

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

false

27.036648

Medium

2,896

false

Apply Operations to Make Two Strings Equal

apply-operations-to-make-two-strings-equal

['String', 'Dynamic Programming']

false

42.99869

Hard

2,897

false

Apply Operations on Array to Maximize Sum of Squares

apply-operations-on-array-to-maximize-sum-of-squares

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

false

58.618754

Medium

2,898

false

true

Maximum Linear Stock Score

maximum-linear-stock-score

['Array', 'Hash Table']

false

63.370346

Easy

2,899

false

Last Visited Integers

last-visited-integers

['Array', 'Simulation']

false

59.662363

Easy

2,900

false

Longest Unequal Adjacent Groups Subsequence I

longest-unequal-adjacent-groups-subsequence-i

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

false