Datasets:

kaysss
/

leetcode-problem-set

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.325854	Easy	1	false	false	Two Sum	two-sum	['Array', 'Hash Table']	true	true
45.704411	Medium	2	false	false	Add Two Numbers	add-two-numbers	['Linked List', 'Math', 'Recursion']	true	true
36.532662	Medium	3	false	false	Longest Substring Without Repeating Characters	longest-substring-without-repeating-characters	['Hash Table', 'String', 'Sliding Window']	true	true
43.219538	Hard	4	false	false	Median of Two Sorted Arrays	median-of-two-sorted-arrays	['Array', 'Binary Search', 'Divide and Conquer']	true	true
35.481252	Medium	5	false	false	Longest Palindromic Substring	longest-palindromic-substring	['Two Pointers', 'String', 'Dynamic Programming']	true	true
51.05351	Medium	6	false	false	Zigzag Conversion	zigzag-conversion	['String']	true	true
29.998962	Medium	7	false	false	Reverse Integer	reverse-integer	['Math']	true	true
18.883424	Medium	8	false	false	String to Integer (atoi)	string-to-integer-atoi	['String']	true	false
58.850296	Easy	9	false	false	Palindrome Number	palindrome-number	['Math']	true	true
29.057334	Hard	10	false	false	Regular Expression Matching	regular-expression-matching	['String', 'Dynamic Programming', 'Recursion']	true	false
57.386371	Medium	11	false	false	Container With Most Water	container-with-most-water	['Array', 'Two Pointers', 'Greedy']	true	true
68.079313	Medium	12	false	false	Integer to Roman	integer-to-roman	['Hash Table', 'Math', 'String']	true	true
64.401395	Easy	13	false	false	Roman to Integer	roman-to-integer	['Hash Table', 'Math', 'String']	true	true
45.091055	Easy	14	false	false	Longest Common Prefix	longest-common-prefix	['String', 'Trie']	true	true
36.6551	Medium	15	false	false	3Sum	3sum	['Array', 'Two Pointers', 'Sorting']	true	true
46.686252	Medium	16	false	false	3Sum Closest	3sum-closest	['Array', 'Two Pointers', 'Sorting']	true	true
63.35228	Medium	17	false	false	Letter Combinations of a Phone Number	letter-combinations-of-a-phone-number	['Hash Table', 'String', 'Backtracking']	true	false
37.795272	Medium	18	false	false	4Sum	4sum	['Array', 'Two Pointers', 'Sorting']	true	false
48.391382	Medium	19	false	false	Remove Nth Node From End of List	remove-nth-node-from-end-of-list	['Linked List', 'Two Pointers']	true	true
42.014175	Easy	20	false	false	Valid Parentheses	valid-parentheses	['String', 'Stack']	true	true
66.479773	Easy	21	false	false	Merge Two Sorted Lists	merge-two-sorted-lists	['Linked List', 'Recursion']	true	true
76.738586	Medium	22	false	false	Generate Parentheses	generate-parentheses	['String', 'Dynamic Programming', 'Backtracking']	true	true
56.139933	Hard	23	false	false	Merge k Sorted Lists	merge-k-sorted-lists	['Linked List', 'Divide and Conquer', 'Heap (Priority Queue)', 'Merge Sort']	true	true
66.737488	Medium	24	false	false	Swap Nodes in Pairs	swap-nodes-in-pairs	['Linked List', 'Recursion']	true	false
62.380603	Hard	25	false	false	Reverse Nodes in k-Group	reverse-nodes-in-k-group	['Linked List', 'Recursion']	true	false
59.790432	Easy	26	false	false	Remove Duplicates from Sorted Array	remove-duplicates-from-sorted-array	['Array', 'Two Pointers']	true	true
59.670014	Easy	27	false	false	Remove Element	remove-element	['Array', 'Two Pointers']	true	true
44.642728	Easy	28	false	false	Find the Index of the First Occurrence in a String	find-the-index-of-the-first-occurrence-in-a-string	['Two Pointers', 'String', 'String Matching']	true	true
18.228505	Medium	29	false	false	Divide Two Integers	divide-two-integers	['Math', 'Bit Manipulation']	true	false
32.855747	Hard	30	false	false	Substring with Concatenation of All Words	substring-with-concatenation-of-all-words	['Hash Table', 'String', 'Sliding Window']	true	true
42.572861	Medium	31	false	false	Next Permutation	next-permutation	['Array', 'Two Pointers']	true	true
35.884709	Hard	32	false	false	Longest Valid Parentheses	longest-valid-parentheses	['String', 'Dynamic Programming', 'Stack']	true	false
42.497616	Medium	33	false	false	Search in Rotated Sorted Array	search-in-rotated-sorted-array	['Array', 'Binary Search']	true	false
46.373327	Medium	34	false	false	Find First and Last Position of Element in Sorted Array	find-first-and-last-position-of-element-in-sorted-array	['Array', 'Binary Search']	true	false
48.563383	Easy	35	false	false	Search Insert Position	search-insert-position	['Array', 'Binary Search']	true	true
61.881058	Medium	36	false	false	Valid Sudoku	valid-sudoku	['Array', 'Hash Table', 'Matrix']	true	false
63.706361	Hard	37	false	false	Sudoku Solver	sudoku-solver	['Array', 'Hash Table', 'Backtracking', 'Matrix']	true	false
58.16384	Medium	38	false	false	Count and Say	count-and-say	['String']	true	false
74.174829	Medium	39	false	false	Combination Sum	combination-sum	['Array', 'Backtracking']	true	true
57.334587	Medium	40	false	false	Combination Sum II	combination-sum-ii	['Array', 'Backtracking']	true	false
40.790748	Hard	41	false	false	First Missing Positive	first-missing-positive	['Array', 'Hash Table']	true	false
64.548006	Hard	42	false	false	Trapping Rain Water	trapping-rain-water	['Array', 'Two Pointers', 'Dynamic Programming', 'Stack', 'Monotonic Stack']	true	false
41.992784	Medium	43	false	false	Multiply Strings	multiply-strings	['Math', 'String', 'Simulation']	true	false
29.521067	Hard	44	false	false	Wildcard Matching	wildcard-matching	['String', 'Dynamic Programming', 'Greedy', 'Recursion']	true	false
41.238357	Medium	45	false	false	Jump Game II	jump-game-ii	['Array', 'Dynamic Programming', 'Greedy']	true	false
80.322238	Medium	46	false	false	Permutations	permutations	['Array', 'Backtracking']	true	false
61.194967	Medium	47	false	false	Permutations II	permutations-ii	['Array', 'Backtracking', 'Sorting']	true	false
77.413957	Medium	48	false	false	Rotate Image	rotate-image	['Array', 'Math', 'Matrix']	true	false
70.557266	Medium	49	false	false	Group Anagrams	group-anagrams	['Array', 'Hash Table', 'String', 'Sorting']	true	true
36.682078	Medium	50	false	false	Pow(x, n)	powx-n	['Math', 'Recursion']	true	false
72.03651	Hard	51	false	false	N-Queens	n-queens	['Array', 'Backtracking']	true	false
76.262056	Hard	52	false	false	N-Queens II	n-queens-ii	['Backtracking']	true	false
51.856984	Medium	53	false	false	Maximum Subarray	maximum-subarray	['Array', 'Divide and Conquer', 'Dynamic Programming']	true	true
53.285437	Medium	54	false	false	Spiral Matrix	spiral-matrix	['Array', 'Matrix', 'Simulation']	true	false
39.208807	Medium	55	false	false	Jump Game	jump-game	['Array', 'Dynamic Programming', 'Greedy']	true	false
49.017819	Medium	56	false	false	Merge Intervals	merge-intervals	['Array', 'Sorting']	true	true
43.116101	Medium	57	false	false	Insert Interval	insert-interval	['Array']	true	false
55.759145	Easy	58	false	false	Length of Last Word	length-of-last-word	['String']	true	false
73.11257	Medium	59	false	false	Spiral Matrix II	spiral-matrix-ii	['Array', 'Matrix', 'Simulation']	true	false
49.398539	Hard	60	false	false	Permutation Sequence	permutation-sequence	['Math', 'Recursion']	true	false
39.586165	Medium	61	false	false	Rotate List	rotate-list	['Linked List', 'Two Pointers']	true	false
65.530065	Medium	62	false	false	Unique Paths	unique-paths	['Math', 'Dynamic Programming', 'Combinatorics']	true	false
42.879814	Medium	63	false	false	Unique Paths II	unique-paths-ii	['Array', 'Dynamic Programming', 'Matrix']	true	false
66.059154	Medium	64	false	false	Minimum Path Sum	minimum-path-sum	['Array', 'Dynamic Programming', 'Matrix']	true	false
21.254069	Hard	65	false	false	Valid Number	valid-number	['String']	true	false
47.217954	Easy	66	false	false	Plus One	plus-one	['Array', 'Math']	true	false
55.355352	Easy	67	false	false	Add Binary	add-binary	['Math', 'String', 'Bit Manipulation', 'Simulation']	true	false
47.470019	Hard	68	false	false	Text Justification	text-justification	['Array', 'String', 'Simulation']	true	false
40.148463	Easy	69	false	false	Sqrt(x)	sqrtx	['Math', 'Binary Search']	true	true
53.405867	Easy	70	false	false	Climbing Stairs	climbing-stairs	['Math', 'Dynamic Programming', 'Memoization']	true	false
47.036543	Medium	71	false	false	Simplify Path	simplify-path	['String', 'Stack']	true	true
58.372539	Medium	72	false	false	Edit Distance	edit-distance	['String', 'Dynamic Programming']	true	false
59.237687	Medium	73	false	false	Set Matrix Zeroes	set-matrix-zeroes	['Array', 'Hash Table', 'Matrix']	true	false
51.936158	Medium	74	false	false	Search a 2D Matrix	search-a-2d-matrix	['Array', 'Binary Search', 'Matrix']	true	false
66.625849	Medium	75	false	false	Sort Colors	sort-colors	['Array', 'Two Pointers', 'Sorting']	true	false
44.889273	Hard	76	false	false	Minimum Window Substring	minimum-window-substring	['Hash Table', 'String', 'Sliding Window']	true	false
72.489057	Medium	77	false	false	Combinations	combinations	['Backtracking']	true	false
80.461669	Medium	78	false	false	Subsets	subsets	['Array', 'Backtracking', 'Bit Manipulation']	true	true
44.828069	Medium	79	false	false	Word Search	word-search	['Array', 'String', 'Backtracking', 'Depth-First Search', 'Matrix']	true	false
62.473537	Medium	80	false	false	Remove Duplicates from Sorted Array II	remove-duplicates-from-sorted-array-ii	['Array', 'Two Pointers']	true	false
38.671604	Medium	81	false	false	Search in Rotated Sorted Array II	search-in-rotated-sorted-array-ii	['Array', 'Binary Search']	true	false
49.453779	Medium	82	false	false	Remove Duplicates from Sorted List II	remove-duplicates-from-sorted-list-ii	['Linked List', 'Two Pointers']	true	false
54.526306	Easy	83	false	false	Remove Duplicates from Sorted List	remove-duplicates-from-sorted-list	['Linked List']	true	true
46.827895	Hard	84	false	false	Largest Rectangle in Histogram	largest-rectangle-in-histogram	['Array', 'Stack', 'Monotonic Stack']	true	true
53.112068	Hard	85	false	false	Maximal Rectangle	maximal-rectangle	['Array', 'Dynamic Programming', 'Stack', 'Matrix', 'Monotonic Stack']	true	false
58.533831	Medium	86	false	false	Partition List	partition-list	['Linked List', 'Two Pointers']	true	false
41.82101	Hard	87	false	false	Scramble String	scramble-string	['String', 'Dynamic Programming']	true	false
52.484484	Easy	88	false	false	Merge Sorted Array	merge-sorted-array	['Array', 'Two Pointers', 'Sorting']	true	true
61.388009	Medium	89	false	false	Gray Code	gray-code	['Math', 'Backtracking', 'Bit Manipulation']	true	false
59.082208	Medium	90	false	false	Subsets II	subsets-ii	['Array', 'Backtracking', 'Bit Manipulation']	true	false
36.241526	Medium	91	false	false	Decode Ways	decode-ways	['String', 'Dynamic Programming']	true	true
49.262116	Medium	92	false	false	Reverse Linked List II	reverse-linked-list-ii	['Linked List']	true	true
52.602254	Medium	93	false	false	Restore IP Addresses	restore-ip-addresses	['String', 'Backtracking']	true	false
78.205897	Easy	94	false	false	Binary Tree Inorder Traversal	binary-tree-inorder-traversal	['Stack', 'Tree', 'Depth-First Search', 'Binary Tree']	true	false
59.960737	Medium	95	false	false	Unique Binary Search Trees II	unique-binary-search-trees-ii	['Dynamic Programming', 'Backtracking', 'Tree', 'Binary Search Tree', 'Binary Tree']	true	false
62.223596	Medium	96	false	false	Unique Binary Search Trees	unique-binary-search-trees	['Math', 'Dynamic Programming', 'Tree', 'Binary Search Tree', 'Binary Tree']	true	false
41.579849	Medium	97	false	false	Interleaving String	interleaving-string	['String', 'Dynamic Programming']	true	false
34.110568	Medium	98	false	false	Validate Binary Search Tree	validate-binary-search-tree	['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']	true	true
55.707581	Medium	99	false	false	Recover Binary Search Tree	recover-binary-search-tree	['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']	true	false
64.63722	Easy	100	false	false	Same Tree	same-tree	['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']	true	true

End of preview. Expand in Data Studio

LeetCode Scraper Dataset

This dataset contains information scraped from LeetCode. It is designed to assist developers in analyzing LeetCode problems, generating insights, and building tools for competitive programming or educational purposes.

Dataset Contents

The dataset includes the following files:

problem_set.csv

Contains a list of LeetCode problems with metadata such as difficulty, acceptance rate, tags, and more.
Columns:
acRate: Acceptance rate of the problem.
difficulty: Problem difficulty (Easy, Medium, Hard).
frontendQuestionId: Unique problem ID.
title: Problem title.
titleSlug: URL-friendly title for the problem. Construct the link this way: "https://leetcode.com/problems/{titleSlug}/description/"
topicTags: Tags associated with the problem (e.g., Array, Hash Table).
hasSolution: Indicates if the problem has an official solution.
hasVideoSolution: Indicates if the problem has a video solution.

This dataset is part of a broader collection of LeetCode-related datasets. It complements:

LeetCode Problem Detailed – includes full problem descriptions, difficulty levels, and metadata.

LeetCode Problem Solutions – contains the top 100 community solutions per problem, sorted by most upvoted.

Note: New questions are added weekly to the platform. If you'd like updated data or more solutions per problem, feel free to reach out!

Scraping code is open-sourced here: timetooth/leetcode_scraper. Give it ⭐ a if you find it helpful!

Downloads last month: 11

Size of downloaded dataset files:

557 kB

Size of the auto-converted Parquet files:

229 kB

Number of rows:

3,511