leetcode-relation-medium.jsonl

{"id": 2, "title": "Add Two Numbers", "relate": [], "level": []}
{"id": 3, "title": "Longest Substring Without Repeating Characters", "relate": ["Subarrays with K Different Integers"], "level": ["Hard"]}
{"id": 5, "title": "Longest Palindromic Substring", "relate": ["Shortest Palindrome", "Palindrome Pairs"], "level": ["Hard", "Hard"]}
{"id": 7, "title": "Reverse Integer", "relate": [], "level": []}
{"id": 8, "title": "String to Integer (atoi)", "relate": ["Valid Number"], "level": ["Hard"]}
{"id": 11, "title": "Container With Most Water", "relate": ["Trapping Rain Water"], "level": ["Hard"]}
{"id": 12, "title": "Integer to Roman", "relate": ["Integer to English Words"], "level": ["Hard"]}
{"id": 15, "title": "3Sum", "relate": [], "level": []}
{"id": 16, "title": "3Sum Closest", "relate": [], "level": []}
{"id": 17, "title": "Letter Combinations of a Phone Number", "relate": [], "level": []}
{"id": 18, "title": "4Sum", "relate": [], "level": []}
{"id": 22, "title": "Generate Parentheses", "relate": [], "level": []}
{"id": 24, "title": "Swap Nodes in Pairs", "relate": ["Reverse Nodes in k-Group"], "level": ["Hard"]}
{"id": 31, "title": "Next Permutation", "relate": ["Permutation Sequence"], "level": ["Hard"]}
{"id": 33, "title": "Search in Rotated Sorted Array", "relate": [], "level": []}
{"id": 34, "title": "Find First and Last Position of Element in Sorted Array", "relate": [], "level": []}
{"id": 36, "title": "Valid Sudoku", "relate": ["Sudoku Solver"], "level": ["Hard"]}
{"id": 38, "title": "Count and Say", "relate": [], "level": []}
{"id": 39, "title": "Combination Sum", "relate": [], "level": []}
{"id": 40, "title": "Combination Sum II", "relate": [], "level": []}
{"id": 43, "title": "Multiply Strings", "relate": [], "level": []}
{"id": 45, "title": "Jump Game II", "relate": [], "level": []}
{"id": 46, "title": "Permutations", "relate": ["Permutation Sequence"], "level": ["Hard"]}
{"id": 47, "title": "Permutations II", "relate": ["Number of Squareful Arrays"], "level": ["Hard"]}
{"id": 49, "title": "Group Anagrams", "relate": [], "level": []}
{"id": 50, "title": "Pow(x, n)", "relate": [], "level": []}
{"id": 53, "title": "Maximum Subarray", "relate": [], "level": []}
{"id": 54, "title": "Spiral Matrix", "relate": [], "level": []}
{"id": 55, "title": "Jump Game", "relate": [], "level": []}
{"id": 56, "title": "Merge Intervals", "relate": ["Range Module", "Employee Free Time"], "level": ["Hard", "Hard"]}
{"id": 57, "title": "Insert Interval", "relate": ["Range Module"], "level": ["Hard"]}
{"id": 59, "title": "Spiral Matrix II", "relate": [], "level": []}
{"id": 62, "title": "Unique Paths", "relate": ["Dungeon Game"], "level": ["Hard"]}
{"id": 63, "title": "Unique Paths II", "relate": ["Unique Paths III"], "level": ["Hard"]}
{"id": 64, "title": "Minimum Path Sum", "relate": ["Dungeon Game", "Cherry Pickup"], "level": ["Hard", "Hard"]}
{"id": 73, "title": "Set Matrix Zeroes", "relate": [], "level": []}
{"id": 74, "title": "Search a 2D Matrix", "relate": [], "level": []}
{"id": 75, "title": "Sort Colors", "relate": [], "level": []}
{"id": 77, "title": "Combinations", "relate": [], "level": []}
{"id": 78, "title": "Subsets", "relate": [], "level": []}
{"id": 79, "title": "Word Search", "relate": ["Word Search II"], "level": ["Hard"]}
{"id": 80, "title": "Remove Duplicates from Sorted Array II", "relate": [], "level": []}
{"id": 81, "title": "Search in Rotated Sorted Array II", "relate": [], "level": []}
{"id": 82, "title": "Remove Duplicates from Sorted List II", "relate": [], "level": []}
{"id": 89, "title": "Gray Code", "relate": [], "level": []}
{"id": 90, "title": "Subsets II", "relate": [], "level": []}
{"id": 91, "title": "Decode Ways", "relate": ["Decode Ways II"], "level": ["Hard"]}
{"id": 92, "title": "Reverse Linked List II", "relate": [], "level": []}
{"id": 93, "title": "Restore IP Addresses", "relate": [], "level": []}
{"id": 95, "title": "Unique Binary Search Trees II", "relate": [], "level": []}
{"id": 96, "title": "Unique Binary Search Trees", "relate": [], "level": []}
{"id": 98, "title": "Validate Binary Search Tree", "relate": [], "level": []}
{"id": 102, "title": "Binary Tree Level Order Traversal", "relate": [], "level": []}
{"id": 103, "title": "Binary Tree Zigzag Level Order Traversal", "relate": [], "level": []}
{"id": 105, "title": "Construct Binary Tree from Preorder and Inorder Traversal", "relate": [], "level": []}
{"id": 106, "title": "Construct Binary Tree from Inorder and Postorder Traversal", "relate": [], "level": []}
{"id": 107, "title": "Binary Tree Level Order Traversal II", "relate": [], "level": []}
{"id": 109, "title": "Convert Sorted List to Binary Search Tree", "relate": [], "level": []}
{"id": 113, "title": "Path Sum II", "relate": [], "level": []}
{"id": 114, "title": "Flatten Binary Tree to Linked List", "relate": [], "level": []}
{"id": 116, "title": "Populating Next Right Pointers in Each Node", "relate": [], "level": []}
{"id": 117, "title": "Populating Next Right Pointers in Each Node II", "relate": [], "level": []}
{"id": 122, "title": "Best Time to Buy and Sell Stock II", "relate": ["Best Time to Buy and Sell Stock III", "Best Time to Buy and Sell Stock IV"], "level": ["Hard", "Hard"]}
{"id": 128, "title": "Longest Consecutive Sequence", "relate": [], "level": []}
{"id": 129, "title": "Sum Root to Leaf Numbers", "relate": ["Binary Tree Maximum Path Sum"], "level": ["Hard"]}
{"id": 130, "title": "Surrounded Regions", "relate": [], "level": []}
{"id": 131, "title": "Palindrome Partitioning", "relate": ["Palindrome Partitioning II"], "level": ["Hard"]}
{"id": 133, "title": "Clone Graph", "relate": [], "level": []}
{"id": 137, "title": "Single Number II", "relate": [], "level": []}
{"id": 138, "title": "Copy List with Random Pointer", "relate": [], "level": []}
{"id": 139, "title": "Word Break", "relate": ["Word Break II"], "level": ["Hard"]}
{"id": 142, "title": "Linked List Cycle II", "relate": [], "level": []}
{"id": 146, "title": "LRU Cache", "relate": ["LFU Cache", "Design In-Memory File System"], "level": ["Hard", "Hard"]}
{"id": 147, "title": "Insertion Sort List", "relate": [], "level": []}
{"id": 148, "title": "Sort List", "relate": [], "level": []}
{"id": 150, "title": "Evaluate Reverse Polish Notation", "relate": ["Basic Calculator", "Expression Add Operators"], "level": ["Hard", "Hard"]}
{"id": 151, "title": "Reverse Words in a String", "relate": [], "level": []}
{"id": 152, "title": "Maximum Product Subarray", "relate": [], "level": []}
{"id": 153, "title": "Find Minimum in Rotated Sorted Array", "relate": ["Find Minimum in Rotated Sorted Array II"], "level": ["Hard"]}
{"id": 155, "title": "Min Stack", "relate": ["Sliding Window Maximum", "Max Stack"], "level": ["Hard", "Hard"]}
{"id": 156, "title": "Binary Tree Upside Down", "relate": [], "level": []}
{"id": 159, "title": "Longest Substring with At Most Two Distinct Characters", "relate": ["Sliding Window Maximum", "Subarrays with K Different Integers"], "level": ["Hard", "Hard"]}
{"id": 161, "title": "One Edit Distance", "relate": [], "level": []}
{"id": 162, "title": "Find Peak Element", "relate": [], "level": []}
{"id": 167, "title": "Two Sum II - Input Array Is Sorted", "relate": [], "level": []}
{"id": 172, "title": "Factorial Trailing Zeroes", "relate": ["Number of Digit One", "Preimage Size of Factorial Zeroes Function"], "level": ["Hard", "Hard"]}
{"id": 173, "title": "Binary Search Tree Iterator", "relate": [], "level": []}
{"id": 186, "title": "Reverse Words in a String II", "relate": [], "level": []}
{"id": 189, "title": "Rotate Array", "relate": [], "level": []}
{"id": 198, "title": "House Robber", "relate": ["Non-negative Integers without Consecutive Ones", "Coin Path"], "level": ["Hard", "Hard"]}
{"id": 199, "title": "Binary Tree Right Side View", "relate": [], "level": []}
{"id": 200, "title": "Number of Islands", "relate": ["Number of Islands II"], "level": ["Hard"]}
{"id": 204, "title": "Count Primes", "relate": [], "level": []}
{"id": 207, "title": "Course Schedule", "relate": ["Course Schedule III"], "level": ["Hard"]}
{"id": 208, "title": "Implement Trie (Prefix Tree)", "relate": ["Design Search Autocomplete System"], "level": ["Hard"]}
{"id": 209, "title": "Minimum Size Subarray Sum", "relate": ["Minimum Window Substring"], "level": ["Hard"]}
{"id": 210, "title": "Course Schedule II", "relate": ["Alien Dictionary", "Course Schedule III"], "level": ["Hard", "Hard"]}
{"id": 211, "title": "Design Add and Search Words Data Structure", "relate": ["Prefix and Suffix Search"], "level": ["Hard"]}
{"id": 213, "title": "House Robber II", "relate": ["Non-negative Integers without Consecutive Ones", "Coin Path"], "level": ["Hard", "Hard"]}
{"id": 215, "title": "Kth Largest Element in an Array", "relate": [], "level": []}
{"id": 216, "title": "Combination Sum III", "relate": [], "level": []}
{"id": 221, "title": "Maximal Square", "relate": ["Maximal Rectangle"], "level": ["Hard"]}
{"id": 222, "title": "Count Complete Tree Nodes", "relate": [], "level": []}
{"id": 223, "title": "Rectangle Area", "relate": [], "level": []}
{"id": 227, "title": "Basic Calculator II", "relate": ["Basic Calculator", "Expression Add Operators", "Basic Calculator III"], "level": ["Hard", "Hard", "Hard"]}
{"id": 229, "title": "Majority Element II", "relate": [], "level": []}
{"id": 230, "title": "Kth Smallest Element in a BST", "relate": [], "level": []}
{"id": 235, "title": "Lowest Common Ancestor of a Binary Search Tree", "relate": [], "level": []}
{"id": 236, "title": "Lowest Common Ancestor of a Binary Tree", "relate": [], "level": []}
{"id": 237, "title": "Delete Node in a Linked List", "relate": [], "level": []}
{"id": 238, "title": "Product of Array Except Self", "relate": ["Trapping Rain Water", "Paint House II"], "level": ["Hard", "Hard"]}
{"id": 240, "title": "Search a 2D Matrix II", "relate": [], "level": []}
{"id": 241, "title": "Different Ways to Add Parentheses", "relate": ["Basic Calculator", "Expression Add Operators"], "level": ["Hard", "Hard"]}
{"id": 244, "title": "Shortest Word Distance II", "relate": [], "level": []}
{"id": 245, "title": "Shortest Word Distance III", "relate": [], "level": []}
{"id": 247, "title": "Strobogrammatic Number II", "relate": ["Strobogrammatic Number III"], "level": ["Hard"]}
{"id": 249, "title": "Group Shifted Strings", "relate": [], "level": []}
{"id": 250, "title": "Count Univalue Subtrees", "relate": [], "level": []}
{"id": 251, "title": "Flatten 2D Vector", "relate": [], "level": []}
{"id": 253, "title": "Meeting Rooms II", "relate": [], "level": []}
{"id": 254, "title": "Factor Combinations", "relate": [], "level": []}
{"id": 255, "title": "Verify Preorder Sequence in Binary Search Tree", "relate": [], "level": []}
{"id": 256, "title": "Paint House", "relate": ["Paint House II"], "level": ["Hard"]}
{"id": 259, "title": "3Sum Smaller", "relate": [], "level": []}
{"id": 260, "title": "Single Number III", "relate": [], "level": []}
{"id": 261, "title": "Graph Valid Tree", "relate": [], "level": []}
{"id": 264, "title": "Ugly Number II", "relate": ["Merge k Sorted Lists"], "level": ["Hard"]}
{"id": 267, "title": "Palindrome Permutation II", "relate": [], "level": []}
{"id": 271, "title": "Encode and Decode Strings", "relate": ["Serialize and Deserialize Binary Tree"], "level": ["Hard"]}
{"id": 274, "title": "H-Index", "relate": [], "level": []}
{"id": 275, "title": "H-Index II", "relate": [], "level": []}
{"id": 276, "title": "Paint Fence", "relate": ["Paint House II"], "level": ["Hard"]}
{"id": 277, "title": "Find the Celebrity", "relate": [], "level": []}
{"id": 279, "title": "Perfect Squares", "relate": [], "level": []}
{"id": 280, "title": "Wiggle Sort", "relate": [], "level": []}
{"id": 281, "title": "Zigzag Iterator", "relate": [], "level": []}
{"id": 284, "title": "Peeking Iterator", "relate": [], "level": []}
{"id": 285, "title": "Inorder Successor in BST", "relate": [], "level": []}
{"id": 286, "title": "Walls and Gates", "relate": ["Shortest Distance from All Buildings", "Robot Room Cleaner"], "level": ["Hard", "Hard"]}
{"id": 287, "title": "Find the Duplicate Number", "relate": ["First Missing Positive"], "level": ["Hard"]}
{"id": 288, "title": "Unique Word Abbreviation", "relate": [], "level": []}
{"id": 289, "title": "Game of Life", "relate": [], "level": []}
{"id": 291, "title": "Word Pattern II", "relate": [], "level": []}
{"id": 294, "title": "Flip Game II", "relate": [], "level": []}
{"id": 298, "title": "Binary Tree Longest Consecutive Sequence", "relate": [], "level": []}
{"id": 300, "title": "Longest Increasing Subsequence", "relate": ["Russian Doll Envelopes"], "level": ["Hard"]}
{"id": 304, "title": "Range Sum Query 2D - Immutable", "relate": ["Range Sum Query 2D - Mutable"], "level": ["Hard"]}
{"id": 306, "title": "Additive Number", "relate": [], "level": []}
{"id": 307, "title": "Range Sum Query - Mutable", "relate": ["Range Sum Query 2D - Mutable"], "level": ["Hard"]}
{"id": 309, "title": "Best Time to Buy and Sell Stock with Cooldown", "relate": [], "level": []}
{"id": 310, "title": "Minimum Height Trees", "relate": [], "level": []}
{"id": 313, "title": "Super Ugly Number", "relate": [], "level": []}
{"id": 314, "title": "Binary Tree Vertical Order Traversal", "relate": [], "level": []}
{"id": 319, "title": "Bulb Switcher", "relate": ["Minimum Number of K Consecutive Bit Flips"], "level": ["Hard"]}
{"id": 320, "title": "Generalized Abbreviation", "relate": ["Minimum Unique Word Abbreviation"], "level": ["Hard"]}
{"id": 322, "title": "Coin Change", "relate": [], "level": []}
{"id": 323, "title": "Number of Connected Components in an Undirected Graph", "relate": [], "level": []}
{"id": 324, "title": "Wiggle Sort II", "relate": [], "level": []}
{"id": 325, "title": "Maximum Size Subarray Sum Equals k", "relate": [], "level": []}
{"id": 328, "title": "Odd Even Linked List", "relate": [], "level": []}
{"id": 334, "title": "Increasing Triplet Subsequence", "relate": [], "level": []}
{"id": 337, "title": "House Robber III", "relate": [], "level": []}
{"id": 340, "title": "Longest Substring with At Most K Distinct Characters", "relate": ["Subarrays with K Different Integers"], "level": ["Hard"]}
{"id": 341, "title": "Flatten Nested List Iterator", "relate": [], "level": []}
{"id": 347, "title": "Top K Frequent Elements", "relate": [], "level": []}
{"id": 348, "title": "Design Tic-Tac-Toe", "relate": [], "level": []}
{"id": 356, "title": "Line Reflection", "relate": ["Max Points on a Line"], "level": ["Hard"]}
{"id": 360, "title": "Sort Transformed Array", "relate": [], "level": []}
{"id": 362, "title": "Design Hit Counter", "relate": [], "level": []}
{"id": 364, "title": "Nested List Weight Sum II", "relate": [], "level": []}
{"id": 369, "title": "Plus One Linked List", "relate": [], "level": []}
{"id": 370, "title": "Range Addition", "relate": [], "level": []}
{"id": 371, "title": "Sum of Two Integers", "relate": [], "level": []}
{"id": 372, "title": "Super Pow", "relate": [], "level": []}
{"id": 373, "title": "Find K Pairs with Smallest Sums", "relate": ["Find K-th Smallest Pair Distance"], "level": ["Hard"]}
{"id": 375, "title": "Guess Number Higher or Lower II", "relate": [], "level": []}
{"id": 377, "title": "Combination Sum IV", "relate": [], "level": []}
{"id": 378, "title": "Kth Smallest Element in a Sorted Matrix", "relate": ["Kth Smallest Number in Multiplication Table", "Find K-th Smallest Pair Distance"], "level": ["Hard", "Hard"]}
{"id": 380, "title": "Insert Delete GetRandom O(1)", "relate": ["Insert Delete GetRandom O(1) - Duplicates allowed"], "level": ["Hard"]}
{"id": 382, "title": "Linked List Random Node", "relate": [], "level": []}
{"id": 385, "title": "Mini Parser", "relate": [], "level": []}
{"id": 394, "title": "Decode String", "relate": ["Encode String with Shortest Length", "Number of Atoms"], "level": ["Hard", "Hard"]}
{"id": 398, "title": "Random Pick Index", "relate": ["Random Pick with Blacklist"], "level": ["Hard"]}
{"id": 402, "title": "Remove K Digits", "relate": ["Create Maximum Number"], "level": ["Hard"]}
{"id": 406, "title": "Queue Reconstruction by Height", "relate": ["Count of Smaller Numbers After Self"], "level": ["Hard"]}
{"id": 413, "title": "Arithmetic Slices", "relate": ["Arithmetic Slices II - Subsequence"], "level": ["Hard"]}
{"id": 416, "title": "Partition Equal Subset Sum", "relate": [], "level": []}
{"id": 424, "title": "Longest Repeating Character Replacement", "relate": [], "level": []}
{"id": 426, "title": "Convert Binary Search Tree to Sorted Doubly Linked List", "relate": [], "level": []}
{"id": 429, "title": "N-ary Tree Level Order Traversal", "relate": [], "level": []}
{"id": 430, "title": "Flatten a Multilevel Doubly Linked List", "relate": [], "level": []}
{"id": 433, "title": "Minimum Genetic Mutation", "relate": ["Word Ladder"], "level": ["Hard"]}
{"id": 435, "title": "Non-overlapping Intervals", "relate": [], "level": []}
{"id": 436, "title": "Find Right Interval", "relate": ["Data Stream as Disjoint Intervals"], "level": ["Hard"]}
{"id": 437, "title": "Path Sum III", "relate": [], "level": []}
{"id": 438, "title": "Find All Anagrams in a String", "relate": [], "level": []}
{"id": 439, "title": "Ternary Expression Parser", "relate": ["Parse Lisp Expression"], "level": ["Hard"]}
{"id": 442, "title": "Find All Duplicates in an Array", "relate": [], "level": []}
{"id": 443, "title": "String Compression", "relate": [], "level": []}
{"id": 444, "title": "Sequence Reconstruction", "relate": [], "level": []}
{"id": 445, "title": "Add Two Numbers II", "relate": [], "level": []}
{"id": 447, "title": "Number of Boomerangs", "relate": [], "level": []}
{"id": 449, "title": "Serialize and Deserialize BST", "relate": ["Serialize and Deserialize Binary Tree", "Serialize and Deserialize N-ary Tree"], "level": ["Hard", "Hard"]}
{"id": 450, "title": "Delete Node in a BST", "relate": [], "level": []}
{"id": 451, "title": "Sort Characters By Frequency", "relate": [], "level": []}
{"id": 452, "title": "Minimum Number of Arrows to Burst Balloons", "relate": [], "level": []}
{"id": 453, "title": "Minimum Moves to Equal Array Elements", "relate": [], "level": []}
{"id": 454, "title": "4Sum II", "relate": [], "level": []}
{"id": 462, "title": "Minimum Moves to Equal Array Elements II", "relate": ["Best Meeting Point"], "level": ["Hard"]}
{"id": 464, "title": "Can I Win", "relate": [], "level": []}
{"id": 468, "title": "Validate IP Address", "relate": [], "level": []}
{"id": 474, "title": "Ones and Zeroes", "relate": ["Non-negative Integers without Consecutive Ones"], "level": ["Hard"]}
{"id": 477, "title": "Total Hamming Distance", "relate": [], "level": []}
{"id": 478, "title": "Generate Random Point in a Circle", "relate": [], "level": []}
{"id": 486, "title": "Predict the Winner", "relate": [], "level": []}
{"id": 487, "title": "Max Consecutive Ones II", "relate": [], "level": []}
{"id": 490, "title": "The Maze", "relate": ["The Maze III"], "level": ["Hard"]}
{"id": 491, "title": "Non-decreasing Subsequences", "relate": [], "level": []}
{"id": 494, "title": "Target Sum", "relate": ["Expression Add Operators"], "level": ["Hard"]}
{"id": 497, "title": "Random Point in Non-overlapping Rectangles", "relate": [], "level": []}
{"id": 503, "title": "Next Greater Element II", "relate": [], "level": []}
{"id": 505, "title": "The Maze II", "relate": ["The Maze III"], "level": ["Hard"]}
{"id": 508, "title": "Most Frequent Subtree Sum", "relate": [], "level": []}
{"id": 510, "title": "Inorder Successor in BST II", "relate": [], "level": []}
{"id": 516, "title": "Longest Palindromic Subsequence", "relate": ["Count Different Palindromic Subsequences"], "level": ["Hard"]}
{"id": 522, "title": "Longest Uncommon Subsequence II", "relate": [], "level": []}
{"id": 523, "title": "Continuous Subarray Sum", "relate": [], "level": []}
{"id": 524, "title": "Longest Word in Dictionary through Deleting", "relate": [], "level": []}
{"id": 525, "title": "Contiguous Array", "relate": [], "level": []}
{"id": 526, "title": "Beautiful Arrangement", "relate": [], "level": []}
{"id": 528, "title": "Random Pick with Weight", "relate": ["Random Pick with Blacklist"], "level": ["Hard"]}
{"id": 531, "title": "Lonely Pixel I", "relate": [], "level": []}
{"id": 532, "title": "K-diff Pairs in an Array", "relate": [], "level": []}
{"id": 533, "title": "Lonely Pixel II", "relate": [], "level": []}
{"id": 536, "title": "Construct Binary Tree from String", "relate": [], "level": []}
{"id": 545, "title": "Boundary of Binary Tree", "relate": [], "level": []}
{"id": 547, "title": "Number of Provinces", "relate": [], "level": []}
{"id": 549, "title": "Binary Tree Longest Consecutive Sequence II", "relate": [], "level": []}
{"id": 556, "title": "Next Greater Element III", "relate": [], "level": []}
{"id": 560, "title": "Subarray Sum Equals K", "relate": [], "level": []}
{"id": 565, "title": "Array Nesting", "relate": [], "level": []}
{"id": 567, "title": "Permutation in String", "relate": ["Minimum Window Substring"], "level": ["Hard"]}
{"id": 576, "title": "Out of Boundary Paths", "relate": [], "level": []}
{"id": 583, "title": "Delete Operation for Two Strings", "relate": [], "level": []}
{"id": 592, "title": "Fraction Addition and Subtraction", "relate": [], "level": []}
{"id": 611, "title": "Valid Triangle Number", "relate": [], "level": []}
{"id": 616, "title": "Add Bold Tag in String", "relate": ["Tag Validator"], "level": ["Hard"]}
{"id": 621, "title": "Task Scheduler", "relate": ["Rearrange String k Distance Apart"], "level": ["Hard"]}
{"id": 622, "title": "Design Circular Queue", "relate": [], "level": []}
{"id": 633, "title": "Sum of Square Numbers", "relate": [], "level": []}
{"id": 635, "title": "Design Log Storage System", "relate": ["Design In-Memory File System"], "level": ["Hard"]}
{"id": 640, "title": "Solve the Equation", "relate": [], "level": []}
{"id": 641, "title": "Design Circular Deque", "relate": [], "level": []}
{"id": 646, "title": "Maximum Length of Pair Chain", "relate": [], "level": []}
{"id": 647, "title": "Palindromic Substrings", "relate": [], "level": []}
{"id": 648, "title": "Replace Words", "relate": [], "level": []}
{"id": 649, "title": "Dota2 Senate", "relate": [], "level": []}
{"id": 650, "title": "2 Keys Keyboard", "relate": [], "level": []}
{"id": 651, "title": "4 Keys Keyboard", "relate": [], "level": []}
{"id": 652, "title": "Find Duplicate Subtrees", "relate": ["Serialize and Deserialize Binary Tree"], "level": ["Hard"]}
{"id": 654, "title": "Maximum Binary Tree", "relate": [], "level": []}
{"id": 658, "title": "Find K Closest Elements", "relate": ["Find K-th Smallest Pair Distance"], "level": ["Hard"]}
{"id": 659, "title": "Split Array into Consecutive Subsequences", "relate": [], "level": []}
{"id": 666, "title": "Path Sum IV", "relate": ["Binary Tree Maximum Path Sum"], "level": ["Hard"]}
{"id": 667, "title": "Beautiful Arrangement II", "relate": [], "level": []}
{"id": 670, "title": "Maximum Swap", "relate": ["Create Maximum Number"], "level": ["Hard"]}
{"id": 672, "title": "Bulb Switcher II", "relate": [], "level": []}
{"id": 673, "title": "Number of Longest Increasing Subsequence", "relate": [], "level": []}
{"id": 676, "title": "Implement Magic Dictionary", "relate": [], "level": []}
{"id": 678, "title": "Valid Parenthesis String", "relate": ["Special Binary String"], "level": ["Hard"]}
{"id": 686, "title": "Repeated String Match", "relate": [], "level": []}
{"id": 687, "title": "Longest Univalue Path", "relate": ["Binary Tree Maximum Path Sum"], "level": ["Hard"]}
{"id": 688, "title": "Knight Probability in Chessboard", "relate": [], "level": []}
{"id": 690, "title": "Employee Importance", "relate": [], "level": []}
{"id": 692, "title": "Top K Frequent Words", "relate": [], "level": []}
{"id": 694, "title": "Number of Distinct Islands", "relate": ["Number of Distinct Islands II"], "level": ["Hard"]}
{"id": 695, "title": "Max Area of Island", "relate": [], "level": []}
{"id": 698, "title": "Partition to K Equal Sum Subsets", "relate": [], "level": []}
{"id": 701, "title": "Insert into a Binary Search Tree", "relate": [], "level": []}
{"id": 702, "title": "Search in a Sorted Array of Unknown Size", "relate": [], "level": []}
{"id": 708, "title": "Insert into a Sorted Circular Linked List", "relate": [], "level": []}
{"id": 712, "title": "Minimum ASCII Delete Sum for Two Strings", "relate": [], "level": []}
{"id": 713, "title": "Subarray Product Less Than K", "relate": [], "level": []}
{"id": 714, "title": "Best Time to Buy and Sell Stock with Transaction Fee", "relate": [], "level": []}
{"id": 718, "title": "Maximum Length of Repeated Subarray", "relate": [], "level": []}
{"id": 720, "title": "Longest Word in Dictionary", "relate": [], "level": []}
{"id": 721, "title": "Accounts Merge", "relate": [], "level": []}
{"id": 722, "title": "Remove Comments", "relate": [], "level": []}
{"id": 725, "title": "Split Linked List in Parts", "relate": [], "level": []}
{"id": 729, "title": "My Calendar I", "relate": ["My Calendar III"], "level": ["Hard"]}
{"id": 731, "title": "My Calendar II", "relate": ["My Calendar III"], "level": ["Hard"]}
{"id": 735, "title": "Asteroid Collision", "relate": [], "level": []}
{"id": 737, "title": "Sentence Similarity II", "relate": [], "level": []}
{"id": 738, "title": "Monotone Increasing Digits", "relate": [], "level": []}
{"id": 739, "title": "Daily Temperatures", "relate": [], "level": []}
{"id": 740, "title": "Delete and Earn", "relate": [], "level": []}
{"id": 751, "title": "IP to CIDR", "relate": [], "level": []}
{"id": 755, "title": "Pour Water", "relate": ["Trapping Rain Water"], "level": ["Hard"]}
{"id": 763, "title": "Partition Labels", "relate": [], "level": []}
{"id": 764, "title": "Largest Plus Sign", "relate": [], "level": []}
{"id": 767, "title": "Reorganize String", "relate": ["Rearrange String k Distance Apart"], "level": ["Hard"]}
{"id": 769, "title": "Max Chunks To Make Sorted", "relate": ["Max Chunks To Make Sorted II"], "level": ["Hard"]}
{"id": 784, "title": "Letter Case Permutation", "relate": [], "level": []}
{"id": 786, "title": "K-th Smallest Prime Fraction", "relate": ["Kth Smallest Number in Multiplication Table", "Find K-th Smallest Pair Distance"], "level": ["Hard", "Hard"]}
{"id": 787, "title": "Cheapest Flights Within K Stops", "relate": ["Maximum Vacation Days"], "level": ["Hard"]}
{"id": 792, "title": "Number of Matching Subsequences", "relate": [], "level": []}
{"id": 794, "title": "Valid Tic-Tac-Toe State", "relate": [], "level": []}
{"id": 842, "title": "Split Array into Fibonacci Sequence", "relate": [], "level": []}
{"id": 849, "title": "Maximize Distance to Closest Person", "relate": [], "level": []}
{"id": 852, "title": "Peak Index in a Mountain Array", "relate": [], "level": []}
{"id": 855, "title": "Exam Room", "relate": [], "level": []}
{"id": 873, "title": "Length of Longest Fibonacci Subsequence", "relate": [], "level": []}
{"id": 875, "title": "Koko Eating Bananas", "relate": ["Minimize Max Distance to Gas Station"], "level": ["Hard"]}
{"id": 973, "title": "K Closest Points to Origin", "relate": [], "level": []}
{"id": 974, "title": "Subarray Sums Divisible by K", "relate": [], "level": []}
{"id": 978, "title": "Longest Turbulent Subarray", "relate": [], "level": []}
{"id": 979, "title": "Distribute Coins in Binary Tree", "relate": ["Sum of Distances in Tree", "Binary Tree Cameras"], "level": ["Hard", "Hard"]}
{"id": 983, "title": "Minimum Cost For Tickets", "relate": [], "level": []}
{"id": 986, "title": "Interval List Intersections", "relate": ["Employee Free Time"], "level": ["Hard"]}
{"id": 988, "title": "Smallest String Starting From Leaf", "relate": [], "level": []}
{"id": 991, "title": "Broken Calculator", "relate": [], "level": []}
{"id": 994, "title": "Rotting Oranges", "relate": [], "level": []}
{"id": 1003, "title": "Check If Word Is Valid After Substitutions", "relate": [], "level": []}
{"id": 1004, "title": "Max Consecutive Ones III", "relate": [], "level": []}
{"id": 1017, "title": "Convert to Base -2", "relate": [], "level": []}
{"id": 1034, "title": "Coloring A Border", "relate": [], "level": []}
{"id": 1035, "title": "Uncrossed Lines", "relate": [], "level": []}
{"id": 1055, "title": "Shortest Way to Form String", "relate": [], "level": []}
{"id": 1057, "title": "Campus Bikes", "relate": [], "level": []}
{"id": 1066, "title": "Campus Bikes II", "relate": [], "level": []}
{"id": 1087, "title": "Brace Expansion", "relate": ["Brace Expansion II"], "level": ["Hard"]}
{"id": 1094, "title": "Car Pooling", "relate": [], "level": []}
{"id": 1101, "title": "The Earliest Moment When Everyone Become Friends", "relate": [], "level": []}
{"id": 1162, "title": "As Far from Land as Possible", "relate": ["Shortest Distance from All Buildings"], "level": ["Hard"]}
{"id": 1167, "title": "Minimum Cost to Connect Sticks", "relate": ["Minimum Cost to Merge Stones"], "level": ["Hard"]}
{"id": 1214, "title": "Two Sum BSTs", "relate": [], "level": []}
{"id": 1256, "title": "Encode Number", "relate": [], "level": []}
{"id": 1257, "title": "Smallest Common Region", "relate": [], "level": []}