Datasets:

kaysss
/

leetcode-problem-set

Dataset card Data Studio Files Files and versions Community

Split (1)

train · 3.51k rows

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
18.650794	Hard	3,501	false	false	Maximize Active Section with Trade II	maximize-active-section-with-trade-ii	['Array', 'String', 'Binary Search', 'Segment Tree']	false	false
83.369503	Easy	3,502	false	false	Minimum Cost to Reach Every Position	minimum-cost-to-reach-every-position	['Array']	false	false
43.143162	Medium	3,503	false	false	Longest Palindrome After Substring Concatenation I	longest-palindrome-after-substring-concatenation-i	['Two Pointers', 'String', 'Dynamic Programming', 'Enumeration']	false	false
14.90614	Hard	3,504	false	false	Longest Palindrome After Substring Concatenation II	longest-palindrome-after-substring-concatenation-ii	['Two Pointers', 'String', 'Dynamic Programming']	false	false
27.387295	Hard	3,505	false	false	Minimum Operations to Make Elements Within K Subarrays Equal	minimum-operations-to-make-elements-within-k-subarrays-equal	['Array', 'Hash Table', 'Math', 'Dynamic Programming', 'Sliding Window', 'Heap (Priority Queue)']	false	false
57.801418	Hard	3,506	false	true	Find Time Required to Eliminate Bacterial Strains	find-time-required-to-eliminate-bacterial-strains	['Array', 'Math', 'Greedy', 'Heap (Priority Queue)']	false	false
57.288199	Easy	3,507	false	false	Minimum Pair Removal to Sort Array I	minimum-pair-removal-to-sort-array-i	['Array', 'Hash Table', 'Linked List', 'Heap (Priority Queue)', 'Simulation', 'Doubly-Linked List', 'Ordered Set']	false	false
20.014855	Medium	3,508	false	false	Implement Router	implement-router	['Array', 'Hash Table', 'Binary Search', 'Design', 'Queue', 'Ordered Set']	false	false
9.275551	Hard	3,509	false	false	Maximum Product of Subsequences With an Alternating Sum Equal to K	maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k	['Array', 'Hash Table', 'Dynamic Programming']	false	false
11.304457	Hard	3,510	false	false	Minimum Pair Removal to Sort Array II	minimum-pair-removal-to-sort-array-ii	['Array', 'Hash Table', 'Linked List', 'Heap (Priority Queue)', 'Simulation', 'Doubly-Linked List', 'Ordered Set']	false	false
42.222222	Medium	3,511	false	true	Make a Positive Array	make-a-positive-array	['Array', 'Greedy', 'Prefix Sum']	false	false

Subsets and Splits