-
Notifications
You must be signed in to change notification settings - Fork 0
/
questions.bak.json
143 lines (143 loc) · 11.1 KB
/
questions.bak.json
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
[
{ "number": 347, "title": "Top K Frequent Elements", "topic": "heap_priority_queue" },
{ "number": 692, "title": "Top K Frequent Words", "topic": "heap_priority_queue" },
{ "number": 451, "title": "Sort Characters By Frequency", "topic": "heap_priority_queue" },
{ "number": 973, "title": "K Closest Points to Origin", "topic": "heap_priority_queue" },
{ "number": 1167, "title": "Minimum Cost to Connect Sticks", "topic": "heap_priority_queue" },
{ "number": 215, "title": "Kth Largest Element in an Array", "topic": "heap_priority_queue" },
{ "number": 378, "title": "Kth Smallest Element in a Sorted Matrix", "topic": "heap_priority_queue" },
{ "number": 846, "title": "Hand of Straights", "topic": "heap_priority_queue" },
{ "number": 373, "title": "Find K Pairs with Smallest Sums", "topic": "heap_priority_queue" },
{ "number": 759, "title": "Employee Free Time", "topic": "heap_priority_queue" },
{ "number": 34, "title": "Find First and Last Position of Element in Sorted Array", "topic": "sorting_searching" },
{ "number": 347, "title": "Top K Frequent Elements", "topic": "sorting_searching" },
{ "number": 658, "title": "Find K Closest Elements", "topic": "sorting_searching" },
{ "number": 912, "title": "Sort an Array", "topic": "sorting_searching" },
{ "number": 162, "title": "Find Peak Element", "topic": "sorting_searching" },
{ "number": 743, "title": "Network Delay Time", "topic": "dijkstras_algorithm" },
{ "number": 787, "title": "Cheapest Flights Within K Stops", "topic": "dijkstras_algorithm" },
{ "number": 1631, "title": "Path With Minimum Effort", "topic": "dijkstras_algorithm" },
{ "number": 1584, "title": "Min Cost to Connect All Points", "topic": "prims_algorithm" },
{ "number": 1135, "title": "Connecting Cities With Minimum Cost", "topic": "prims_algorithm" },
{ "number": 684, "title": "Redundant Connection", "topic": "union_find" },
{ "number": 721, "title": "Accounts Merge", "topic": "union_find" },
{ "number": 952, "title": "Largest Component Size by Common Factor", "topic": "union_find" },
{ "number": 1202, "title": "Smallest String With Swaps", "topic": "union_find" },
{ "number": 1168, "title": "Optimize Water Distribution in a Village", "topic": "minimum_spanning_tree" },
{ "number": 1489, "title": "Find Critical and Pseudo Critical Edges in MST", "topic": "minimum_spanning_tree" },
{ "number": 103, "title": "Binary Tree Zigzag Level Order Traversal", "topic": "tree" },
{ "number": 105, "title": "Construct Binary Tree from Preorder and Inorder Traversal", "topic": "tree" },
{ "number": 114, "title": "Flatten Binary Tree to Linked List", "topic": "tree" },
{ "number": 144, "title": "Binary Tree Preorder Traversal", "topic": "tree" },
{ "number": 199, "title": "Binary Tree Right Side View", "topic": "tree" },
{ "number": 222, "title": "Count Complete Tree Nodes", "topic": "tree" },
{ "number": 230, "title": "Kth Smallest Element in a BST", "topic": "tree" },
{ "number": 236, "title": "Lowest Common Ancestor of a Binary Tree", "topic": "tree" },
{ "number": 297, "title": "Serialize and Deserialize Binary Tree", "topic": "tree" },
{ "number": 337, "title": "House Robber III", "topic": "tree" },
{ "number": 508, "title": "Most Frequent Subtree Sum", "topic": "tree" },
{ "number": 513, "title": "Find Bottom Left Tree Value", "topic": "tree" },
{ "number": 515, "title": "Find Largest Value in Each Tree Row", "topic": "tree" },
{ "number": 662, "title": "Maximum Width of Binary Tree", "topic": "tree" },
{ "number": 958, "title": "Check Completeness of a Binary Tree", "topic": "tree" },
{ "number": 39, "title": "Combination Sum", "topic": "backtracking" },
{ "number": 46, "title": "Permutations", "topic": "backtracking" },
{ "number": 78, "title": "Subsets", "topic": "backtracking" },
{ "number": 90, "title": "Subsets II", "topic": "backtracking" },
{ "number": 131, "title": "Palindrome Partitioning", "topic": "backtracking" },
{ "number": 212, "title": "Word Search II", "topic": "backtracking" },
{ "number": 216, "title": "Combination Sum III", "topic": "backtracking" },
{ "number": 306, "title": "Additive Number", "topic": "backtracking" },
{ "number": 491, "title": "Increasing Subsequences", "topic": "backtracking" },
{ "number": 784, "title": "Letter Case Permutation", "topic": "backtracking" },
{ "number": 70, "title": "Climbing Stairs", "topic": "dynamic_programming" },
{ "number": 91, "title": "Decode Ways", "topic": "dynamic_programming" },
{ "number": 198, "title": "House Robber", "topic": "dynamic_programming" },
{ "number": 300, "title": "Longest Increasing Subsequence", "topic": "dynamic_programming" },
{ "number": 322, "title": "Coin Change", "topic": "dynamic_programming" },
{ "number": 416, "title": "Partition Equal Subset Sum", "topic": "dynamic_programming" },
{ "number": 494, "title": "Target Sum", "topic": "dynamic_programming" },
{ "number": 152, "title": "Maximum Product Subarray", "topic": "dynamic_programming" },
{ "number": 22, "title": "Generate Parentheses", "topic": "recursion_with_strings" },
{ "number": 44, "title": "Wildcard Matching", "topic": "recursion_with_strings" },
{ "number": 93, "title": "Restore IP Addresses", "topic": "recursion_with_strings" },
{ "number": 131, "title": "Palindrome Partitioning", "topic": "recursion_with_strings" },
{ "number": 301, "title": "Remove Invalid Parentheses", "topic": "recursion_with_strings" },
{ "number": 88, "title": "Merge Sorted Array", "topic": "array_string" },
{ "number": 27, "title": "Remove Element", "topic": "array_string" },
{ "number": 26, "title": "Remove Duplicates from Sorted Array", "topic": "array_string" },
{ "number": 80, "title": "Remove Duplicates from Sorted Array II", "topic": "array_string" },
{ "number": 169, "title": "Majority Element", "topic": "array_string" },
{ "number": 189, "title": "Rotate Array", "topic": "array_string" },
{ "number": 121, "title": "Best Time to Buy and Sell Stock", "topic": "array_string" },
{ "number": 122, "title": "Best Time to Buy and Sell Stock II", "topic": "array_string" },
{ "number": 55, "title": "Jump Game", "topic": "array_string" },
{ "number": 45, "title": "Jump Game II", "topic": "array_string" },
{ "number": 274, "title": "H-Index", "topic": "array_string" },
{ "number": 380, "title": "Insert Delete GetRandom O(1)", "topic": "array_string" },
{ "number": 238, "title": "Product of Array Except Self", "topic": "array_string" },
{ "number": 134, "title": "Gas Station", "topic": "array_string" },
{ "number": 135, "title": "Candy", "topic": "array_string" },
{ "number": 42, "title": "Trapping Rain Water", "topic": "array_string" },
{ "number": 13, "title": "Roman to Integer", "topic": "array_string" },
{ "number": 12, "title": "Integer to Roman", "topic": "array_string" },
{ "number": 58, "title": "Length of Last Word", "topic": "array_string" },
{ "number": 14, "title": "Longest Common Prefix", "topic": "array_string" },
{ "number": 125, "title": "Valid Palindrome", "topic": "two_pointers" },
{ "number": 392, "title": "Is Subsequence", "topic": "two_pointers" },
{ "number": 167, "title": "Two Sum II - Input Array Is Sorted", "topic": "two_pointers" },
{ "number": 11, "title": "Container With Most Water", "topic": "two_pointers" },
{ "number": 15, "title": "3Sum", "topic": "two_pointers" },
{ "number": 209, "title": "Minimum Size Subarray Sum", "topic": "two_pointers" },
{ "number": 3, "title": "Longest Substring Without Repeating Characters", "topic": "two_pointers" },
{ "number": 30, "title": "Substring with Concatenation of All Words", "topic": "sliding_window" },
{ "number": 76, "title": "Minimum Window Substring", "topic": "sliding_window" },
{ "number": 438, "title": "Find All Anagrams in a String", "topic": "sliding_window" },
{ "number": 567, "title": "Permutation in String", "topic": "sliding_window" },
{ "number": 36, "title": "Valid Sudoku", "topic": "matrix" },
{ "number": 54, "title": "Spiral Matrix", "topic": "matrix" },
{ "number": 48, "title": "Rotate Image", "topic": "matrix" },
{ "number": 73, "title": "Set Matrix Zeroes", "topic": "matrix" },
{ "number": 289, "title": "Game of Life", "topic": "matrix" },
{ "number": 383, "title": "Ransom Note", "topic": "hashmap" },
{ "number": 205, "title": "Isomorphic Strings", "topic": "hashmap" },
{ "number": 290, "title": "Word Pattern", "topic": "hashmap" },
{ "number": 242, "title": "Valid Anagram", "topic": "hashmap" },
{ "number": 49, "title": "Group Anagrams", "topic": "hashmap" },
{ "number": 1, "title": "Two Sum", "topic": "hashmap" },
{ "number": 202, "title": "Happy Number", "topic": "hashmap" },
{ "number": 219, "title": "Contains Duplicate II", "topic": "hashmap" },
{ "number": 128, "title": "Longest Consecutive Sequence", "topic": "hashmap" },
{ "number": 228, "title": "Summary Ranges", "topic": "intervals" },
{ "number": 56, "title": "Merge Intervals", "topic": "intervals" },
{ "number": 57, "title": "Insert Interval", "topic": "intervals" },
{ "number": 452, "title": "Minimum Number of Arrows to Burst Balloons", "topic": "intervals" },
{ "number": 435, "title": "Non-overlapping Intervals", "topic": "intervals" },
{ "number": 20, "title": "Valid Parentheses", "topic": "stack" },
{ "number": 71, "title": "Simplify Path", "topic": "stack" },
{ "number": 155, "title": "Min Stack", "topic": "stack" },
{ "number": 150, "title": "Evaluate Reverse Polish Notation", "topic": "stack" },
{ "number": 224, "title": "Basic Calculator", "topic": "stack" },
{ "number": 141, "title": "Linked List Cycle", "topic": "linked_list" },
{ "number": 2, "title": "Add Two Numbers", "topic": "linked_list" },
{ "number": 21, "title": "Merge Two Sorted Lists", "topic": "linked_list" },
{ "number": 138, "title": "Copy List with Random Pointer", "topic": "linked_list" },
{ "number": 92, "title": "Reverse Linked List II", "topic": "linked_list" },
{ "number": 25, "title": "Reverse Nodes in k-Group", "topic": "linked_list" },
{ "number": 19, "title": "Remove Nth Node From End of List", "topic": "linked_list" },
{ "number": 82, "title": "Remove Duplicates from Sorted List II", "topic": "linked_list" },
{ "number": 61, "title": "Rotate List", "topic": "linked_list" },
{ "number": 86, "title": "Partition List", "topic": "linked_list" },
{ "number": 208, "title": "Implement Trie (Prefix Tree)", "topic": "trie" },
{ "number": 648, "title": "Search Suggestions System", "topic": "trie" },
{ "number": 739, "title": "Daily Temperatures", "topic": "monotonic_stack" },
{ "number": 901, "title": "Online Stock Span", "topic": "monotonic_stack" },
{ "number": 207, "title": "Course Schedule", "topic": "graph_algorithms" },
{ "number": 210, "title": "Course Schedule II", "topic": "graph_algorithms" },
{ "number": 133, "title": "Clone Graph", "topic": "graph_algorithms" },
{ "number": 417, "title": "Pacific Atlantic Water Flow", "topic": "graph_algorithms" },
{ "number": 72, "title": "Edit Distance", "topic": "misc_questions" },
{ "number": 146, "title": "LRU Cache", "topic": "misc_questions" },
{ "number": 200, "title": "Number of Islands", "topic": "misc_questions" },
{ "number": 938, "title": "Range Sum of BST", "topic": "misc_questions" }
]