-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathleetcode-relation.jsonl
53 lines (53 loc) · 8.29 KB
/
leetcode-relation.jsonl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
{"id": 1, "title": "Two Sum", "relate": ["3Sum", "4Sum", "Two Sum II - Input Array Is Sorted", "Two Sum III - Data structure design", "Subarray Sum Equals K", "Two Sum IV - Input is a BST", "Two Sum Less Than K"], "level": ["Medium", "Medium", "Medium", "Easy", "Medium", "Easy", "Easy"]}
{"id": 9, "title": "Palindrome Number", "relate": ["Palindrome Linked List"], "level": ["Easy"]}
{"id": 13, "title": "Roman to Integer", "relate": ["Integer to Roman"], "level": ["Medium"]}
{"id": 20, "title": "Valid Parentheses", "relate": ["Generate Parentheses", "Longest Valid Parentheses", "Remove Invalid Parentheses", "Check If Word Is Valid After Substitutions"], "level": ["Medium", "Hard", "Hard", "Medium"]}
{"id": 21, "title": "Merge Two Sorted Lists", "relate": ["Merge k Sorted Lists", "Merge Sorted Array", "Sort List", "Shortest Word Distance II"], "level": ["Hard", "Easy", "Medium", "Medium"]}
{"id": 26, "title": "Remove Duplicates from Sorted Array", "relate": ["Remove Element", "Remove Duplicates from Sorted Array II"], "level": ["Easy", "Medium"]}
{"id": 27, "title": "Remove Element", "relate": ["Remove Duplicates from Sorted Array", "Remove Linked List Elements", "Move Zeroes"], "level": ["Easy", "Easy", "Easy"]}
{"id": 28, "title": "Find the Index of the First Occurrence in a String", "relate": ["Shortest Palindrome", "Repeated Substring Pattern"], "level": ["Hard", "Easy"]}
{"id": 35, "title": "Search Insert Position", "relate": ["First Bad Version"], "level": ["Easy"]}
{"id": 66, "title": "Plus One", "relate": ["Multiply Strings", "Add Binary", "Plus One Linked List", "Add to Array-Form of Integer"], "level": ["Medium", "Easy", "Medium", "Easy"]}
{"id": 67, "title": "Add Binary", "relate": ["Add Two Numbers", "Multiply Strings", "Plus One", "Add to Array-Form of Integer"], "level": ["Medium", "Medium", "Easy", "Easy"]}
{"id": 69, "title": "Sqrt(x)", "relate": ["Pow(x, n)", "Valid Perfect Square"], "level": ["Medium", "Easy"]}
{"id": 70, "title": "Climbing Stairs", "relate": ["Min Cost Climbing Stairs", "Fibonacci Number", "N-th Tribonacci Number"], "level": ["Easy", "Easy", "Easy"]}
{"id": 83, "title": "Remove Duplicates from Sorted List", "relate": ["Remove Duplicates from Sorted List II"], "level": ["Medium"]}
{"id": 88, "title": "Merge Sorted Array", "relate": ["Merge Two Sorted Lists", "Squares of a Sorted Array", "Interval List Intersections"], "level": ["Easy", "Easy", "Medium"]}
{"id": 94, "title": "Binary Tree Inorder Traversal", "relate": ["Validate Binary Search Tree", "Binary Tree Preorder Traversal", "Binary Tree Postorder Traversal", "Binary Search Tree Iterator", "Kth Smallest Element in a BST", "Closest Binary Search Tree Value II", "Inorder Successor in BST", "Convert Binary Search Tree to Sorted Doubly Linked List", "Minimum Distance Between BST Nodes"], "level": ["Medium", "Easy", "Easy", "Medium", "Medium", "Hard", "Medium", "Medium", "Easy"]}
{"id": 104, "title": "Maximum Depth of Binary Tree", "relate": ["Balanced Binary Tree", "Minimum Depth of Binary Tree", "Maximum Depth of N-ary Tree"], "level": ["Easy", "Easy", "Easy"]}
{"id": 108, "title": "Convert Sorted Array to Binary Search Tree", "relate": ["Convert Sorted List to Binary Search Tree"], "level": ["Medium"]}
{"id": 110, "title": "Balanced Binary Tree", "relate": ["Maximum Depth of Binary Tree"], "level": ["Easy"]}
{"id": 111, "title": "Minimum Depth of Binary Tree", "relate": ["Binary Tree Level Order Traversal", "Maximum Depth of Binary Tree"], "level": ["Medium", "Easy"]}
{"id": 112, "title": "Path Sum", "relate": ["Path Sum II", "Binary Tree Maximum Path Sum", "Sum Root to Leaf Numbers", "Path Sum III", "Path Sum IV"], "level": ["Medium", "Hard", "Medium", "Medium", "Medium"]}
{"id": 118, "title": "Pascal's Triangle", "relate": ["Pascal's Triangle II"], "level": ["Easy"]}
{"id": 119, "title": "Pascal's Triangle II", "relate": ["Pascal's Triangle"], "level": ["Easy"]}
{"id": 121, "title": "Best Time to Buy and Sell Stock", "relate": ["Maximum Subarray", "Best Time to Buy and Sell Stock II", "Best Time to Buy and Sell Stock III", "Best Time to Buy and Sell Stock IV", "Best Time to Buy and Sell Stock with Cooldown"], "level": ["Medium", "Medium", "Hard", "Hard", "Medium"]}
{"id": 125, "title": "Valid Palindrome", "relate": ["Palindrome Linked List", "Valid Palindrome II"], "level": ["Easy", "Easy"]}
{"id": 136, "title": "Single Number", "relate": ["Single Number II", "Single Number III", "Missing Number", "Find the Duplicate Number", "Find the Difference"], "level": ["Medium", "Medium", "Easy", "Medium", "Easy"]}
{"id": 141, "title": "Linked List Cycle", "relate": ["Linked List Cycle II", "Happy Number"], "level": ["Medium", "Easy"]}
{"id": 144, "title": "Binary Tree Preorder Traversal", "relate": ["Binary Tree Inorder Traversal", "Verify Preorder Sequence in Binary Search Tree", "N-ary Tree Preorder Traversal"], "level": ["Easy", "Medium", "Easy"]}
{"id": 145, "title": "Binary Tree Postorder Traversal", "relate": ["Binary Tree Inorder Traversal", "N-ary Tree Postorder Traversal"], "level": ["Easy", "Easy"]}
{"id": 157, "title": "Read N Characters Given Read4", "relate": ["Read N Characters Given read4 II - Call Multiple Times"], "level": ["Hard"]}
{"id": 160, "title": "Intersection of Two Linked Lists", "relate": ["Minimum Index Sum of Two Lists"], "level": ["Easy"]}
{"id": 163, "title": "Missing Ranges", "relate": ["Summary Ranges"], "level": ["Easy"]}
{"id": 168, "title": "Excel Sheet Column Title", "relate": ["Excel Sheet Column Number"], "level": ["Easy"]}
{"id": 169, "title": "Majority Element", "relate": ["Majority Element II", "Check If a Number Is Majority Element in a Sorted Array"], "level": ["Medium", "Easy"]}
{"id": 170, "title": "Two Sum III - Data structure design", "relate": ["Two Sum", "Unique Word Abbreviation", "Two Sum IV - Input is a BST"], "level": ["Easy", "Medium", "Easy"]}
{"id": 171, "title": "Excel Sheet Column Number", "relate": ["Excel Sheet Column Title"], "level": ["Easy"]}
{"id": 190, "title": "Reverse Bits", "relate": ["Reverse Integer", "Number of 1 Bits"], "level": ["Medium", "Easy"]}
{"id": 191, "title": "Number of 1 Bits", "relate": ["Reverse Bits", "Power of Two", "Counting Bits", "Binary Watch", "Hamming Distance", "Binary Number with Alternating Bits", "Prime Number of Set Bits in Binary Representation"], "level": ["Easy", "Easy", "Easy", "Easy", "Easy", "Easy", "Easy"]}
{"id": 202, "title": "Happy Number", "relate": ["Linked List Cycle", "Add Digits", "Ugly Number"], "level": ["Easy", "Easy", "Easy"]}
{"id": 203, "title": "Remove Linked List Elements", "relate": ["Remove Element", "Delete Node in a Linked List"], "level": ["Easy", "Medium"]}
{"id": 205, "title": "Isomorphic Strings", "relate": ["Word Pattern"], "level": ["Easy"]}
{"id": 206, "title": "Reverse Linked List", "relate": ["Reverse Linked List II", "Binary Tree Upside Down", "Palindrome Linked List"], "level": ["Medium", "Medium", "Easy"]}
{"id": 217, "title": "Contains Duplicate", "relate": ["Contains Duplicate II", "Contains Duplicate III"], "level": ["Easy", "Hard"]}
{"id": 219, "title": "Contains Duplicate II", "relate": ["Contains Duplicate", "Contains Duplicate III"], "level": ["Easy", "Hard"]}
{"id": 225, "title": "Implement Stack using Queues", "relate": ["Implement Queue using Stacks"], "level": ["Easy"]}
{"id": 228, "title": "Summary Ranges", "relate": ["Missing Ranges", "Data Stream as Disjoint Intervals"], "level": ["Easy", "Hard"]}
{"id": 231, "title": "Power of Two", "relate": ["Number of 1 Bits", "Power of Three", "Power of Four"], "level": ["Easy", "Easy", "Easy"]}
{"id": 232, "title": "Implement Queue using Stacks", "relate": ["Implement Stack using Queues"], "level": ["Easy"]}
{"id": 234, "title": "Palindrome Linked List", "relate": ["Palindrome Number", "Valid Palindrome", "Reverse Linked List"], "level": ["Easy", "Easy", "Easy"]}
{"id": 242, "title": "Valid Anagram", "relate": ["Group Anagrams", "Palindrome Permutation", "Find All Anagrams in a String"], "level": ["Medium", "Easy", "Medium"]}
{"id": 243, "title": "Shortest Word Distance", "relate": ["Shortest Word Distance II", "Shortest Word Distance III"], "level": ["Medium", "Medium"]}
{"id": 246, "title": "Strobogrammatic Number", "relate": ["Strobogrammatic Number II", "Strobogrammatic Number III", "Confusing Number"], "level": ["Medium", "Hard", "Easy"]}
{"id": 252, "title": "Meeting Rooms", "relate": ["Merge Intervals", "Meeting Rooms II"], "level": ["Medium", "Medium"]}