questiondata.json

[{"question": "Two Sum", "free": true, "difficulty": "Easy", "slug": "two-sum", "id": "1"}, {"question": "Longest Substring Without Repeating Characters", "free": true, "difficulty": "Medium", "slug": "longest-substring-without-repeating-characters", "id": "3"}, {"question": "Longest Palindromic Substring", "free": true, "difficulty": "Medium", "slug": "longest-palindromic-substring", "id": "5"}, {"question": "Container With Most Water", "free": true, "difficulty": "Medium", "slug": "container-with-most-water", "id": "11"}, {"question": "3Sum", "free": true, "difficulty": "Medium", "slug": "3sum", "id": "15"}, {"question": "Remove Nth Node From End of List", "free": true, "difficulty": "Medium", "slug": "remove-nth-node-from-end-of-list", "id": "19"}, {"question": "Valid Parentheses", "free": true, "difficulty": "Easy", "slug": "valid-parentheses", "id": "20"}, {"question": "Merge Two Sorted Lists", "free": true, "difficulty": "Easy", "slug": "merge-two-sorted-lists", "id": "21"}, {"question": "Merge k Sorted Lists", "free": true, "difficulty": "Hard", "slug": "merge-k-sorted-lists", "id": "23"}, {"question": "Search in Rotated Sorted Array", "free": true, "difficulty": "Medium", "slug": "search-in-rotated-sorted-array", "id": "33"}, {"question": "Combination Sum", "free": true, "difficulty": "Medium", "slug": "combination-sum", "id": "39"}, {"question": "Rotate Image", "free": true, "difficulty": "Medium", "slug": "rotate-image", "id": "48"}, {"question": "Group Anagrams", "free": true, "difficulty": "Medium", "slug": "group-anagrams", "id": "49"}, {"question": "Maximum Subarray", "free": true, "difficulty": "Easy", "slug": "maximum-subarray", "id": "53"}, {"question": "Spiral Matrix", "free": true, "difficulty": "Medium", "slug": "spiral-matrix", "id": "54"}, {"question": "Jump Game", "free": true, "difficulty": "Medium", "slug": "jump-game", "id": "55"}, {"question": "Merge Intervals", "free": true, "difficulty": "Medium", "slug": "merge-intervals", "id": "56"}, {"question": "Insert Interval", "free": true, "difficulty": "Medium", "slug": "insert-interval", "id": "57"}, {"question": "Unique Paths", "free": true, "difficulty": "Medium", "slug": "unique-paths", "id": "62"}, {"question": "Climbing Stairs", "free": true, "difficulty": "Easy", "slug": "climbing-stairs", "id": "70"}, {"question": "Set Matrix Zeroes", "free": true, "difficulty": "Medium", "slug": "set-matrix-zeroes", "id": "73"}, {"question": "Minimum Window Substring", "free": true, "difficulty": "Hard", "slug": "minimum-window-substring", "id": "76"}, {"question": "Word Search", "free": true, "difficulty": "Medium", "slug": "word-search", "id": "79"}, {"question": "Decode Ways", "free": true, "difficulty": "Medium", "slug": "decode-ways", "id": "91"}, {"question": "Validate Binary Search Tree", "free": true, "difficulty": "Medium", "slug": "validate-binary-search-tree", "id": "98"}, {"question": "Same Tree", "free": true, "difficulty": "Easy", "slug": "same-tree", "id": "100"}, {"question": "Binary Tree Level Order Traversal", "free": true, "difficulty": "Medium", "slug": "binary-tree-level-order-traversal", "id": "102"}, {"question": "Maximum Depth of Binary Tree", "free": true, "difficulty": "Easy", "slug": "maximum-depth-of-binary-tree", "id": "104"}, {"question": "Construct Binary Tree from Preorder and Inorder Traversal", "free": true, "difficulty": "Medium", "slug": "construct-binary-tree-from-preorder-and-inorder-traversal", "id": "105"}, {"question": "Best Time to Buy and Sell Stock", "free": true, "difficulty": "Easy", "slug": "best-time-to-buy-and-sell-stock", "id": "121"}, {"question": "Binary Tree Maximum Path Sum", "free": true, "difficulty": "Hard", "slug": "binary-tree-maximum-path-sum", "id": "124"}, {"question": "Valid Palindrome", "free": true, "difficulty": "Easy", "slug": "valid-palindrome", "id": "125"}, {"question": "Longest Consecutive Sequence", "free": true, "difficulty": "Medium", "slug": "longest-consecutive-sequence", "id": "128"}, {"question": "Clone Graph", "free": true, "difficulty": "Medium", "slug": "clone-graph", "id": "133"}, {"question": "Word Break", "free": true, "difficulty": "Medium", "slug": "word-break", "id": "139"}, {"question": "Linked List Cycle", "free": true, "difficulty": "Easy", "slug": "linked-list-cycle", "id": "141"}, {"question": "Reorder List", "free": true, "difficulty": "Medium", "slug": "reorder-list", "id": "143"}, {"question": "Maximum Product Subarray", "free": true, "difficulty": "Medium", "slug": "maximum-product-subarray", "id": "152"}, {"question": "Find Minimum in Rotated Sorted Array", "free": true, "difficulty": "Medium", "slug": "find-minimum-in-rotated-sorted-array", "id": "153"}, {"question": "Reverse Bits", "free": true, "difficulty": "Easy", "slug": "reverse-bits", "id": "190"}, {"question": "Number of 1 Bits", "free": true, "difficulty": "Easy", "slug": "number-of-1-bits", "id": "191"}, {"question": "House Robber", "free": true, "difficulty": "Medium", "slug": "house-robber", "id": "198"}, {"question": "Number of Islands", "free": true, "difficulty": "Medium", "slug": "number-of-islands", "id": "200"}, {"question": "Reverse Linked List", "free": true, "difficulty": "Easy", "slug": "reverse-linked-list", "id": "206"}, {"question": "Course Schedule", "free": true, "difficulty": "Medium", "slug": "course-schedule", "id": "207"}, {"question": "Implement Trie (Prefix Tree)", "free": true, "difficulty": "Medium", "slug": "implement-trie-prefix-tree", "id": "208"}, {"question": "Design Add and Search Words Data Structure", "free": true, "difficulty": "Medium", "slug": "design-add-and-search-words-data-structure", "id": "211"}, {"question": "Word Search II", "free": true, "difficulty": "Hard", "slug": "word-search-ii", "id": "212"}, {"question": "House Robber II", "free": true, "difficulty": "Medium", "slug": "house-robber-ii", "id": "213"}, {"question": "Contains Duplicate", "free": true, "difficulty": "Easy", "slug": "contains-duplicate", "id": "217"}, {"question": "Invert Binary Tree", "free": true, "difficulty": "Easy", "slug": "invert-binary-tree", "id": "226"}, {"question": "Kth Smallest Element in a BST", "free": true, "difficulty": "Medium", "slug": "kth-smallest-element-in-a-bst", "id": "230"}, {"question": "Lowest Common Ancestor of a Binary Search Tree", "free": true, "difficulty": "Easy", "slug": "lowest-common-ancestor-of-a-binary-search-tree", "id": "235"}, {"question": "Lowest Common Ancestor of a Binary Tree", "free": true, "difficulty": "Medium", "slug": "lowest-common-ancestor-of-a-binary-tree", "id": "236"}, {"question": "Product of Array Except Self", "free": true, "difficulty": "Medium", "slug": "product-of-array-except-self", "id": "238"}, {"question": "Valid Anagram", "free": true, "difficulty": "Easy", "slug": "valid-anagram", "id": "242"}, {"question": "Meeting Rooms", "free": false, "difficulty": "Easy", "slug": "meeting-rooms", "id": "252"}, {"question": "Meeting Rooms II", "free": false, "difficulty": "Medium", "slug": "meeting-rooms-ii", "id": "253"}, {"question": "Graph Valid Tree", "free": false, "difficulty": "Medium", "slug": "graph-valid-tree", "id": "261"}, {"question": "Missing Number", "free": true, "difficulty": "Easy", "slug": "missing-number", "id": "268"}, {"question": "Alien Dictionary", "free": false, "difficulty": "Hard", "slug": "alien-dictionary", "id": "269"}, {"question": "Encode and Decode Strings", "free": false, "difficulty": "Medium", "slug": "encode-and-decode-strings", "id": "271"}, {"question": "Find Median from Data Stream", "free": true, "difficulty": "Hard", "slug": "find-median-from-data-stream", "id": "295"}, {"question": "Longest Increasing Subsequence", "free": true, "difficulty": "Medium", "slug": "longest-increasing-subsequence", "id": "300"}, {"question": "Coin Change", "free": true, "difficulty": "Medium", "slug": "coin-change", "id": "322"}, {"question": "Number of Connected Components in an Undirected Graph", "free": false, "difficulty": "Medium", "slug": "number-of-connected-components-in-an-undirected-graph", "id": "323"}, {"question": "Counting Bits", "free": true, "difficulty": "Easy", "slug": "counting-bits", "id": "338"}, {"question": "Top K Frequent Elements", "free": true, "difficulty": "Medium", "slug": "top-k-frequent-elements", "id": "347"}, {"question": "Sum of Two Integers", "free": true, "difficulty": "Medium", "slug": "sum-of-two-integers", "id": "371"}, {"question": "Pacific Atlantic Water Flow", "free": true, "difficulty": "Medium", "slug": "pacific-atlantic-water-flow", "id": "417"}, {"question": "Longest Repeating Character Replacement", "free": true, "difficulty": "Medium", "slug": "longest-repeating-character-replacement", "id": "424"}, {"question": "Non-overlapping Intervals", "free": true, "difficulty": "Medium", "slug": "non-overlapping-intervals", "id": "435"}, {"question": "Serialize and Deserialize BST", "free": true, "difficulty": "Medium", "slug": "serialize-and-deserialize-bst", "id": "449"}, {"question": "Subtree of Another Tree", "free": true, "difficulty": "Easy", "slug": "subtree-of-another-tree", "id": "572"}, {"question": "Palindromic Substrings", "free": true, "difficulty": "Medium", "slug": "palindromic-substrings", "id": "647"}, {"question": "Longest Common Subsequence", "free": true, "difficulty": "Medium", "slug": "longest-common-subsequence", "id": "1250"}]