├── working_files ├── csv_to_md.py ├── regex_detection.py ├── data.csv ├── data.md └── output.md └── README.md /working_files/csv_to_md.py: -------------------------------------------------------------------------------- 1 | import csv 2 | 3 | def csv_to_markdown(csv_file_path, md_file_path): 4 | with open(csv_file_path, 'r') as file: 5 | reader = csv.reader(file) 6 | headers = next(reader) 7 | table_data = list(reader) 8 | 9 | markdown = "| " + " | ".join(headers) + " |\n" 10 | markdown += "| " + " | ".join(["---"] * len(headers)) + " |\n" 11 | 12 | for row in table_data: 13 | markdown += "| " + " | ".join(row) + " |\n" 14 | 15 | with open(md_file_path, 'w') as md_file: 16 | md_file.write(markdown) 17 | 18 | # Example usage 19 | csv_file_path = 'data.csv' # Replace with the actual path to your CSV file 20 | md_file_path = 'data.md' # Replace with the desired path for your Markdown file 21 | csv_to_markdown(csv_file_path, md_file_path) 22 | -------------------------------------------------------------------------------- /working_files/regex_detection.py: -------------------------------------------------------------------------------- 1 | import re 2 | 3 | def extract_problem_name(url): 4 | # Define the unified regex pattern for both LeetCode and GeeksforGeeks URLs 5 | pattern = r'(?:leetcode\.com/problems/|geeksforgeeks\.org/(?:[^/]+/)*)([a-zA-Z0-9\-]+)/?$' 6 | 7 | # Match the problem name using regex 8 | match = re.search(pattern, url) 9 | 10 | if match: 11 | problem_name = match.group(1) 12 | 13 | # Replace hyphens with spaces and capitalize each word 14 | problem_name = problem_name.replace('-', ' ').title() 15 | 16 | return problem_name 17 | 18 | return None 19 | 20 | # Read the input markdown from a file 21 | input_file_path = "data.md" 22 | output_file_path = "output.md" 23 | 24 | with open(input_file_path, 'r') as file: 25 | markdown = file.read() 26 | 27 | # Split the markdown into lines 28 | lines = markdown.strip().split('\n') 29 | 30 | # Extract the table headers and remove leading/trailing spaces 31 | headers = [header.strip() for header in lines[1].split('|')[1:-1]] 32 | 33 | # Initialize a list to store the updated markdown 34 | updated_markdown = [] 35 | 36 | # Add the modified header line to the updated markdown 37 | updated_markdown.append(f"| {' | '.join(headers)} |") 38 | 39 | # Add a separator line to the updated markdown 40 | updated_markdown.append(f"|{'|'.join([' --- ']*(len(headers)+1))}|") 41 | 42 | # Process each data row and update the markdown 43 | for line in lines[3:]: 44 | row = [cell.strip() for cell in line.split('|')[1:-1]] 45 | 46 | # Extract the problem name from the URL and create a markdown link 47 | url = row[1] 48 | problem_name = extract_problem_name(url) 49 | 50 | if problem_name: 51 | row[1] = f"[{problem_name}]({url})" 52 | 53 | # Add the modified row to the updated markdown 54 | updated_markdown.append(f"| {' | '.join(row)} |") 55 | 56 | # Join the updated markdown lines into a single string 57 | updated_markdown_str = '\n'.join(updated_markdown) 58 | 59 | # Save the updated markdown into a file 60 | with open(output_file_path, 'w') as file: 61 | file.write(updated_markdown_str) 62 | 63 | print(f"The updated markdown has been saved to '{output_file_path}'.") 64 | -------------------------------------------------------------------------------- /working_files/data.csv: -------------------------------------------------------------------------------- 1 | ,,Status,Goldman Sachs,Amazon,Walmart,Salesforce,Microsoft 2 | ,Arrays ,,,,,, 3 | Easy,https://leetcode.com/problems/set-matrix-zeroes/,Done,,,,,- 4 | Easy,https://leetcode.com/problems/move-zeroes/,Done,-,,-,-, 5 | Easy,https://leetcode.com/problems/best-time-to-buy-and-sell-stock/,,-,,,, 6 | Easy,https://www.geeksforgeeks.org/chocolate-distribution-problem/,,,,,, 7 | Easy,https://leetcode.com/problems/find-the-duplicate-number/,,-,,,, 8 | Easy,https://leetcode.com/problems/sort-colors/,,,,,-, 9 | Easy,https://leetcode.com/problems/remove-duplicates-from-sorted-array/,,,,,, 10 | Easy,https://leetcode.com/problems/two-sum/,,,,,, 11 | Easy,https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,,,,-,, 12 | Medium,https://leetcode.com/problems/subarray-sums-divisible-by-k/,,,,,, 13 | Medium,https://leetcode.com/problems/find-all-duplicates-in-an-array/,,,,,,- 14 | Medium,https://leetcode.com/problems/container-with-most-water/,,,-,,, 15 | Medium,https://leetcode.com/problems/3sum/,,-,,,, 16 | Medium,https://leetcode.com/problems/4sum/,,,-,,, 17 | Medium,https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/,,,-,,, 18 | Medium,https://leetcode.com/problems/subarray-sum-equals-k/,,,,,,- 19 | Medium,https://leetcode.com/problems/spiral-matrix/,,,,,, 20 | Medium,https://leetcode.com/problems/word-search/,,,,,, 21 | Medium,https://leetcode.com/problems/jump-game/,,,,,, 22 | Medium,https://leetcode.com/problems/merge-sorted-array/,,,,,, 23 | Medium,https://leetcode.com/problems/majority-element/,,,,,, 24 | Medium,https://leetcode.com/problems/reverse-pairs/,,,,-,, 25 | Medium,https://www.geeksforgeeks.org/print-all-possible-combinations-of-r-elements-in-a-given-array-of-size-n/,,,,-,, 26 | Medium,https://leetcode.com/problems/game-of-life/,,,,-,, 27 | Hard,https://leetcode.com/problems/max-value-of-equation/,,,,-,, 28 | Hard,https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/,,,,,, 29 | Hard,https://leetcode.com/problems/largest-rectangle-in-histogram/,,,,,, 30 | Hard,https://leetcode.com/problems/max-value-of-equation/,,,,,, 31 | ,,,,,,, 32 | ,,,,,,, 33 | ,Strings,,,,,, 34 | Easy,https://leetcode.com/problems/valid-parentheses/,,,,,-, 35 | Easy,https://www.geeksforgeeks.org/print-all-the-duplicates-in-the-input-string/,,,,,, 36 | Easy,https://leetcode.com/problems/implement-strstr/,,,,,-, 37 | Easy,https://leetcode.com/problems/longest-common-prefix/,,,,,, 38 | Easy,https://leetcode.com/problems/valid-palindrome-ii/,,-,,-,, 39 | Medium ,https://leetcode.com/problems/integer-to-roman/,,-,,,, 40 | Medium ,https://leetcode.com/problems/generate-parentheses/,,,,,-, 41 | Medium ,https://leetcode.com/problems/simplify-path/,,-,,,, 42 | Medium ,https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string-1587115621/1,,-,,,, 43 | Medium ,https://leetcode.com/problems/reverse-words-in-a-string/,,-,,,, 44 | Medium ,https://www.geeksforgeeks.org/rabin-karp-algorithm-for-pattern-searching/,,,,,-, 45 | Medium ,https://leetcode.com/problems/group-anagrams/,,,,,, 46 | Medium ,https://practice.geeksforgeeks.org/problems/word-wrap1646/1,,,,,-, 47 | Medium ,https://leetcode.com/problems/basic-calculator-ii/,,,,,, 48 | Hard,https://leetcode.com/problems/valid-number/,,,-,,, 49 | Hard,https://leetcode.com/problems/integer-to-english-words/,,,,,, 50 | Hard,https://leetcode.com/problems/minimum-window-substring/,,,,,-, 51 | Hard,https://leetcode.com/problems/text-justification/,,,,,, 52 | Hard,https://www.geeksforgeeks.org/boyer-moore-algorithm-for-pattern-searching/,,,-,,, 53 | Hard,https://leetcode.com/problems/distinct-subsequences/,,,,,, 54 | ,,,,,,, 55 | ,Matrix Problems ,,,,,, 56 | Medium,https://www.geeksforgeeks.org/maximum-size-rectangle-binary-sub-matrix-1s/,,,,,, 57 | Medium,https://www.geeksforgeeks.org/find-number-of-islands/,,,,,, 58 | Medium,https://www.geeksforgeeks.org/given-matrix-o-x-replace-o-x-surrounded-x/,,,,,, 59 | Medium,https://leetcode.com/problems/spiral-matrix/,,,,,-, 60 | Medium,https://leetcode.com/problems/rotate-image/,,,,,-, 61 | ,,,,,,-, 62 | ,Mathematical Problems,,,,,, 63 | Easy,https://leetcode.com/problems/minimum-moves-to-equal-array-elements/,,,,,, 64 | Easy,https://leetcode.com/problems/add-binary/,,,,,, 65 | Easy,https://leetcode.com/problems/maximum-product-of-three-numbers/,,,,,, 66 | Easy,https://leetcode.com/problems/excel-sheet-column-title/,,,,,, 67 | Easy,https://leetcode.com/problems/happy-number/,,,,,-, 68 | Easy,https://leetcode.com/problems/palindrome-number/,,,,,, 69 | Easy,https://leetcode.com/problems/missing-number/,,-,,,, 70 | Easy,https://leetcode.com/problems/reverse-integer/,,,,,, 71 | Easy,https://leetcode.com/problems/power-of-two/,,,,,, 72 | Medium,https://leetcode.com/problems/max-points-on-a-line/,,,,,, 73 | Medium,https://leetcode.com/problems/valid-square/,,,,,-, 74 | Medium,https://leetcode.com/problems/the-kth-factor-of-n/,,,,,, 75 | ,,,,,,, 76 | ,Sorting and Searching,,,,,,- 77 | Easy,https://www.geeksforgeeks.org/permute-two-arrays-sum-every-pair-greater-equal-k/,,,,-,, 78 | Easy,https://www.geeksforgeeks.org/ceiling-in-a-sorted-array/,,,,,, 79 | Easy,https://www.geeksforgeeks.org/find-a-pair-with-the-given-difference/,,,-,,-, 80 | Easy,https://www.geeksforgeeks.org/permute-two-arrays-sum-every-pair-greater-equal-k/,,,,,, 81 | Medium,https://www.geeksforgeeks.org/check-reversing-sub-array-make-array-sorted/,,,,,, 82 | Medium,https://www.geeksforgeeks.org/radix-sort/,,-,,,, 83 | Medium,https://www.geeksforgeeks.org/a-product-array-puzzle/,,,,,, 84 | Medium,https://www.geeksforgeeks.org/make-array-elements-equal-minimum-cost/,,,,,,- 85 | Medium,https://leetcode.com/problems/find-peak-element/,,,,,, 86 | Hard,https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages0937/1,,,,-,, 87 | Hard,https://www.geeksforgeeks.org/minimum-number-swaps-required-sort-array/,,,,,, 88 | Hard,https://www.spoj.com/problems/AGGRCOW/,,,,,,- 89 | Hard,https://leetcode.com/problems/search-in-rotated-sorted-array/,,,,,-, 90 | Hard,https://leetcode.com/problems/count-of-smaller-numbers-after-self/,,,,,, 91 | Hard,https://leetcode.com/problems/split-array-largest-sum/,,,-,,, 92 | ,,,,,,, 93 | ,Linked List,,,,,, 94 | Easy,https://leetcode.com/problems/middle-of-the-linked-list/,,,,,, 95 | Easy,https://leetcode.com/problems/linked-list-cycle/,,-,,,, 96 | Easy,https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/,,,,,,- 97 | Easy,https://leetcode.com/problems/remove-duplicates-from-sorted-list/,,,,,, 98 | Easy,https://www.geeksforgeeks.org/sort-a-linked-list-of-0s-1s-or-2s/,,,,,, 99 | Easy,https://leetcode.com/problems/reverse-linked-list/,,,,,-, 100 | Easy,https://leetcode.com/problems/merge-two-sorted-lists/,,,,,-,- 101 | Easy,https://www.geeksforgeeks.org/multiply-two-numbers-represented-linked-lists/,,,,,, 102 | Easy,https://leetcode.com/problems/intersection-of-two-linked-lists/,,,,,-, 103 | Easy,https://www.geeksforgeeks.org/given-only-a-pointer-to-a-node-to-be-deleted-in-a-singly-linked-list-how-do-you-delete-it/,,,,,, 104 | Easy,https://leetcode.com/problems/palindrome-linked-list/,,,,,-,- 105 | Medium,https://leetcode.com/problems/copy-list-with-random-pointer/,,,,,, 106 | Medium,https://leetcode.com/problems/add-two-numbers-ii/,,,,,, 107 | Medium,https://leetcode.com/problems/reverse-linked-list-ii/,,,-,,, 108 | Medium,https://leetcode.com/problems/remove-nth-node-from-end-of-list/,,,,,, 109 | Medium,https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/,,,,,, 110 | Medium,https://leetcode.com/problems/partition-list/,,,,,,- 111 | Medium,https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/,,,,,-, 112 | Medium,https://www.geeksforgeeks.org/linked-list-in-zig-zag-fashion/,,,,,, 113 | Medium,https://www.geeksforgeeks.org/segregate-even-and-odd-elements-in-a-linked-list/,,,,,, 114 | Medium,https://www.geeksforgeeks.org/rearrange-a-given-linked-list-in-place/,,,,,, 115 | Hard,https://leetcode.com/problems/merge-k-sorted-lists/,,,,,, 116 | Hard,https://leetcode.com/problems/reverse-nodes-in-k-group/,,,-,,, 117 | Hard,https://www.geeksforgeeks.org/merge-sort-for-linked-list/,,,,,,- 118 | Hard,https://www.geeksforgeeks.org/flattening-a-linked-list/,,,,,, 119 | Hard,https://www.geeksforgeeks.org/subtract-two-numbers-represented-as-linked-lists/,,,,,, 120 | ,,,,,,, 121 | ,Stacks and Queues,,,,,, 122 | Easy,https://leetcode.com/problems/implement-queue-using-stacks/,,,,,, 123 | Easy,https://leetcode.com/problems/implement-stack-using-queues/,,-,,,, 124 | Easy,https://www.geeksforgeeks.org/implement-stack-queue-using-deque/,,,,-,,- 125 | Easy,https://leetcode.com/problems/next-greater-element-i/,,,,,, 126 | Easy,https://www.geeksforgeeks.org/stack-set-4-evaluation-postfix-expression/,,,,,-, 127 | Easy,https://www.geeksforgeeks.org/implement-two-stacks-in-an-array/,,,,,, 128 | Medium,https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/,,,,,, 129 | Medium,https://practice.geeksforgeeks.org/problems/distance-of-nearest-cell-having-1-1587115620/1,,,,,,- 130 | Medium,https://leetcode.com/problems/online-stock-span/,,-,,,, 131 | Medium,https://practice.geeksforgeeks.org/problems/rotten-oranges2536/1,,,,-,, 132 | Medium,https://leetcode.com/problems/sum-of-subarray-minimums/,,,,,-, 133 | Medium,https://practice.geeksforgeeks.org/problems/circular-tour/1,,,,,, 134 | Medium,https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,,-,,,, 135 | Medium,https://leetcode.com/problems/flatten-nested-list-iterator/,,,,,, 136 | Hard,https://www.geeksforgeeks.org/find-the-maximum-of-minimums-for-every-window-size-in-a-given-array/,,,,-,-, 137 | Hard,https://www.geeksforgeeks.org/lru-cache-implementation/,,,,,,- 138 | Hard,http://geeksforgeeks.org/the-celebrity-problem/,,,,,, 139 | ,,,,,-,, 140 | ,Trees,,,,,, 141 | Easy,https://leetcode.com/problems/diameter-of-binary-tree/,,,,,, 142 | Easy,https://leetcode.com/problems/invert-binary-tree/,,,-,,, 143 | Easy,https://leetcode.com/problems/subtree-of-another-tree/,,,-,,,- 144 | Easy,https://leetcode.com/problems/range-sum-of-bst/,,,,,, 145 | Easy,https://leetcode.com/problems/symmetric-tree/,-,,-,,, 146 | Easy,https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/,,,,,, 147 | Easy,https://leetcode.com/problems/merge-two-binary-trees/,,,,,, 148 | Easy,https://leetcode.com/problems/maximum-depth-of-binary-tree/,,,,,, 149 | Easy,https://leetcode.com/problems/binary-tree-paths/,,,,-,,- 150 | Easy,https://leetcode.com/problems/same-tree/,,,,,, 151 | Easy,https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,-,,,,, 152 | Easy,https://leetcode.com/problems/path-sum/,,,,,, 153 | Easy,https://leetcode.com/problems/minimum-absolute-difference-in-bst/,,,,,, 154 | Easy,https://leetcode.com/problems/sum-of-left-leaves/,,,,-,,- 155 | Easy,https://leetcode.com/problems/balanced-binary-tree/,,,,,,- 156 | Easy,https://practice.geeksforgeeks.org/problems/predecessor-and-successor/1,,,,,, 157 | Easy,https://leetcode.com/problems/binary-tree-inorder-traversal/ ,,,,,, 158 | Easy,https://practice.geeksforgeeks.org/problems/check-whether-bst-contains-dead-end/1,,,,,, 159 | Medium,https://leetcode.com/problems/binary-search-tree-iterator/,,,,,, 160 | Medium,https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,,,,,, 161 | Medium,https://leetcode.com/problems/unique-binary-search-trees-ii/,,,,,, 162 | Medium,https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/,,,,,,- 163 | Medium,https://leetcode.com/problems/validate-binary-search-tree/,,-,,,, 164 | Medium,https://leetcode.com/problems/binary-tree-right-side-view/,,,,,, 165 | Medium,https://leetcode.com/problems/redundant-connection/,,,,,, 166 | Medium,https://leetcode.com/problems/binary-tree-level-order-traversal/,,,,,, 167 | Medium,https://leetcode.com/problems/path-sum-iii/,,,,,,- 168 | Medium,https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/,,,-,,-, 169 | Medium,https://leetcode.com/problems/unique-binary-search-trees/,,-,,,-,- 170 | Medium,https://leetcode.com/problems/recover-binary-search-tree/,,,,,-, 171 | Medium,https://leetcode.com/problems/populating-next-right-pointers-in-each-node/,,,,-,-,- 172 | Medium,https://leetcode.com/problems/flatten-binary-tree-to-linked-list/,,,,,, 173 | Medium,https://leetcode.com/problems/maximum-width-of-binary-tree/,,,,,, 174 | Medium,https://practice.geeksforgeeks.org/problems/min-distance-between-two-given-nodes-of-a-binary-tree/1,,,-,,, 175 | Medium,https://leetcode.com/problems/kth-smallest-element-in-a-bst/,,-,,,, 176 | Medium,https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,,,,,-, 177 | Medium,https://practice.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-given-range/1,,,,,, 178 | Medium,https://practice.geeksforgeeks.org/problems/preorder-to-postorder4423/1,,,-,,,- 179 | Hard,https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1,,,,,, 180 | Hard,https://leetcode.com/problems/binary-tree-maximum-path-sum/,,,,-,, 181 | Hard,https://leetcode.com/problems/sum-of-distances-in-tree/,,,,,-, 182 | Hard,https://leetcode.com/problems/binary-tree-cameras/,,,-,-,, 183 | Hard,https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/,,,-,,, 184 | Hard,https://www.geeksforgeeks.org/print-k-sum-paths-binary-tree/,,,-,,, 185 | Hard,https://leetcode.com/problems/serialize-and-deserialize-binary-tree/,,,-,,, 186 | Hard,https://www.geeksforgeeks.org/find-median-bst-time-o1-space/,,,,,, 187 | Hard,https://www.geeksforgeeks.org/largest-bst-binary-tree-set-2/,,,,,,- 188 | Hard,https://www.geeksforgeeks.org/construct-bst-from-given-preorder-traversa/,,,,,, 189 | ,,,,,,, 190 | ,GRAPHS,,,,,, 191 | Easy,https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1,,,,-,, 192 | Easy,https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/,,-,,,, 193 | Easy,https://leetcode.com/problems/number-of-islands/,,,,,, 194 | Easy,https://leetcode.com/problems/flood-fill/,,,,-,, 195 | Easy,https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1,,,,,, 196 | Easy,https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1,,,,,, 197 | Easy,https://www.geeksforgeeks.org/detect-cycle-in-a-graph/,,,,,, 198 | Medium,https://practice.geeksforgeeks.org/problems/steps-by-knight5927/1,,-,,,, 199 | Medium,https://leetcode.com/problems/decode-string/,,-,,,, 200 | Medium,https://leetcode.com/problems/shortest-bridge/,,-,,,, 201 | Medium,https://leetcode.com/problems/number-of-operations-to-make-network-connected/,,-,,-,, 202 | Medium,https://leetcode.com/problems/find-eventual-safe-states/,,,,,, 203 | Medium,https://practice.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1,,,,,, 204 | Medium,https://leetcode.com/problems/time-needed-to-inform-all-employees/,,-,,,, 205 | Medium,"https://www.geeksforgeeks.org/graph-coloring-applications/#:~:text=Graph%20coloring%20problem%20is%20to,are%20colored%20using%20same%20color.",,,,,, 206 | Medium,https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/,,,,,, 207 | Medium,https://leetcode.com/problems/as-far-from-land-as-possible/,,,,,, 208 | Medium,https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/,,,,,, 209 | Medium,https://www.geeksforgeeks.org/find-whether-it-is-possible-to-finish-all-tasks-or-not-from-given-dependencies/,,,,,, 210 | Medium,https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/,,,,-,, 211 | Medium,https://practice.geeksforgeeks.org/problems/implementing-floyd-warshall2042/1,,,,,, 212 | Medium,https://leetcode.com/problems/evaluate-division/,,,,,, 213 | Medium,https://leetcode.com/problems/snakes-and-ladders/,,,,,, 214 | Medium,https://practice.geeksforgeeks.org/problems/topological-sort/1,,,,,,- 215 | Medium,https://leetcode.com/problems/cheapest-flights-within-k-stops/description/,,,-,,-, 216 | Medium,https://www.geeksforgeeks.org/detect-negative-cycle-graph-bellman-ford/,,,,,, 217 | Medium,https://www.geeksforgeeks.org/bipartite-graph/,,,,,, 218 | Hard,https://leetcode.com/problems/longest-increasing-path-in-a-matrix/,,-,,,, 219 | Hard,https://leetcode.com/problems/making-a-large-island/,,,,,, 220 | Hard,https://leetcode.com/problems/remove-boxes/,,,,,-,- 221 | Hard,https://leetcode.com/problems/critical-connections-in-a-network/,,,,-,, 222 | Hard,https://practice.geeksforgeeks.org/problems/alien-dictionary/1,,,,-,,v 223 | Hard,https://www.geeksforgeeks.org/water-jug-problem-using-bfs/,,,,,, 224 | Hard,https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/,,,,-,-,- 225 | Hard,https://www.geeksforgeeks.org/total-number-spanning-trees-graph/,,,,,, 226 | Hard,https://leetcode.com/problems/word-ladder/,,,,,, 227 | Hard,https://www.geeksforgeeks.org/minimize-cash-flow-among-given-set-friends-borrowed-money/,,,,,, 228 | ,,,,,,, 229 | ,Tries,,,,,, 230 | Medium,https://leetcode.com/problems/design-add-and-search-words-data-structure/,,,,,, 231 | Medium,https://www.geeksforgeeks.org/word-break-problem-trie-solution/,,-,,,, 232 | Medium,https://www.geeksforgeeks.org/trie-insert-and-search/,,-,,,, 233 | Medium,https://practice.geeksforgeeks.org/problems/k-anagrams-1/0,,-,,,, 234 | Hard,https://leetcode.com/problems/palindrome-pairs/,,-,,,, 235 | Hard,https://practice.geeksforgeeks.org/problems/phone-directory/0,,,,,, 236 | ,,,,,,, 237 | ,Heaps / PQs,,,,,, 238 | ,,,,,,, 239 | Easy/Medium,https://leetcode.com/problems/top-k-frequent-elements/,,,,,, 240 | Easy/Medium,https://leetcode.com/problems/kth-largest-element-in-an-array/,,,,,, 241 | Easy/Medium,https://leetcode.com/problems/ugly-number-ii/,,,,,, 242 | Easy/Medium,https://leetcode.com/problems/furthest-building-you-can-reach/,,,,,, 243 | Easy/Medium,https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,,,,,, 244 | Easy/Medium,https://leetcode.com/problems/reorganize-string/,,,,,, 245 | Easy/Medium,https://leetcode.com/problems/find-the-most-competitive-subsequence/,,,,,, 246 | Easy/Medium,https://practice.geeksforgeeks.org/problems/smallest-positive-missing-number-1587115621/1/,,,,,, 247 | Easy/Medium,https://practice.geeksforgeeks.org/problems/largest-subarray-with-0-sum/1/,,,,-,, 248 | Easy/Medium,https://leetcode.com/problems/k-closest-points-to-origin/,,,,,, 249 | Hard,https://leetcode.com/problems/minimum-number-of-refueling-stops/,,,,,, 250 | Hard,https://leetcode.com/problems/minimum-cost-to-hire-k-workers/,,-,,,, 251 | Hard,https://leetcode.com/problems/swim-in-rising-water/,,,,,, 252 | Hard,https://leetcode.com/problems/sliding-window-maximum/,,,,,, 253 | ,,,,,,, 254 | ,Dynamic Programming,,,,,, 255 | Easy,https://leetcode.com/problems/climbing-stairs,,,,,, 256 | Easy,https://leetcode.com/problems/maximum-product-subarray/,,,-,,, 257 | Easy,https://leetcode.com/problems/ones-and-zeroes/,,,,,,- 258 | Easy,https://leetcode.com/problems/counting-bits/,,,,,-, 259 | Medium,https://leetcode.com/problems/knight-dialer/,,,,,, 260 | Medium,https://practice.geeksforgeeks.org/problems/cutted-segments1642/1,,,,,, 261 | Medium,https://leetcode.com/problems/unique-paths/,,-,,,, 262 | Medium,https://leetcode.com/problems/minimum-path-sum/,,-,,,, 263 | Medium,https://leetcode.com/problems/coin-change/,,,,,,- 264 | Medium,https://leetcode.com/problems/decode-ways/,,-,,,-, 265 | Medium,https://leetcode.com/problems/maximum-length-of-repeated-subarray/,,,,,-, 266 | Medium,https://leetcode.com/problems/longest-increasing-subsequence/,,,,,, 267 | Medium,https://practice.geeksforgeeks.org/problems/longest-common-substring1452/1,,,,,-, 268 | Medium,https://leetcode.com/problems/count-square-submatrices-with-all-ones/,,,-,,, 269 | Medium,https://leetcode.com/problems/maximal-square/,,,,,, 270 | Medium,https://practice.geeksforgeeks.org/problems/mobile-numeric-keypad5456/1,,,,,, 271 | Medium,https://www.geeksforgeeks.org/weighted-job-scheduling/,,,,,, 272 | Medium,https://leetcode.com/problems/delete-and-earn/,,,,,, 273 | Medium,https://leetcode.com/problems/range-sum-query-2d-immutable/,,,,,-, 274 | Hard,https://www.geeksforgeeks.org/optimal-binary-search-tree-dp-24/,,,,,, 275 | Hard,https://leetcode.com/problems/frog-jump/,,,,,, 276 | Hard,https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/,,,-,,, 277 | Hard,https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/,,,,,, 278 | Hard,https://www.geeksforgeeks.org/largest-area-rectangular-sub-matrix-equal-number-1s-0s/,,,,,,- 279 | Hard,https://leetcode.com/problems/trapping-rain-water/,,-,,,, 280 | Hard,https://leetcode.com/problems/minimum-cost-to-merge-stones/,,-,,,, 281 | Hard,https://leetcode.com/problems/count-different-palindromic-subsequences/,,-,,,, 282 | Hard,https://leetcode.com/problems/maximal-rectangle/,,-,,,, 283 | Hard,https://leetcode.com/problems/burst-balloons/,,,,,, 284 | Hard,https://leetcode.com/problems/super-egg-drop/,,,,,, 285 | ,,,,,,,- 286 | ,Two Pointer Approach,,,,,, 287 | Medium,https://leetcode.com/problems/sort-colors/,,,,,-, 288 | Medium,https://leetcode.com/problems/longest-repeating-character-replacement/,,,,,, 289 | Medium,https://leetcode.com/problems/maximum-number-of-visible-points/,,,,,, 290 | ,,,,,,, 291 | ,,,,,,, 292 | ,Greedy Algorithms,,,,,, 293 | Easy/Medium,https://leetcode.com/problems/gas-station/,,,,,, 294 | Easy/Medium,https://www.geeksforgeeks.org/minimum-cost-for-acquiring-all-coins-with-k-extra-coins-allowed-with-every-coin/,,,,,, 295 | Easy/Medium,https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/,,,,,,- 296 | Easy/Medium,https://leetcode.com/problems/task-scheduler/,,,,,, 297 | Easy/Medium,https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/,,,,,-, 298 | Easy/Medium,https://leetcode.com/problems/remove-k-digits/,,,,,-, 299 | Easy/Medium,https://www.spoj.com/problems/CHOCOLA/,,,,,-, 300 | Easy/Medium,https://leetcode.com/problems/non-overlapping-intervals/,,,,,-, 301 | Easy/Medium,https://leetcode.com/problems/minimum-deletion-cost-to-avoid-repeating-letters/,,,,,, 302 | Easy/Medium,https://www.geeksforgeeks.org/minimum-sum-two-numbers-formed-digits-array-2/,,,,,, 303 | ,,,,,,,- 304 | ,,,,,,, 305 | ,Backtracking,,,,,, 306 | Medium,https://leetcode.com/problems/combination-sum-ii/,,,,,, 307 | Medium,https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1,,,,,, 308 | Medium,https://leetcode.com/problems/combinations/,-,,,,,- 309 | Medium,https://leetcode.com/problems/subsets-ii/,,,,,, 310 | Medium,https://practice.geeksforgeeks.org/problems/m-coloring-problem-1587115620/1,,,,,, 311 | Medium,https://leetcode.com/problems/beautiful-arrangement/,,,,,, 312 | Medium,https://leetcode.com/problems/palindrome-partitioning/,,,,,-, 313 | Medium,https://leetcode.com/problems/permutations-ii/,,,,,, 314 | Hard,https://leetcode.com/problems/word-search-ii/,-,,,,, 315 | Hard,https://leetcode.com/problems/sudoku-solver/,,,-,,, 316 | Hard,https://leetcode.com/problems/n-queens/,,,,,, 317 | Hard,https://leetcode.com/problems/unique-paths-iii/,,,,,-, 318 | Hard,https://www.geeksforgeeks.org/find-maximum-number-possible-by-doing-at-most-k-swaps/,,,,,, 319 | Hard,https://www.geeksforgeeks.org/partition-set-k-subsets-equal-sum/,,,,,-, 320 | Hard,https://www.geeksforgeeks.org/tug-of-war/,,,,,-, 321 | Hard,https://www.geeksforgeeks.org/find-paths-from-corner-cell-to-middle-cell-in-maze/,,-,,,, 322 | Hard,https://www.geeksforgeeks.org/solving-cryptarithmetic-puzzles-backtracking-8/,,,,,, 323 | Hard,https://www.geeksforgeeks.org/print-palindromic-partitions-string/,,,,,, 324 | ,,,,,,, 325 | ,Segment Tree,,,,,, 326 | Medium/Hard,https://leetcode.com/problems/range-sum-query-immutable/,-,,,,, 327 | Medium/Hard,https://leetcode.com/problems/range-sum-query-mutable/,,,,-,, 328 | Medium/Hard,https://leetcode.com/problems/count-of-smaller-numbers-after-self/,,,,,, 329 | Medium/Hard,https://leetcode.com/problems/count-of-range-sum/,,,,,-, 330 | ,,,-,,,, 331 | -------------------------------------------------------------------------------- /working_files/data.md: -------------------------------------------------------------------------------- 1 | | | | Status | Goldman Sachs | Amazon | Walmart | Salesforce | Microsoft | 2 | | --- | --- | --- | --- | --- | --- | --- | --- | 3 | | | Arrays | | | | | | | 4 | | Easy | https://leetcode.com/problems/set-matrix-zeroes/ | Done | | | | | - | 5 | | Easy | https://leetcode.com/problems/move-zeroes/ | Done | - | | - | - | | 6 | | Easy | https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ | | - | | | | | 7 | | Easy | https://www.geeksforgeeks.org/chocolate-distribution-problem/ | | | | | | | 8 | | Easy | https://leetcode.com/problems/find-the-duplicate-number/ | | - | | | | | 9 | | Easy | https://leetcode.com/problems/sort-colors/ | | | | | - | | 10 | | Easy | https://leetcode.com/problems/remove-duplicates-from-sorted-array/ | | | | | | | 11 | | Easy | https://leetcode.com/problems/two-sum/ | | | | | | | 12 | | Easy | https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/ | | | | - | | | 13 | | Medium | https://leetcode.com/problems/subarray-sums-divisible-by-k/ | | | | | | | 14 | | Medium | https://leetcode.com/problems/find-all-duplicates-in-an-array/ | | | | | | - | 15 | | Medium | https://leetcode.com/problems/container-with-most-water/ | | | - | | | | 16 | | Medium | https://leetcode.com/problems/3sum/ | | - | | | | | 17 | | Medium | https://leetcode.com/problems/4sum/ | | | - | | | | 18 | | Medium | https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/ | | | - | | | | 19 | | Medium | https://leetcode.com/problems/subarray-sum-equals-k/ | | | | | | - | 20 | | Medium | https://leetcode.com/problems/spiral-matrix/ | | | | | | | 21 | | Medium | https://leetcode.com/problems/word-search/ | | | | | | | 22 | | Medium | https://leetcode.com/problems/jump-game/ | | | | | | | 23 | | Medium | https://leetcode.com/problems/merge-sorted-array/ | | | | | | | 24 | | Medium | https://leetcode.com/problems/majority-element/ | | | | | | | 25 | | Medium | https://leetcode.com/problems/reverse-pairs/ | | | | - | | | 26 | | Medium | https://www.geeksforgeeks.org/print-all-possible-combinations-of-r-elements-in-a-given-array-of-size-n/ | | | | - | | | 27 | | Medium | https://leetcode.com/problems/game-of-life/ | | | | - | | | 28 | | Hard | https://leetcode.com/problems/max-value-of-equation/ | | | | - | | | 29 | | Hard | https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/ | | | | | | | 30 | | Hard | https://leetcode.com/problems/largest-rectangle-in-histogram/ | | | | | | | 31 | | Hard | https://leetcode.com/problems/max-value-of-equation/ | | | | | | | 32 | | | | | | | | | | 33 | | | | | | | | | | 34 | | | Strings | | | | | | | 35 | | Easy | https://leetcode.com/problems/valid-parentheses/ | | | | | - | | 36 | | Easy | https://www.geeksforgeeks.org/print-all-the-duplicates-in-the-input-string/ | | | | | | | 37 | | Easy | https://leetcode.com/problems/implement-strstr/ | | | | | - | | 38 | | Easy | https://leetcode.com/problems/longest-common-prefix/ | | | | | | | 39 | | Easy | https://leetcode.com/problems/valid-palindrome-ii/ | | - | | - | | | 40 | | Medium | https://leetcode.com/problems/integer-to-roman/ | | - | | | | | 41 | | Medium | https://leetcode.com/problems/generate-parentheses/ | | | | | - | | 42 | | Medium | https://leetcode.com/problems/simplify-path/ | | - | | | | | 43 | | Medium | https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string-1587115621/1 | | - | | | | | 44 | | Medium | https://leetcode.com/problems/reverse-words-in-a-string/ | | - | | | | | 45 | | Medium | https://www.geeksforgeeks.org/rabin-karp-algorithm-for-pattern-searching/ | | | | | - | | 46 | | Medium | https://leetcode.com/problems/group-anagrams/ | | | | | | | 47 | | Medium | https://practice.geeksforgeeks.org/problems/word-wrap1646/1 | | | | | - | | 48 | | Medium | https://leetcode.com/problems/basic-calculator-ii/ | | | | | | | 49 | | Hard | https://leetcode.com/problems/valid-number/ | | | - | | | | 50 | | Hard | https://leetcode.com/problems/integer-to-english-words/ | | | | | | | 51 | | Hard | https://leetcode.com/problems/minimum-window-substring/ | | | | | - | | 52 | | Hard | https://leetcode.com/problems/text-justification/ | | | | | | | 53 | | Hard | https://www.geeksforgeeks.org/boyer-moore-algorithm-for-pattern-searching/ | | | - | | | | 54 | | Hard | https://leetcode.com/problems/distinct-subsequences/ | | | | | | | 55 | | | | | | | | | | 56 | | | Matrix Problems | | | | | | | 57 | | Medium | https://www.geeksforgeeks.org/maximum-size-rectangle-binary-sub-matrix-1s/ | | | | | | | 58 | | Medium | https://www.geeksforgeeks.org/find-number-of-islands/ | | | | | | | 59 | | Medium | https://www.geeksforgeeks.org/given-matrix-o-x-replace-o-x-surrounded-x/ | | | | | | | 60 | | Medium | https://leetcode.com/problems/spiral-matrix/ | | | | | - | | 61 | | Medium | https://leetcode.com/problems/rotate-image/ | | | | | - | | 62 | | | | | | | | - | | 63 | | | Mathematical Problems | | | | | | | 64 | | Easy | https://leetcode.com/problems/minimum-moves-to-equal-array-elements/ | | | | | | | 65 | | Easy | https://leetcode.com/problems/add-binary/ | | | | | | | 66 | | Easy | https://leetcode.com/problems/maximum-product-of-three-numbers/ | | | | | | | 67 | | Easy | https://leetcode.com/problems/excel-sheet-column-title/ | | | | | | | 68 | | Easy | https://leetcode.com/problems/happy-number/ | | | | | - | | 69 | | Easy | https://leetcode.com/problems/palindrome-number/ | | | | | | | 70 | | Easy | https://leetcode.com/problems/missing-number/ | | - | | | | | 71 | | Easy | https://leetcode.com/problems/reverse-integer/ | | | | | | | 72 | | Easy | https://leetcode.com/problems/power-of-two/ | | | | | | | 73 | | Medium | https://leetcode.com/problems/max-points-on-a-line/ | | | | | | | 74 | | Medium | https://leetcode.com/problems/valid-square/ | | | | | - | | 75 | | Medium | https://leetcode.com/problems/the-kth-factor-of-n/ | | | | | | | 76 | | | | | | | | | | 77 | | | Sorting and Searching | | | | | | - | 78 | | Easy | https://www.geeksforgeeks.org/permute-two-arrays-sum-every-pair-greater-equal-k/ | | | | - | | | 79 | | Easy | https://www.geeksforgeeks.org/ceiling-in-a-sorted-array/ | | | | | | | 80 | | Easy | https://www.geeksforgeeks.org/find-a-pair-with-the-given-difference/ | | | - | | - | | 81 | | Easy | https://www.geeksforgeeks.org/permute-two-arrays-sum-every-pair-greater-equal-k/ | | | | | | | 82 | | Medium | https://www.geeksforgeeks.org/check-reversing-sub-array-make-array-sorted/ | | | | | | | 83 | | Medium | https://www.geeksforgeeks.org/radix-sort/ | | - | | | | | 84 | | Medium | https://www.geeksforgeeks.org/a-product-array-puzzle/ | | | | | | | 85 | | Medium | https://www.geeksforgeeks.org/make-array-elements-equal-minimum-cost/ | | | | | | - | 86 | | Medium | https://leetcode.com/problems/find-peak-element/ | | | | | | | 87 | | Hard | https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages0937/1 | | | | - | | | 88 | | Hard | https://www.geeksforgeeks.org/minimum-number-swaps-required-sort-array/ | | | | | | | 89 | | Hard | https://www.spoj.com/problems/AGGRCOW/ | | | | | | - | 90 | | Hard | https://leetcode.com/problems/search-in-rotated-sorted-array/ | | | | | - | | 91 | | Hard | https://leetcode.com/problems/count-of-smaller-numbers-after-self/ | | | | | | | 92 | | Hard | https://leetcode.com/problems/split-array-largest-sum/ | | | - | | | | 93 | | | | | | | | | | 94 | | | Linked List | | | | | | | 95 | | Easy | https://leetcode.com/problems/middle-of-the-linked-list/ | | | | | | | 96 | | Easy | https://leetcode.com/problems/linked-list-cycle/ | | - | | | | | 97 | | Easy | https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/ | | | | | | - | 98 | | Easy | https://leetcode.com/problems/remove-duplicates-from-sorted-list/ | | | | | | | 99 | | Easy | https://www.geeksforgeeks.org/sort-a-linked-list-of-0s-1s-or-2s/ | | | | | | | 100 | | Easy | https://leetcode.com/problems/reverse-linked-list/ | | | | | - | | 101 | | Easy | https://leetcode.com/problems/merge-two-sorted-lists/ | | | | | - | - | 102 | | Easy | https://www.geeksforgeeks.org/multiply-two-numbers-represented-linked-lists/ | | | | | | | 103 | | Easy | https://leetcode.com/problems/intersection-of-two-linked-lists/ | | | | | - | | 104 | | Easy | https://www.geeksforgeeks.org/given-only-a-pointer-to-a-node-to-be-deleted-in-a-singly-linked-list-how-do-you-delete-it/ | | | | | | | 105 | | Easy | https://leetcode.com/problems/palindrome-linked-list/ | | | | | - | - | 106 | | Medium | https://leetcode.com/problems/copy-list-with-random-pointer/ | | | | | | | 107 | | Medium | https://leetcode.com/problems/add-two-numbers-ii/ | | | | | | | 108 | | Medium | https://leetcode.com/problems/reverse-linked-list-ii/ | | | - | | | | 109 | | Medium | https://leetcode.com/problems/remove-nth-node-from-end-of-list/ | | | | | | | 110 | | Medium | https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/ | | | | | | | 111 | | Medium | https://leetcode.com/problems/partition-list/ | | | | | | - | 112 | | Medium | https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/ | | | | | - | | 113 | | Medium | https://www.geeksforgeeks.org/linked-list-in-zig-zag-fashion/ | | | | | | | 114 | | Medium | https://www.geeksforgeeks.org/segregate-even-and-odd-elements-in-a-linked-list/ | | | | | | | 115 | | Medium | https://www.geeksforgeeks.org/rearrange-a-given-linked-list-in-place/ | | | | | | | 116 | | Hard | https://leetcode.com/problems/merge-k-sorted-lists/ | | | | | | | 117 | | Hard | https://leetcode.com/problems/reverse-nodes-in-k-group/ | | | - | | | | 118 | | Hard | https://www.geeksforgeeks.org/merge-sort-for-linked-list/ | | | | | | - | 119 | | Hard | https://www.geeksforgeeks.org/flattening-a-linked-list/ | | | | | | | 120 | | Hard | https://www.geeksforgeeks.org/subtract-two-numbers-represented-as-linked-lists/ | | | | | | | 121 | | | | | | | | | | 122 | | | Stacks and Queues | | | | | | | 123 | | Easy | https://leetcode.com/problems/implement-queue-using-stacks/ | | | | | | | 124 | | Easy | https://leetcode.com/problems/implement-stack-using-queues/ | | - | | | | | 125 | | Easy | https://www.geeksforgeeks.org/implement-stack-queue-using-deque/ | | | | - | | - | 126 | | Easy | https://leetcode.com/problems/next-greater-element-i/ | | | | | | | 127 | | Easy | https://www.geeksforgeeks.org/stack-set-4-evaluation-postfix-expression/ | | | | | - | | 128 | | Easy | https://www.geeksforgeeks.org/implement-two-stacks-in-an-array/ | | | | | | | 129 | | Medium | https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/ | | | | | | | 130 | | Medium | https://practice.geeksforgeeks.org/problems/distance-of-nearest-cell-having-1-1587115620/1 | | | | | | - | 131 | | Medium | https://leetcode.com/problems/online-stock-span/ | | - | | | | | 132 | | Medium | https://practice.geeksforgeeks.org/problems/rotten-oranges2536/1 | | | | - | | | 133 | | Medium | https://leetcode.com/problems/sum-of-subarray-minimums/ | | | | | - | | 134 | | Medium | https://practice.geeksforgeeks.org/problems/circular-tour/1 | | | | | | | 135 | | Medium | https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/ | | - | | | | | 136 | | Medium | https://leetcode.com/problems/flatten-nested-list-iterator/ | | | | | | | 137 | | Hard | https://www.geeksforgeeks.org/find-the-maximum-of-minimums-for-every-window-size-in-a-given-array/ | | | | - | - | | 138 | | Hard | https://www.geeksforgeeks.org/lru-cache-implementation/ | | | | | | - | 139 | | Hard | http://geeksforgeeks.org/the-celebrity-problem/ | | | | | | | 140 | | | | | | | - | | | 141 | | | Trees | | | | | | | 142 | | Easy | https://leetcode.com/problems/diameter-of-binary-tree/ | | | | | | | 143 | | Easy | https://leetcode.com/problems/invert-binary-tree/ | | | - | | | | 144 | | Easy | https://leetcode.com/problems/subtree-of-another-tree/ | | | - | | | - | 145 | | Easy | https://leetcode.com/problems/range-sum-of-bst/ | | | | | | | 146 | | Easy | https://leetcode.com/problems/symmetric-tree/ | - | | - | | | | 147 | | Easy | https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ | | | | | | | 148 | | Easy | https://leetcode.com/problems/merge-two-binary-trees/ | | | | | | | 149 | | Easy | https://leetcode.com/problems/maximum-depth-of-binary-tree/ | | | | | | | 150 | | Easy | https://leetcode.com/problems/binary-tree-paths/ | | | | - | | - | 151 | | Easy | https://leetcode.com/problems/same-tree/ | | | | | | | 152 | | Easy | https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/ | - | | | | | | 153 | | Easy | https://leetcode.com/problems/path-sum/ | | | | | | | 154 | | Easy | https://leetcode.com/problems/minimum-absolute-difference-in-bst/ | | | | | | | 155 | | Easy | https://leetcode.com/problems/sum-of-left-leaves/ | | | | - | | - | 156 | | Easy | https://leetcode.com/problems/balanced-binary-tree/ | | | | | | - | 157 | | Easy | https://practice.geeksforgeeks.org/problems/predecessor-and-successor/1 | | | | | | | 158 | | Easy | https://leetcode.com/problems/binary-tree-inorder-traversal/ | | | | | | | 159 | | Easy | https://practice.geeksforgeeks.org/problems/check-whether-bst-contains-dead-end/1 | | | | | | | 160 | | Medium | https://leetcode.com/problems/binary-search-tree-iterator/ | | | | | | | 161 | | Medium | https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/ | | | | | | | 162 | | Medium | https://leetcode.com/problems/unique-binary-search-trees-ii/ | | | | | | | 163 | | Medium | https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/ | | | | | | - | 164 | | Medium | https://leetcode.com/problems/validate-binary-search-tree/ | | - | | | | | 165 | | Medium | https://leetcode.com/problems/binary-tree-right-side-view/ | | | | | | | 166 | | Medium | https://leetcode.com/problems/redundant-connection/ | | | | | | | 167 | | Medium | https://leetcode.com/problems/binary-tree-level-order-traversal/ | | | | | | | 168 | | Medium | https://leetcode.com/problems/path-sum-iii/ | | | | | | - | 169 | | Medium | https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/ | | | - | | - | | 170 | | Medium | https://leetcode.com/problems/unique-binary-search-trees/ | | - | | | - | - | 171 | | Medium | https://leetcode.com/problems/recover-binary-search-tree/ | | | | | - | | 172 | | Medium | https://leetcode.com/problems/populating-next-right-pointers-in-each-node/ | | | | - | - | - | 173 | | Medium | https://leetcode.com/problems/flatten-binary-tree-to-linked-list/ | | | | | | | 174 | | Medium | https://leetcode.com/problems/maximum-width-of-binary-tree/ | | | | | | | 175 | | Medium | https://practice.geeksforgeeks.org/problems/min-distance-between-two-given-nodes-of-a-binary-tree/1 | | | - | | | | 176 | | Medium | https://leetcode.com/problems/kth-smallest-element-in-a-bst/ | | - | | | | | 177 | | Medium | https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ | | | | | - | | 178 | | Medium | https://practice.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-given-range/1 | | | | | | | 179 | | Medium | https://practice.geeksforgeeks.org/problems/preorder-to-postorder4423/1 | | | - | | | - | 180 | | Hard | https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1 | | | | | | | 181 | | Hard | https://leetcode.com/problems/binary-tree-maximum-path-sum/ | | | | - | | | 182 | | Hard | https://leetcode.com/problems/sum-of-distances-in-tree/ | | | | | - | | 183 | | Hard | https://leetcode.com/problems/binary-tree-cameras/ | | | - | - | | | 184 | | Hard | https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/ | | | - | | | | 185 | | Hard | https://www.geeksforgeeks.org/print-k-sum-paths-binary-tree/ | | | - | | | | 186 | | Hard | https://leetcode.com/problems/serialize-and-deserialize-binary-tree/ | | | - | | | | 187 | | Hard | https://www.geeksforgeeks.org/find-median-bst-time-o1-space/ | | | | | | | 188 | | Hard | https://www.geeksforgeeks.org/largest-bst-binary-tree-set-2/ | | | | | | - | 189 | | Hard | https://www.geeksforgeeks.org/construct-bst-from-given-preorder-traversa/ | | | | | | | 190 | | | | | | | | | | 191 | | | GRAPHS | | | | | | | 192 | | Easy | https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1 | | | | - | | | 193 | | Easy | https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/ | | - | | | | | 194 | | Easy | https://leetcode.com/problems/number-of-islands/ | | | | | | | 195 | | Easy | https://leetcode.com/problems/flood-fill/ | | | | - | | | 196 | | Easy | https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1 | | | | | | | 197 | | Easy | https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1 | | | | | | | 198 | | Easy | https://www.geeksforgeeks.org/detect-cycle-in-a-graph/ | | | | | | | 199 | | Medium | https://practice.geeksforgeeks.org/problems/steps-by-knight5927/1 | | - | | | | | 200 | | Medium | https://leetcode.com/problems/decode-string/ | | - | | | | | 201 | | Medium | https://leetcode.com/problems/shortest-bridge/ | | - | | | | | 202 | | Medium | https://leetcode.com/problems/number-of-operations-to-make-network-connected/ | | - | | - | | | 203 | | Medium | https://leetcode.com/problems/find-eventual-safe-states/ | | | | | | | 204 | | Medium | https://practice.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1 | | | | | | | 205 | | Medium | https://leetcode.com/problems/time-needed-to-inform-all-employees/ | | - | | | | | 206 | | Medium | https://www.geeksforgeeks.org/graph-coloring-applications/#:~:text=Graph%20coloring%20problem%20is%20to,are%20colored%20using%20same%20color. | | | | | | | 207 | | Medium | https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/ | | | | | | | 208 | | Medium | https://leetcode.com/problems/as-far-from-land-as-possible/ | | | | | | | 209 | | Medium | https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/ | | | | | | | 210 | | Medium | https://www.geeksforgeeks.org/find-whether-it-is-possible-to-finish-all-tasks-or-not-from-given-dependencies/ | | | | | | | 211 | | Medium | https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/ | | | | - | | | 212 | | Medium | https://practice.geeksforgeeks.org/problems/implementing-floyd-warshall2042/1 | | | | | | | 213 | | Medium | https://leetcode.com/problems/evaluate-division/ | | | | | | | 214 | | Medium | https://leetcode.com/problems/snakes-and-ladders/ | | | | | | | 215 | | Medium | https://practice.geeksforgeeks.org/problems/topological-sort/1 | | | | | | - | 216 | | Medium | https://leetcode.com/problems/cheapest-flights-within-k-stops/description/ | | | - | | - | | 217 | | Medium | https://www.geeksforgeeks.org/detect-negative-cycle-graph-bellman-ford/ | | | | | | | 218 | | Medium | https://www.geeksforgeeks.org/bipartite-graph/ | | | | | | | 219 | | Hard | https://leetcode.com/problems/longest-increasing-path-in-a-matrix/ | | - | | | | | 220 | | Hard | https://leetcode.com/problems/making-a-large-island/ | | | | | | | 221 | | Hard | https://leetcode.com/problems/remove-boxes/ | | | | | - | - | 222 | | Hard | https://leetcode.com/problems/critical-connections-in-a-network/ | | | | - | | | 223 | | Hard | https://practice.geeksforgeeks.org/problems/alien-dictionary/1 | | | | - | | v | 224 | | Hard | https://www.geeksforgeeks.org/water-jug-problem-using-bfs/ | | | | | | | 225 | | Hard | https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/ | | | | - | - | - | 226 | | Hard | https://www.geeksforgeeks.org/total-number-spanning-trees-graph/ | | | | | | | 227 | | Hard | https://leetcode.com/problems/word-ladder/ | | | | | | | 228 | | Hard | https://www.geeksforgeeks.org/minimize-cash-flow-among-given-set-friends-borrowed-money/ | | | | | | | 229 | | | | | | | | | | 230 | | | Tries | | | | | | | 231 | | Medium | https://leetcode.com/problems/design-add-and-search-words-data-structure/ | | | | | | | 232 | | Medium | https://www.geeksforgeeks.org/word-break-problem-trie-solution/ | | - | | | | | 233 | | Medium | https://www.geeksforgeeks.org/trie-insert-and-search/ | | - | | | | | 234 | | Medium | https://practice.geeksforgeeks.org/problems/k-anagrams-1/0 | | - | | | | | 235 | | Hard | https://leetcode.com/problems/palindrome-pairs/ | | - | | | | | 236 | | Hard | https://practice.geeksforgeeks.org/problems/phone-directory/0 | | | | | | | 237 | | | | | | | | | | 238 | | | Heaps / PQs | | | | | | | 239 | | | | | | | | | | 240 | | Easy/Medium | https://leetcode.com/problems/top-k-frequent-elements/ | | | | | | | 241 | | Easy/Medium | https://leetcode.com/problems/kth-largest-element-in-an-array/ | | | | | | | 242 | | Easy/Medium | https://leetcode.com/problems/ugly-number-ii/ | | | | | | | 243 | | Easy/Medium | https://leetcode.com/problems/furthest-building-you-can-reach/ | | | | | | | 244 | | Easy/Medium | https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/ | | | | | | | 245 | | Easy/Medium | https://leetcode.com/problems/reorganize-string/ | | | | | | | 246 | | Easy/Medium | https://leetcode.com/problems/find-the-most-competitive-subsequence/ | | | | | | | 247 | | Easy/Medium | https://practice.geeksforgeeks.org/problems/smallest-positive-missing-number-1587115621/1/ | | | | | | | 248 | | Easy/Medium | https://practice.geeksforgeeks.org/problems/largest-subarray-with-0-sum/1/ | | | | - | | | 249 | | Easy/Medium | https://leetcode.com/problems/k-closest-points-to-origin/ | | | | | | | 250 | | Hard | https://leetcode.com/problems/minimum-number-of-refueling-stops/ | | | | | | | 251 | | Hard | https://leetcode.com/problems/minimum-cost-to-hire-k-workers/ | | - | | | | | 252 | | Hard | https://leetcode.com/problems/swim-in-rising-water/ | | | | | | | 253 | | Hard | https://leetcode.com/problems/sliding-window-maximum/ | | | | | | | 254 | | | | | | | | | | 255 | | | Dynamic Programming | | | | | | | 256 | | Easy | https://leetcode.com/problems/climbing-stairs | | | | | | | 257 | | Easy | https://leetcode.com/problems/maximum-product-subarray/ | | | - | | | | 258 | | Easy | https://leetcode.com/problems/ones-and-zeroes/ | | | | | | - | 259 | | Easy | https://leetcode.com/problems/counting-bits/ | | | | | - | | 260 | | Medium | https://leetcode.com/problems/knight-dialer/ | | | | | | | 261 | | Medium | https://practice.geeksforgeeks.org/problems/cutted-segments1642/1 | | | | | | | 262 | | Medium | https://leetcode.com/problems/unique-paths/ | | - | | | | | 263 | | Medium | https://leetcode.com/problems/minimum-path-sum/ | | - | | | | | 264 | | Medium | https://leetcode.com/problems/coin-change/ | | | | | | - | 265 | | Medium | https://leetcode.com/problems/decode-ways/ | | - | | | - | | 266 | | Medium | https://leetcode.com/problems/maximum-length-of-repeated-subarray/ | | | | | - | | 267 | | Medium | https://leetcode.com/problems/longest-increasing-subsequence/ | | | | | | | 268 | | Medium | https://practice.geeksforgeeks.org/problems/longest-common-substring1452/1 | | | | | - | | 269 | | Medium | https://leetcode.com/problems/count-square-submatrices-with-all-ones/ | | | - | | | | 270 | | Medium | https://leetcode.com/problems/maximal-square/ | | | | | | | 271 | | Medium | https://practice.geeksforgeeks.org/problems/mobile-numeric-keypad5456/1 | | | | | | | 272 | | Medium | https://www.geeksforgeeks.org/weighted-job-scheduling/ | | | | | | | 273 | | Medium | https://leetcode.com/problems/delete-and-earn/ | | | | | | | 274 | | Medium | https://leetcode.com/problems/range-sum-query-2d-immutable/ | | | | | - | | 275 | | Hard | https://www.geeksforgeeks.org/optimal-binary-search-tree-dp-24/ | | | | | | | 276 | | Hard | https://leetcode.com/problems/frog-jump/ | | | | | | | 277 | | Hard | https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/ | | | - | | | | 278 | | Hard | https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/ | | | | | | | 279 | | Hard | https://www.geeksforgeeks.org/largest-area-rectangular-sub-matrix-equal-number-1s-0s/ | | | | | | - | 280 | | Hard | https://leetcode.com/problems/trapping-rain-water/ | | - | | | | | 281 | | Hard | https://leetcode.com/problems/minimum-cost-to-merge-stones/ | | - | | | | | 282 | | Hard | https://leetcode.com/problems/count-different-palindromic-subsequences/ | | - | | | | | 283 | | Hard | https://leetcode.com/problems/maximal-rectangle/ | | - | | | | | 284 | | Hard | https://leetcode.com/problems/burst-balloons/ | | | | | | | 285 | | Hard | https://leetcode.com/problems/super-egg-drop/ | | | | | | | 286 | | | | | | | | | - | 287 | | | Two Pointer Approach | | | | | | | 288 | | Medium | https://leetcode.com/problems/sort-colors/ | | | | | - | | 289 | | Medium | https://leetcode.com/problems/longest-repeating-character-replacement/ | | | | | | | 290 | | Medium | https://leetcode.com/problems/maximum-number-of-visible-points/ | | | | | | | 291 | | | | | | | | | | 292 | | | | | | | | | | 293 | | | Greedy Algorithms | | | | | | | 294 | | Easy/Medium | https://leetcode.com/problems/gas-station/ | | | | | | | 295 | | Easy/Medium | https://www.geeksforgeeks.org/minimum-cost-for-acquiring-all-coins-with-k-extra-coins-allowed-with-every-coin/ | | | | | | | 296 | | Easy/Medium | https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/ | | | | | | - | 297 | | Easy/Medium | https://leetcode.com/problems/task-scheduler/ | | | | | | | 298 | | Easy/Medium | https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/ | | | | | - | | 299 | | Easy/Medium | https://leetcode.com/problems/remove-k-digits/ | | | | | - | | 300 | | Easy/Medium | https://www.spoj.com/problems/CHOCOLA/ | | | | | - | | 301 | | Easy/Medium | https://leetcode.com/problems/non-overlapping-intervals/ | | | | | - | | 302 | | Easy/Medium | https://leetcode.com/problems/minimum-deletion-cost-to-avoid-repeating-letters/ | | | | | | | 303 | | Easy/Medium | https://www.geeksforgeeks.org/minimum-sum-two-numbers-formed-digits-array-2/ | | | | | | | 304 | | | | | | | | | - | 305 | | | | | | | | | | 306 | | | Backtracking | | | | | | | 307 | | Medium | https://leetcode.com/problems/combination-sum-ii/ | | | | | | | 308 | | Medium | https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1 | | | | | | | 309 | | Medium | https://leetcode.com/problems/combinations/ | - | | | | | - | 310 | | Medium | https://leetcode.com/problems/subsets-ii/ | | | | | | | 311 | | Medium | https://practice.geeksforgeeks.org/problems/m-coloring-problem-1587115620/1 | | | | | | | 312 | | Medium | https://leetcode.com/problems/beautiful-arrangement/ | | | | | | | 313 | | Medium | https://leetcode.com/problems/palindrome-partitioning/ | | | | | - | | 314 | | Medium | https://leetcode.com/problems/permutations-ii/ | | | | | | | 315 | | Hard | https://leetcode.com/problems/word-search-ii/ | - | | | | | | 316 | | Hard | https://leetcode.com/problems/sudoku-solver/ | | | - | | | | 317 | | Hard | https://leetcode.com/problems/n-queens/ | | | | | | | 318 | | Hard | https://leetcode.com/problems/unique-paths-iii/ | | | | | - | | 319 | | Hard | https://www.geeksforgeeks.org/find-maximum-number-possible-by-doing-at-most-k-swaps/ | | | | | | | 320 | | Hard | https://www.geeksforgeeks.org/partition-set-k-subsets-equal-sum/ | | | | | - | | 321 | | Hard | https://www.geeksforgeeks.org/tug-of-war/ | | | | | - | | 322 | | Hard | https://www.geeksforgeeks.org/find-paths-from-corner-cell-to-middle-cell-in-maze/ | | - | | | | | 323 | | Hard | https://www.geeksforgeeks.org/solving-cryptarithmetic-puzzles-backtracking-8/ | | | | | | | 324 | | Hard | https://www.geeksforgeeks.org/print-palindromic-partitions-string/ | | | | | | | 325 | | | | | | | | | | 326 | | | Segment Tree | | | | | | | 327 | | Medium/Hard | https://leetcode.com/problems/range-sum-query-immutable/ | - | | | | | | 328 | | Medium/Hard | https://leetcode.com/problems/range-sum-query-mutable/ | | | | - | | | 329 | | Medium/Hard | https://leetcode.com/problems/count-of-smaller-numbers-after-self/ | | | | | | | 330 | | Medium/Hard | https://leetcode.com/problems/count-of-range-sum/ | | | | | - | | 331 | | | | | - | | | | | 332 | -------------------------------------------------------------------------------- /working_files/output.md: -------------------------------------------------------------------------------- 1 | | | | Status | Goldman Sachs | Amazon | Walmart | Salesforce | Microsoft | 2 | | --- | --- | --- | --- | --- | --- | --- | --- | 3 | | | Arrays | | | | | | | 4 | | Easy | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | ✅ | | | | | - | 5 | | Easy | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | ✅ | - | | - | - | | 6 | | Easy | [Best Time To Buy And Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | | - | | | | | 7 | | Easy | [Chocolate Distribution Problem](https://www.geeksforgeeks.org/chocolate-distribution-problem/) | | | | | | | 8 | | Easy | [Find The Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | | - | | | | | 9 | | Easy | [Sort Colors](https://leetcode.com/problems/sort-colors/) | | | | | - | | 10 | | Easy | [Remove Duplicates From Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | | | | | | | 11 | | Easy | [Two Sum](https://leetcode.com/problems/two-sum/) | | | | | | | 12 | | Easy | [Best Time To Buy And Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | | | | - | | | 13 | | Medium | [Subarray Sums Divisible By K](https://leetcode.com/problems/subarray-sums-divisible-by-k/) | | | | | | | 14 | | Medium | [Find All Duplicates In An Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/) | | | | | | - | 15 | | Medium | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | | | - | | | | 16 | | Medium | [3Sum](https://leetcode.com/problems/3sum/) | | - | | | | | 17 | | Medium | [4Sum](https://leetcode.com/problems/4sum/) | | | - | | | | 18 | | Medium | [Maximum Points You Can Obtain From Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/) | | | - | | | | 19 | | Medium | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | | | | | | - | 20 | | Medium | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | | | | | | | 21 | | Medium | [Word Search](https://leetcode.com/problems/word-search/) | | | | | | | 22 | | Medium | [Jump Game](https://leetcode.com/problems/jump-game/) | | | | | | | 23 | | Medium | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | | | | | | | 24 | | Medium | [Majority Element](https://leetcode.com/problems/majority-element/) | | | | | | | 25 | | Medium | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs/) | | | | - | | | 26 | | Medium | [Print All Possible Combinations Of R Elements In A Given Array Of Size N](https://www.geeksforgeeks.org/print-all-possible-combinations-of-r-elements-in-a-given-array-of-size-n/) | | | | - | | | 27 | | Medium | [Game Of Life](https://leetcode.com/problems/game-of-life/) | | | | - | | | 28 | | Hard | [Max Value Of Equation](https://leetcode.com/problems/max-value-of-equation/) | | | | - | | | 29 | | Hard | [Insert Delete Getrandom O1 Duplicates Allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/) | | | | | | | 30 | | Hard | [Largest Rectangle In Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) | | | | | | | 31 | | Hard | [Max Value Of Equation](https://leetcode.com/problems/max-value-of-equation/) | | | | | | | 32 | | | | | | | | | | 33 | | | | | | | | | | 34 | | | Strings | | | | | | | 35 | | Easy | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | | | | | - | | 36 | | Easy | [Print All The Duplicates In The Input String](https://www.geeksforgeeks.org/print-all-the-duplicates-in-the-input-string/) | | | | | | | 37 | | Easy | [Implement Strstr](https://leetcode.com/problems/implement-strstr/) | | | | | - | | 38 | | Easy | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | | | | | | | 39 | | Easy | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/) | | - | | - | | | 40 | | Medium | [Integer To Roman](https://leetcode.com/problems/integer-to-roman/) | | - | | | | | 41 | | Medium | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | | | | | - | | 42 | | Medium | [Simplify Path](https://leetcode.com/problems/simplify-path/) | | - | | | | | 43 | | Medium | [Smallest Window In A String Containing All The Characters Of Another String](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string-1587115621/1) | | - | | | | | 44 | | Medium | [Reverse Words In A String](https://leetcode.com/problems/reverse-words-in-a-string/) | | - | | | | | 45 | | Medium | [Rabin Karp Algorithm For Pattern Searching](https://www.geeksforgeeks.org/rabin-karp-algorithm-for-pattern-searching/) | | | | | - | | 46 | | Medium | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | | | | | | | 47 | | Medium | [Word Wrap](https://practice.geeksforgeeks.org/problems/word-wrap1646/1) | | | | | - | | 48 | | Medium | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | | | | | | | 49 | | Hard | [Valid Number](https://leetcode.com/problems/valid-number/) | | | - | | | | 50 | | Hard | [Integer To English Words](https://leetcode.com/problems/integer-to-english-words/) | | | | | | | 51 | | Hard | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | | | | | - | | 52 | | Hard | [Text Justification](https://leetcode.com/problems/text-justification/) | | | | | | | 53 | | Hard | [Boyer Moore Algorithm For Pattern Searching](https://www.geeksforgeeks.org/boyer-moore-algorithm-for-pattern-searching/) | | | - | | | | 54 | | Hard | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/) | | | | | | | 55 | | | | | | | | | | 56 | | | Matrix Problems | | | | | | | 57 | | Medium | [Maximum Size Rectangle Binary Sub Matrix 1S](https://www.geeksforgeeks.org/maximum-size-rectangle-binary-sub-matrix-1s/) | | | | | | | 58 | | Medium | [Find Number Of Islands](https://www.geeksforgeeks.org/find-number-of-islands/) | | | | | | | 59 | | Medium | [Given Matrix O X Replace O X Surrounded X](https://www.geeksforgeeks.org/given-matrix-o-x-replace-o-x-surrounded-x/) | | | | | | | 60 | | Medium | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | | | | | - | | 61 | | Medium | [Rotate Image](https://leetcode.com/problems/rotate-image/) | | | | | - | | 62 | | | | | | | | - | | 63 | | | Mathematical Problems | | | | | | | 64 | | Easy | [Minimum Moves To Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) | | | | | | | 65 | | Easy | [Add Binary](https://leetcode.com/problems/add-binary/) | | | | | | | 66 | | Easy | [Maximum Product Of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/) | | | | | | | 67 | | Easy | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/) | | | | | | | 68 | | Easy | [Happy Number](https://leetcode.com/problems/happy-number/) | | | | | - | | 69 | | Easy | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | | | | | | | 70 | | Easy | [Missing Number](https://leetcode.com/problems/missing-number/) | | - | | | | | 71 | | Easy | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | | | | | | | 72 | | Easy | [Power Of Two](https://leetcode.com/problems/power-of-two/) | | | | | | | 73 | | Medium | [Max Points On A Line](https://leetcode.com/problems/max-points-on-a-line/) | | | | | | | 74 | | Medium | [Valid Square](https://leetcode.com/problems/valid-square/) | | | | | - | | 75 | | Medium | [The Kth Factor Of N](https://leetcode.com/problems/the-kth-factor-of-n/) | | | | | | | 76 | | | | | | | | | | 77 | | | Sorting and Searching | | | | | | - | 78 | | Easy | [Permute Two Arrays Sum Every Pair Greater Equal K](https://www.geeksforgeeks.org/permute-two-arrays-sum-every-pair-greater-equal-k/) | | | | - | | | 79 | | Easy | [Ceiling In A Sorted Array](https://www.geeksforgeeks.org/ceiling-in-a-sorted-array/) | | | | | | | 80 | | Easy | [Find A Pair With The Given Difference](https://www.geeksforgeeks.org/find-a-pair-with-the-given-difference/) | | | - | | - | | 81 | | Easy | [Permute Two Arrays Sum Every Pair Greater Equal K](https://www.geeksforgeeks.org/permute-two-arrays-sum-every-pair-greater-equal-k/) | | | | | | | 82 | | Medium | [Check Reversing Sub Array Make Array Sorted](https://www.geeksforgeeks.org/check-reversing-sub-array-make-array-sorted/) | | | | | | | 83 | | Medium | [Radix Sort](https://www.geeksforgeeks.org/radix-sort/) | | - | | | | | 84 | | Medium | [A Product Array Puzzle](https://www.geeksforgeeks.org/a-product-array-puzzle/) | | | | | | | 85 | | Medium | [Make Array Elements Equal Minimum Cost](https://www.geeksforgeeks.org/make-array-elements-equal-minimum-cost/) | | | | | | - | 86 | | Medium | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | | | | | | | 87 | | Hard | [Allocate Missing Number of Pages](https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages0937/1) | | | | - | | | 88 | | Hard | [Minimum Number Swaps Required Sort Array](https://www.geeksforgeeks.org/minimum-number-swaps-required-sort-array/) | | | | | | | 89 | | Hard | https://www.spoj.com/problems/AGGRCOW/ | | | | | | - | 90 | | Hard | [Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | | | | | - | | 91 | | Hard | [Count Of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) | | | | | | | 92 | | Hard | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/) | | | - | | | | 93 | | | | | | | | | | 94 | | | Linked List | | | | | | | 95 | | Easy | [Middle Of The Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | | | | | | | 96 | | Easy | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | | - | | | | | 97 | | Easy | [Convert Binary Number In A Linked List To Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/) | | | | | | - | 98 | | Easy | [Remove Duplicates From Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | | | | | | | 99 | | Easy | [Sort A Linked List Of 0S 1S Or 2S](https://www.geeksforgeeks.org/sort-a-linked-list-of-0s-1s-or-2s/) | | | | | | | 100 | | Easy | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | | | | | - | | 101 | | Easy | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | | | | | - | - | 102 | | Easy | [Multiply Two Numbers Represented Linked Lists](https://www.geeksforgeeks.org/multiply-two-numbers-represented-linked-lists/) | | | | | | | 103 | | Easy | [Intersection Of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | | | | | - | | 104 | | Easy | [Given Only A Pointer To A Node To Be Deleted In A Singly Linked List How Do You Delete It](https://www.geeksforgeeks.org/given-only-a-pointer-to-a-node-to-be-deleted-in-a-singly-linked-list-how-do-you-delete-it/) | | | | | | | 105 | | Easy | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | | | | | - | - | 106 | | Medium | [Copy List With Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) | | | | | | | 107 | | Medium | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/) | | | | | | | 108 | | Medium | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) | | | - | | | | 109 | | Medium | [Remove Nth Node From End Of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | | | | | | | 110 | | Medium | [Flatten A Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/) | | | | | | | 111 | | Medium | [Partition List](https://leetcode.com/problems/partition-list/) | | | | | | - | 112 | | Medium | [Remove Duplicates From Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | | | | | - | | 113 | | Medium | [Linked List In Zig Zag Fashion](https://www.geeksforgeeks.org/linked-list-in-zig-zag-fashion/) | | | | | | | 114 | | Medium | [Segregate Even And Odd Elements In A Linked List](https://www.geeksforgeeks.org/segregate-even-and-odd-elements-in-a-linked-list/) | | | | | | | 115 | | Medium | [Rearrange A Given Linked List In Place](https://www.geeksforgeeks.org/rearrange-a-given-linked-list-in-place/) | | | | | | | 116 | | Hard | [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | | | | | | | 117 | | Hard | [Reverse Nodes In K Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | | | - | | | | 118 | | Hard | [Merge Sort For Linked List](https://www.geeksforgeeks.org/merge-sort-for-linked-list/) | | | | | | - | 119 | | Hard | [Flattening A Linked List](https://www.geeksforgeeks.org/flattening-a-linked-list/) | | | | | | | 120 | | Hard | [Subtract Two Numbers Represented As Linked Lists](https://www.geeksforgeeks.org/subtract-two-numbers-represented-as-linked-lists/) | | | | | | | 121 | | | | | | | | | | 122 | | | Stacks and Queues | | | | | | | 123 | | Easy | [Implement Queue Using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | | | | | | | 124 | | Easy | [Implement Stack Using Queues](https://leetcode.com/problems/implement-stack-using-queues/) | | - | | | | | 125 | | Easy | [Implement Stack Queue Using Deque](https://www.geeksforgeeks.org/implement-stack-queue-using-deque/) | | | | - | | - | 126 | | Easy | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) | | | | | | | 127 | | Easy | [Stack Set 4 Evaluation Postfix Expression](https://www.geeksforgeeks.org/stack-set-4-evaluation-postfix-expression/) | | | | | - | | 128 | | Easy | [Implement Two Stacks In An Array](https://www.geeksforgeeks.org/implement-two-stacks-in-an-array/) | | | | | | | 129 | | Medium | [Minimum Cost Tree From Leaf Values](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/) | | | | | | | 130 | | Medium | [Disatance of Nearest Cell Having 1](https://practice.geeksforgeeks.org/problems/distance-of-nearest-cell-having-1-1587115620/1) | | | | | | - | 131 | | Medium | [Online Stock Span](https://leetcode.com/problems/online-stock-span/) | | - | | | | | 132 | | Medium | [Rotten Oranges](https://practice.geeksforgeeks.org/problems/rotten-oranges2536/1) | | | | - | | | 133 | | Medium | [Sum Of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums/) | | | | | - | | 134 | | Medium | [Circular Tour](https://practice.geeksforgeeks.org/problems/circular-tour/1) | | | | | | | 135 | | Medium | [Remove All Adjacent Duplicates In String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | | - | | | | | 136 | | Medium | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) | | | | | | | 137 | | Hard | [Find The Maximum Of Minimums For Every Window Size In A Given Array](https://www.geeksforgeeks.org/find-the-maximum-of-minimums-for-every-window-size-in-a-given-array/) | | | | - | - | | 138 | | Hard | [Lru Cache Implementation](https://www.geeksforgeeks.org/lru-cache-implementation/) | | | | | | - | 139 | | Hard | [The Celebrity Problem](http://geeksforgeeks.org/the-celebrity-problem/) | | | | | | | 140 | | | | | | | - | | | 141 | | | Trees | | | | | | | 142 | | Easy | [Diameter Of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | | | | | | | 143 | | Easy | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | | | - | | | | 144 | | Easy | [Subtree Of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) | | | - | | | - | 145 | | Easy | [Range Sum Of Bst](https://leetcode.com/problems/range-sum-of-bst/) | | | | | | | 146 | | Easy | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | - | | - | | | | 147 | | Easy | [Convert Sorted Array To Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | | | | | | | 148 | | Easy | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | | | | | | | 149 | | Easy | [Maximum Depth Of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | | | | | | | 150 | | Easy | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/) | | | | - | | - | 151 | | Easy | [Same Tree](https://leetcode.com/problems/same-tree/) | | | | | | | 152 | | Easy | [Lowest Common Ancestor Of A Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | - | | | | | | 153 | | Easy | [Path Sum](https://leetcode.com/problems/path-sum/) | | | | | | | 154 | | Easy | [Minimum Absolute Difference In Bst](https://leetcode.com/problems/minimum-absolute-difference-in-bst/) | | | | | | | 155 | | Easy | [Sum Of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | | | | - | | - | 156 | | Easy | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | | | | | | - | 157 | | Easy | [Predecessor and Successor](https://practice.geeksforgeeks.org/problems/predecessor-and-successor/1) | | | | | | | 158 | | Easy | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | | | | | | | 159 | | Easy | [Check Whether BST Contains Dead End](https://practice.geeksforgeeks.org/problems/check-whether-bst-contains-dead-end/1) | | | | | | | 160 | | Medium | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | | | | | | | 161 | | Medium | [Lowest Common Ancestor Of A Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | | | | | | | 162 | | Medium | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/) | | | | | | | 163 | | Medium | [All Nodes Distance K In Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/) | | | | | | - | 164 | | Medium | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | | - | | | | | 165 | | Medium | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | | | | | | | 166 | | Medium | [Redundant Connection](https://leetcode.com/problems/redundant-connection/) | | | | | | | 167 | | Medium | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | | | | | | | 168 | | Medium | [Path Sum III](https://leetcode.com/problems/path-sum-iii/) | | | | | | - | 169 | | Medium | [Construct Binary Tree From Preorder And Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/) | | | - | | - | | 170 | | Medium | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) | | - | | | - | - | 171 | | Medium | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/) | | | | | - | | 172 | | Medium | [Populating Next Right Pointers In Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) | | | | - | - | - | 173 | | Medium | [Flatten Binary Tree To Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) | | | | | | | 174 | | Medium | [Maximum Width Of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/) | | | | | | | 175 | | Medium | [Min Distance Between Two Given Nodes Of A Binary Tree](https://practice.geeksforgeeks.org/problems/min-distance-between-two-given-nodes-of-a-binary-tree/1) | | | - | | | | 176 | | Medium | [Kth Smallest Element In A Bst](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | | - | | | | | 177 | | Medium | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) | | | | | - | | 178 | | Medium | [Count BST Nodes](https://practice.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-given-range/1) | | | | | | | 179 | | Medium | [Preorder To Postorder](https://practice.geeksforgeeks.org/problems/preorder-to-postorder4423/1) | | | - | | | - | 180 | | Hard | [Binary Tree To DLL](https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1) | | | | | | | 181 | | Hard | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | | | | - | | | 182 | | Hard | [Sum Of Distances In Tree](https://leetcode.com/problems/sum-of-distances-in-tree/) | | | | | - | | 183 | | Hard | [Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras/) | | | - | - | | | 184 | | Hard | [Vertical Order Traversal Of A Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) | | | - | | | | 185 | | Hard | [Print K Sum Paths Binary Tree](https://www.geeksforgeeks.org/print-k-sum-paths-binary-tree/) | | | - | | | | 186 | | Hard | [Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | | | - | | | | 187 | | Hard | [Find Median Bst Time O1 Space](https://www.geeksforgeeks.org/find-median-bst-time-o1-space/) | | | | | | | 188 | | Hard | [Largest Bst Binary Tree Set 2](https://www.geeksforgeeks.org/largest-bst-binary-tree-set-2/) | | | | | | - | 189 | | Hard | [Construct Bst From Given Preorder Traversa](https://www.geeksforgeeks.org/construct-bst-from-given-preorder-traversa/) | | | | | | | 190 | | | | | | | | | | 191 | | | GRAPHS | | | | | | | 192 | | Easy | [BFS Traversal Of Graph](https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1) | | | | - | | | 193 | | Easy | [Depth First Search Or Dfs For A Graph](https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/) | | - | | | | | 194 | | Easy | [Number Of Islands](https://leetcode.com/problems/number-of-islands/) | | | | | | | 195 | | Easy | [Flood Fill](https://leetcode.com/problems/flood-fill/) | | | | - | | | 196 | | Easy | [Rat In A Maze Problem](https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1) | | | | | | | 197 | | Easy | [Detect Cycle In An Undirected Graph](https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1) | | | | | | | 198 | | Easy | [Detect Cycle In A Graph](https://www.geeksforgeeks.org/detect-cycle-in-a-graph/) | | | | | | | 199 | | Medium | [Steps By Knight](https://practice.geeksforgeeks.org/problems/steps-by-knight5927/1) | | - | | | | | 200 | | Medium | [Decode String](https://leetcode.com/problems/decode-string/) | | - | | | | | 201 | | Medium | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge/) | | - | | | | | 202 | | Medium | [Number Of Operations To Make Network Connected](https://leetcode.com/problems/number-of-operations-to-make-network-connected/) | | - | | - | | | 203 | | Medium | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states/) | | | | | | | 204 | | Medium | [Strongly Connected Componenets](https://practice.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1) | | | | | | | 205 | | Medium | [Time Needed To Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/) | | - | | | | | 206 | | Medium | [Graph Colour Applications](https://www.geeksforgeeks.org/graph-coloring-applications/#:~:text=Graph%20coloring%20problem%20is%20to,are%20colored%20using%20same%20color) | | | | | | | 207 | | Medium | [Most Stones Removed With Same Row Or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/) | | | | | | | 208 | | Medium | [As Far From Land As Possible](https://leetcode.com/problems/as-far-from-land-as-possible/) | | | | | | | 209 | | Medium | [Find The City With The Smallest Number Of Neighbors At A Threshold Distance](https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/) | | | | | | | 210 | | Medium | [Find Whether It Is Possible To Finish All Tasks Or Not From Given Dependencies](https://www.geeksforgeeks.org/find-whether-it-is-possible-to-finish-all-tasks-or-not-from-given-dependencies/) | | | | | | | 211 | | Medium | [Prims Minimum Spanning Tree Mst Greedy Algo 5](https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/) | | | | - | | | 212 | | Medium | [Implementing Floyd Warshall](https://practice.geeksforgeeks.org/problems/implementing-floyd-warshall2042/1) | | | | | | | 213 | | Medium | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) | | | | | | | 214 | | Medium | [Snakes And Ladders](https://leetcode.com/problems/snakes-and-ladders/) | | | | | | | 215 | | Medium | [Topological Sort](https://practice.geeksforgeeks.org/problems/topological-sort/1) | | | | | | - | 216 | | Medium | https://leetcode.com/problems/cheapest-flights-within-k-stops/description/ | | | - | | - | | 217 | | Medium | [Detect Negative Cycle Graph Bellman Ford](https://www.geeksforgeeks.org/detect-negative-cycle-graph-bellman-ford/) | | | | | | | 218 | | Medium | [Bipartite Graph](https://www.geeksforgeeks.org/bipartite-graph/) | | | | | | | 219 | | Hard | [Longest Increasing Path In A Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/) | | - | | | | | 220 | | Hard | [Making A Large Island](https://leetcode.com/problems/making-a-large-island/) | | | | | | | 221 | | Hard | [Remove Boxes](https://leetcode.com/problems/remove-boxes/) | | | | | - | - | 222 | | Hard | [Critical Connections In A Network](https://leetcode.com/problems/critical-connections-in-a-network/) | | | | - | | | 223 | | Hard | [Alien Dictionary](https://practice.geeksforgeeks.org/problems/alien-dictionary/1) | | | | - | | v | 224 | | Hard | [Water Jug Problem Using Bfs](https://www.geeksforgeeks.org/water-jug-problem-using-bfs/) | | | | | | | 225 | | Hard | [Travelling Salesman Problem Set 1](https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/) | | | | - | - | - | 226 | | Hard | [Total Number Spanning Trees Graph](https://www.geeksforgeeks.org/total-number-spanning-trees-graph/) | | | | | | | 227 | | Hard | [Word Ladder](https://leetcode.com/problems/word-ladder/) | | | | | | | 228 | | Hard | [Minimize Cash Flow Among Given Set Friends Borrowed Money](https://www.geeksforgeeks.org/minimize-cash-flow-among-given-set-friends-borrowed-money/) | | | | | | | 229 | | | | | | | | | | 230 | | | Tries | | | | | | | 231 | | Medium | [Design Add And Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | | | | | | | 232 | | Medium | [Word Break Problem Trie Solution](https://www.geeksforgeeks.org/word-break-problem-trie-solution/) | | - | | | | | 233 | | Medium | [Trie Insert And Search](https://www.geeksforgeeks.org/trie-insert-and-search/) | | - | | | | | 234 | | Medium | [K- Anagrams](https://practice.geeksforgeeks.org/problems/k-anagrams-1/0) | | - | | | | | 235 | | Hard | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) | | - | | | | | 236 | | Hard | [Phone Directory](https://practice.geeksforgeeks.org/problems/phone-directory/0) | | | | | | | 237 | | | | | | | | | | 238 | | | Heaps / PQs | | | | | | | 239 | | | | | | | | | | 240 | | Easy/Medium | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | | | | | | | 241 | | Easy/Medium | [Kth Largest Element In An Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | | | | | | | 242 | | Easy/Medium | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii/) | | | | | | | 243 | | Easy/Medium | [Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/) | | | | | | | 244 | | Easy/Medium | [Kth Smallest Element In A Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/) | | | | | | | 245 | | Easy/Medium | [Reorganize String](https://leetcode.com/problems/reorganize-string/) | | | | | | | 246 | | Easy/Medium | [Find The Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/) | | | | | | | 247 | | Easy/Medium | [Smallest Positive Missing Number](https://practice.geeksforgeeks.org/problems/smallest-positive-missing-number-1587115621/1/) | | | | | | | 248 | | Easy/Medium | [Largest Subarray with 0 Sum](https://practice.geeksforgeeks.org/problems/largest-subarray-with-0-sum/1/) | | | | - | | | 249 | | Easy/Medium | [K Closest Points To Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | | | | | | | 250 | | Hard | [Minimum Number Of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops/) | | | | | | | 251 | | Hard | [Minimum Cost To Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers/) | | - | | | | | 252 | | Hard | [Swim In Rising Water](https://leetcode.com/problems/swim-in-rising-water/) | | | | | | | 253 | | Hard | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | | | | | | | 254 | | | | | | | | | | 255 | | | Dynamic Programming | | | | | | | 256 | | Easy | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | | | | | | | 257 | | Easy | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | | | - | | | | 258 | | Easy | [Ones And Zeroes](https://leetcode.com/problems/ones-and-zeroes/) | | | | | | - | 259 | | Easy | [Counting Bits](https://leetcode.com/problems/counting-bits/) | | | | | - | | 260 | | Medium | [Knight Dialer](https://leetcode.com/problems/knight-dialer/) | | | | | | | 261 | | Medium | [Cutted Segments](https://practice.geeksforgeeks.org/problems/cutted-segments1642/1) | | | | | | | 262 | | Medium | [Unique Paths](https://leetcode.com/problems/unique-paths/) | | - | | | | | 263 | | Medium | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | | - | | | | | 264 | | Medium | [Coin Change](https://leetcode.com/problems/coin-change/) | | | | | | - | 265 | | Medium | [Decode Ways](https://leetcode.com/problems/decode-ways/) | | - | | | - | | 266 | | Medium | [Maximum Length Of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | | | | | - | | 267 | | Medium | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | | | | | | | 268 | | Medium | [Longest Common Substring](https://practice.geeksforgeeks.org/problems/longest-common-substring1452/1) | | | | | - | | 269 | | Medium | [Count Square Submatrices With All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/) | | | - | | | | 270 | | Medium | [Maximal Square](https://leetcode.com/problems/maximal-square/) | | | | | | | 271 | | Medium | [Mobile Numeric Keypad](https://practice.geeksforgeeks.org/problems/mobile-numeric-keypad5456/1) | | | | | | | 272 | | Medium | [Weighted Job Scheduling](https://www.geeksforgeeks.org/weighted-job-scheduling/) | | | | | | | 273 | | Medium | [Delete And Earn](https://leetcode.com/problems/delete-and-earn/) | | | | | | | 274 | | Medium | [Range Sum Query 2D Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | | | | | - | | 275 | | Hard | [Optimal Binary Search Tree Dp 24](https://www.geeksforgeeks.org/optimal-binary-search-tree-dp-24/) | | | | | | | 276 | | Hard | [Frog Jump](https://leetcode.com/problems/frog-jump/) | | | | | | | 277 | | Hard | [Best Time To Buy And Sell Stock Iv](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | | | - | | | | 278 | | Hard | [Minimum Insertion Steps To Make A String Palindrome](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/) | | | | | | | 279 | | Hard | [Largest Area Rectangular Sub Matrix Equal Number 1S 0S](https://www.geeksforgeeks.org/largest-area-rectangular-sub-matrix-equal-number-1s-0s/) | | | | | | - | 280 | | Hard | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | | - | | | | | 281 | | Hard | [Minimum Cost To Merge Stones](https://leetcode.com/problems/minimum-cost-to-merge-stones/) | | - | | | | | 282 | | Hard | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences/) | | - | | | | | 283 | | Hard | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/) | | - | | | | | 284 | | Hard | [Burst Balloons](https://leetcode.com/problems/burst-balloons/) | | | | | | | 285 | | Hard | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop/) | | | | | | | 286 | | | | | | | | | - | 287 | | | Two Pointer Approach | | | | | | | 288 | | Medium | [Sort Colors](https://leetcode.com/problems/sort-colors/) | | | | | - | | 289 | | Medium | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | | | | | | | 290 | | Medium | [Maximum Number Of Visible Points](https://leetcode.com/problems/maximum-number-of-visible-points/) | | | | | | | 291 | | | | | | | | | | 292 | | | | | | | | | | 293 | | | Greedy Algorithms | | | | | | | 294 | | Easy/Medium | [Gas Station](https://leetcode.com/problems/gas-station/) | | | | | | | 295 | | Easy/Medium | [Minimum Cost For Acquiring All Coins With K Extra Coins Allowed With Every Coin](https://www.geeksforgeeks.org/minimum-cost-for-acquiring-all-coins-with-k-extra-coins-allowed-with-every-coin/) | | | | | | | 296 | | Easy/Medium | [Restore The Array From Adjacent Pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/) | | | | | | - | 297 | | Easy/Medium | [Task Scheduler](https://leetcode.com/problems/task-scheduler/) | | | | | | | 298 | | Easy/Medium | [Minimum Deletions To Make Character Frequencies Unique](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/) | | | | | - | | 299 | | Easy/Medium | [Remove K Digits](https://leetcode.com/problems/remove-k-digits/) | | | | | - | | 300 | | Easy/Medium | https://www.spoj.com/problems/CHOCOLA/ | | | | | - | | 301 | | Easy/Medium | [Non Overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) | | | | | - | | 302 | | Easy/Medium | [Minimum Deletion Cost To Avoid Repeating Letters](https://leetcode.com/problems/minimum-deletion-cost-to-avoid-repeating-letters/) | | | | | | | 303 | | Easy/Medium | [Minimum Sum Two Numbers Formed Digits Array 2](https://www.geeksforgeeks.org/minimum-sum-two-numbers-formed-digits-array-2/) | | | | | | | 304 | | | | | | | | | - | 305 | | | | | | | | | | 306 | | | Backtracking | | | | | | | 307 | | Medium | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) | | | | | | | 308 | | Medium | [Smallest Subset Problem](https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1) | | | | | | | 309 | | Medium | [Combinations](https://leetcode.com/problems/combinations/) | - | | | | | - | 310 | | Medium | [Subsets II](https://leetcode.com/problems/subsets-ii/) | | | | | | | 311 | | Medium | [M Colouring Problem](https://practice.geeksforgeeks.org/problems/m-coloring-problem-1587115620/1) | | | | | | | 312 | | Medium | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/) | | | | | | | 313 | | Medium | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) | | | | | - | | 314 | | Medium | [Permutations II](https://leetcode.com/problems/permutations-ii/) | | | | | | | 315 | | Hard | [Word Search II](https://leetcode.com/problems/word-search-ii/) | - | | | | | | 316 | | Hard | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | | | - | | | | 317 | | Hard | [N Queens](https://leetcode.com/problems/n-queens/) | | | | | | | 318 | | Hard | [Unique Paths III](https://leetcode.com/problems/unique-paths-iii/) | | | | | - | | 319 | | Hard | [Find Maximum Number Possible By Doing At Most K Swaps](https://www.geeksforgeeks.org/find-maximum-number-possible-by-doing-at-most-k-swaps/) | | | | | | | 320 | | Hard | [Partition Set K Subsets Equal Sum](https://www.geeksforgeeks.org/partition-set-k-subsets-equal-sum/) | | | | | - | | 321 | | Hard | [Tug Of War](https://www.geeksforgeeks.org/tug-of-war/) | | | | | - | | 322 | | Hard | [Find Paths From Corner Cell To Middle Cell In Maze](https://www.geeksforgeeks.org/find-paths-from-corner-cell-to-middle-cell-in-maze/) | | - | | | | | 323 | | Hard | [Solving Cryptarithmetic Puzzles Backtracking 8](https://www.geeksforgeeks.org/solving-cryptarithmetic-puzzles-backtracking-8/) | | | | | | | 324 | | Hard | [Print Palindromic Partitions String](https://www.geeksforgeeks.org/print-palindromic-partitions-string/) | | | | | | | 325 | | | | | | | | | | 326 | | | Segment Tree | | | | | | | 327 | | Medium/Hard | [Range Sum Query Immutable](https://leetcode.com/problems/range-sum-query-immutable/) | - | | | | | | 328 | | Medium/Hard | [Range Sum Query Mutable](https://leetcode.com/problems/range-sum-query-mutable/) | | | | - | | | 329 | | Medium/Hard | [Count Of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) | | | | | | | 330 | | Medium/Hard | [Count Of Range Sum](https://leetcode.com/problems/count-of-range-sum/) | | | | | - | | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | ## How to use? 2 | 3 | To use this template and keep a record of your codes and progress for #CrackYourInternship #CrackYourPlacement Challenge - #ReviseWithArsh 4 | daily, follow the instructions below: 5 | 6 | 1. Fork the Repository: 7 | 8 | - Click on the "Use this template" button and click on "Create a new repository". 9 | - This will create a copy of the repository in your GitHub account. 10 | 11 | 2. Keep track of your solutions: 12 | 13 | - Create a new directory for the day's code. For example, you can create a directory named "Day1" for the first day's code. 14 | - Inside the day's directory, create a new file with a meaningful name, such as "problem1.cpp" or "solution.py". 15 | - Paste your code for the chosen problem in this file. 16 | 17 | 3. Update Your Progress: 18 | 19 | - After solving the daily DSA problem, update your progress in the repository. 20 | - Open the "README.md" file in a text editor. 21 | - Add a new entry for the day, including the problem description and the file name where you have written the code. 22 | - Save the changes to the "README.md" file. 23 | 24 | 4. Repeat for Each Day: 25 | 26 | - Repeat steps 2 and 3 for everyday. 27 | - Create a new directory for each day, write your code, and update the "README.md" file accordingly. 28 | 29 | 30 |

31 | 32 | 33 | | | | Status | Goldman Sachs | Amazon | Walmart | Salesforce | Microsoft | 34 | | --- | --- | --- | --- | --- | --- | --- | --- | 35 | | | Arrays | | | | | | | 36 | | Easy | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | ✅ | | | | | - | 37 | | Easy | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | ✅ | - | | - | - | | 38 | | Easy | [Best Time To Buy And Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | | - | | | | | 39 | | Easy | [Chocolate Distribution Problem](https://www.geeksforgeeks.org/chocolate-distribution-problem/) | | | | | | | 40 | | Easy | [Find The Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | | - | | | | | 41 | | Easy | [Sort Colors](https://leetcode.com/problems/sort-colors/) | | | | | - | | 42 | | Easy | [Remove Duplicates From Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | | | | | | | 43 | | Easy | [Two Sum](https://leetcode.com/problems/two-sum/) | | | | | | | 44 | | Easy | [Best Time To Buy And Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | | | | - | | | 45 | | Medium | [Subarray Sums Divisible By K](https://leetcode.com/problems/subarray-sums-divisible-by-k/) | | | | | | | 46 | | Medium | [Find All Duplicates In An Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/) | | | | | | - | 47 | | Medium | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | | | - | | | | 48 | | Medium | [3Sum](https://leetcode.com/problems/3sum/) | | - | | | | | 49 | | Medium | [4Sum](https://leetcode.com/problems/4sum/) | | | - | | | | 50 | | Medium | [Maximum Points You Can Obtain From Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/) | | | - | | | | 51 | | Medium | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | | | | | | - | 52 | | Medium | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | | | | | | | 53 | | Medium | [Word Search](https://leetcode.com/problems/word-search/) | | | | | | | 54 | | Medium | [Jump Game](https://leetcode.com/problems/jump-game/) | | | | | | | 55 | | Medium | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | | | | | | | 56 | | Medium | [Majority Element](https://leetcode.com/problems/majority-element/) | | | | | | | 57 | | Medium | [Reverse Pairs](https://leetcode.com/problems/reverse-pairs/) | | | | - | | | 58 | | Medium | [Print All Possible Combinations Of R Elements In A Given Array Of Size N](https://www.geeksforgeeks.org/print-all-possible-combinations-of-r-elements-in-a-given-array-of-size-n/) | | | | - | | | 59 | | Medium | [Game Of Life](https://leetcode.com/problems/game-of-life/) | | | | - | | | 60 | | Hard | [Max Value Of Equation](https://leetcode.com/problems/max-value-of-equation/) | | | | - | | | 61 | | Hard | [Insert Delete Getrandom O1 Duplicates Allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/) | | | | | | | 62 | | Hard | [Largest Rectangle In Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) | | | | | | | 63 | | Hard | [Max Value Of Equation](https://leetcode.com/problems/max-value-of-equation/) | | | | | | | 64 | | | | | | | | | | 65 | | | | | | | | | | 66 | | | Strings | | | | | | | 67 | | Easy | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | | | | | - | | 68 | | Easy | [Print All The Duplicates In The Input String](https://www.geeksforgeeks.org/print-all-the-duplicates-in-the-input-string/) | | | | | | | 69 | | Easy | [Implement Strstr](https://leetcode.com/problems/implement-strstr/) | | | | | - | | 70 | | Easy | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | | | | | | | 71 | | Easy | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/) | | - | | - | | | 72 | | Medium | [Integer To Roman](https://leetcode.com/problems/integer-to-roman/) | | - | | | | | 73 | | Medium | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | | | | | - | | 74 | | Medium | [Simplify Path](https://leetcode.com/problems/simplify-path/) | | - | | | | | 75 | | Medium | [Smallest Window In A String Containing All The Characters Of Another String](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string-1587115621/1) | | - | | | | | 76 | | Medium | [Reverse Words In A String](https://leetcode.com/problems/reverse-words-in-a-string/) | | - | | | | | 77 | | Medium | [Rabin Karp Algorithm For Pattern Searching](https://www.geeksforgeeks.org/rabin-karp-algorithm-for-pattern-searching/) | | | | | - | | 78 | | Medium | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | | | | | | | 79 | | Medium | [Word Wrap](https://practice.geeksforgeeks.org/problems/word-wrap1646/1) | | | | | - | | 80 | | Medium | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | | | | | | | 81 | | Hard | [Valid Number](https://leetcode.com/problems/valid-number/) | | | - | | | | 82 | | Hard | [Integer To English Words](https://leetcode.com/problems/integer-to-english-words/) | | | | | | | 83 | | Hard | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | | | | | - | | 84 | | Hard | [Text Justification](https://leetcode.com/problems/text-justification/) | | | | | | | 85 | | Hard | [Boyer Moore Algorithm For Pattern Searching](https://www.geeksforgeeks.org/boyer-moore-algorithm-for-pattern-searching/) | | | - | | | | 86 | | Hard | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/) | | | | | | | 87 | | | | | | | | | | 88 | | | Matrix Problems | | | | | | | 89 | | Medium | [Maximum Size Rectangle Binary Sub Matrix 1S](https://www.geeksforgeeks.org/maximum-size-rectangle-binary-sub-matrix-1s/) | | | | | | | 90 | | Medium | [Find Number Of Islands](https://www.geeksforgeeks.org/find-number-of-islands/) | | | | | | | 91 | | Medium | [Given Matrix O X Replace O X Surrounded X](https://www.geeksforgeeks.org/given-matrix-o-x-replace-o-x-surrounded-x/) | | | | | | | 92 | | Medium | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | | | | | - | | 93 | | Medium | [Rotate Image](https://leetcode.com/problems/rotate-image/) | | | | | - | | 94 | | | | | | | | - | | 95 | | | Mathematical Problems | | | | | | | 96 | | Easy | [Minimum Moves To Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) | | | | | | | 97 | | Easy | [Add Binary](https://leetcode.com/problems/add-binary/) | | | | | | | 98 | | Easy | [Maximum Product Of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/) | | | | | | | 99 | | Easy | [Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/) | | | | | | | 100 | | Easy | [Happy Number](https://leetcode.com/problems/happy-number/) | | | | | - | | 101 | | Easy | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | | | | | | | 102 | | Easy | [Missing Number](https://leetcode.com/problems/missing-number/) | | - | | | | | 103 | | Easy | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | | | | | | | 104 | | Easy | [Power Of Two](https://leetcode.com/problems/power-of-two/) | | | | | | | 105 | | Medium | [Max Points On A Line](https://leetcode.com/problems/max-points-on-a-line/) | | | | | | | 106 | | Medium | [Valid Square](https://leetcode.com/problems/valid-square/) | | | | | - | | 107 | | Medium | [The Kth Factor Of N](https://leetcode.com/problems/the-kth-factor-of-n/) | | | | | | | 108 | | | | | | | | | | 109 | | | Sorting and Searching | | | | | | - | 110 | | Easy | [Permute Two Arrays Sum Every Pair Greater Equal K](https://www.geeksforgeeks.org/permute-two-arrays-sum-every-pair-greater-equal-k/) | | | | - | | | 111 | | Easy | [Ceiling In A Sorted Array](https://www.geeksforgeeks.org/ceiling-in-a-sorted-array/) | | | | | | | 112 | | Easy | [Find A Pair With The Given Difference](https://www.geeksforgeeks.org/find-a-pair-with-the-given-difference/) | | | - | | - | | 113 | | Easy | [Permute Two Arrays Sum Every Pair Greater Equal K](https://www.geeksforgeeks.org/permute-two-arrays-sum-every-pair-greater-equal-k/) | | | | | | | 114 | | Medium | [Check Reversing Sub Array Make Array Sorted](https://www.geeksforgeeks.org/check-reversing-sub-array-make-array-sorted/) | | | | | | | 115 | | Medium | [Radix Sort](https://www.geeksforgeeks.org/radix-sort/) | | - | | | | | 116 | | Medium | [A Product Array Puzzle](https://www.geeksforgeeks.org/a-product-array-puzzle/) | | | | | | | 117 | | Medium | [Make Array Elements Equal Minimum Cost](https://www.geeksforgeeks.org/make-array-elements-equal-minimum-cost/) | | | | | | - | 118 | | Medium | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | | | | | | | 119 | | Hard | [Allocate Missing Number of Pages](https://practice.geeksforgeeks.org/problems/allocate-minimum-number-of-pages0937/1) | | | | - | | | 120 | | Hard | [Minimum Number Swaps Required Sort Array](https://www.geeksforgeeks.org/minimum-number-swaps-required-sort-array/) | | | | | | | 121 | | Hard | https://www.spoj.com/problems/AGGRCOW/ | | | | | | - | 122 | | Hard | [Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | | | | | - | | 123 | | Hard | [Count Of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) | | | | | | | 124 | | Hard | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/) | | | - | | | | 125 | | | | | | | | | | 126 | | | Linked List | | | | | | | 127 | | Easy | [Middle Of The Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | | | | | | | 128 | | Easy | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | | - | | | | | 129 | | Easy | [Convert Binary Number In A Linked List To Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/) | | | | | | - | 130 | | Easy | [Remove Duplicates From Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | | | | | | | 131 | | Easy | [Sort A Linked List Of 0S 1S Or 2S](https://www.geeksforgeeks.org/sort-a-linked-list-of-0s-1s-or-2s/) | | | | | | | 132 | | Easy | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | | | | | - | | 133 | | Easy | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | | | | | - | - | 134 | | Easy | [Multiply Two Numbers Represented Linked Lists](https://www.geeksforgeeks.org/multiply-two-numbers-represented-linked-lists/) | | | | | | | 135 | | Easy | [Intersection Of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | | | | | - | | 136 | | Easy | [Given Only A Pointer To A Node To Be Deleted In A Singly Linked List How Do You Delete It](https://www.geeksforgeeks.org/given-only-a-pointer-to-a-node-to-be-deleted-in-a-singly-linked-list-how-do-you-delete-it/) | | | | | | | 137 | | Easy | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | | | | | - | - | 138 | | Medium | [Copy List With Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) | | | | | | | 139 | | Medium | [Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/) | | | | | | | 140 | | Medium | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) | | | - | | | | 141 | | Medium | [Remove Nth Node From End Of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | | | | | | | 142 | | Medium | [Flatten A Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/) | | | | | | | 143 | | Medium | [Partition List](https://leetcode.com/problems/partition-list/) | | | | | | - | 144 | | Medium | [Remove Duplicates From Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | | | | | - | | 145 | | Medium | [Linked List In Zig Zag Fashion](https://www.geeksforgeeks.org/linked-list-in-zig-zag-fashion/) | | | | | | | 146 | | Medium | [Segregate Even And Odd Elements In A Linked List](https://www.geeksforgeeks.org/segregate-even-and-odd-elements-in-a-linked-list/) | | | | | | | 147 | | Medium | [Rearrange A Given Linked List In Place](https://www.geeksforgeeks.org/rearrange-a-given-linked-list-in-place/) | | | | | | | 148 | | Hard | [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | | | | | | | 149 | | Hard | [Reverse Nodes In K Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | | | - | | | | 150 | | Hard | [Merge Sort For Linked List](https://www.geeksforgeeks.org/merge-sort-for-linked-list/) | | | | | | - | 151 | | Hard | [Flattening A Linked List](https://www.geeksforgeeks.org/flattening-a-linked-list/) | | | | | | | 152 | | Hard | [Subtract Two Numbers Represented As Linked Lists](https://www.geeksforgeeks.org/subtract-two-numbers-represented-as-linked-lists/) | | | | | | | 153 | | | | | | | | | | 154 | | | Stacks and Queues | | | | | | | 155 | | Easy | [Implement Queue Using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | | | | | | | 156 | | Easy | [Implement Stack Using Queues](https://leetcode.com/problems/implement-stack-using-queues/) | | - | | | | | 157 | | Easy | [Implement Stack Queue Using Deque](https://www.geeksforgeeks.org/implement-stack-queue-using-deque/) | | | | - | | - | 158 | | Easy | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) | | | | | | | 159 | | Easy | [Stack Set 4 Evaluation Postfix Expression](https://www.geeksforgeeks.org/stack-set-4-evaluation-postfix-expression/) | | | | | - | | 160 | | Easy | [Implement Two Stacks In An Array](https://www.geeksforgeeks.org/implement-two-stacks-in-an-array/) | | | | | | | 161 | | Medium | [Minimum Cost Tree From Leaf Values](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values/) | | | | | | | 162 | | Medium | [Disatance of Nearest Cell Having 1](https://practice.geeksforgeeks.org/problems/distance-of-nearest-cell-having-1-1587115620/1) | | | | | | - | 163 | | Medium | [Online Stock Span](https://leetcode.com/problems/online-stock-span/) | | - | | | | | 164 | | Medium | [Rotten Oranges](https://practice.geeksforgeeks.org/problems/rotten-oranges2536/1) | | | | - | | | 165 | | Medium | [Sum Of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums/) | | | | | - | | 166 | | Medium | [Circular Tour](https://practice.geeksforgeeks.org/problems/circular-tour/1) | | | | | | | 167 | | Medium | [Remove All Adjacent Duplicates In String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | | - | | | | | 168 | | Medium | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) | | | | | | | 169 | | Hard | [Find The Maximum Of Minimums For Every Window Size In A Given Array](https://www.geeksforgeeks.org/find-the-maximum-of-minimums-for-every-window-size-in-a-given-array/) | | | | - | - | | 170 | | Hard | [Lru Cache Implementation](https://www.geeksforgeeks.org/lru-cache-implementation/) | | | | | | - | 171 | | Hard | [The Celebrity Problem](http://geeksforgeeks.org/the-celebrity-problem/) | | | | | | | 172 | | | | | | | - | | | 173 | | | Trees | | | | | | | 174 | | Easy | [Diameter Of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | | | | | | | 175 | | Easy | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | | | - | | | | 176 | | Easy | [Subtree Of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) | | | - | | | - | 177 | | Easy | [Range Sum Of Bst](https://leetcode.com/problems/range-sum-of-bst/) | | | | | | | 178 | | Easy | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | - | | - | | | | 179 | | Easy | [Convert Sorted Array To Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | | | | | | | 180 | | Easy | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | | | | | | | 181 | | Easy | [Maximum Depth Of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | | | | | | | 182 | | Easy | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/) | | | | - | | - | 183 | | Easy | [Same Tree](https://leetcode.com/problems/same-tree/) | | | | | | | 184 | | Easy | [Lowest Common Ancestor Of A Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | - | | | | | | 185 | | Easy | [Path Sum](https://leetcode.com/problems/path-sum/) | | | | | | | 186 | | Easy | [Minimum Absolute Difference In Bst](https://leetcode.com/problems/minimum-absolute-difference-in-bst/) | | | | | | | 187 | | Easy | [Sum Of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/) | | | | - | | - | 188 | | Easy | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | | | | | | - | 189 | | Easy | [Predecessor and Successor](https://practice.geeksforgeeks.org/problems/predecessor-and-successor/1) | | | | | | | 190 | | Easy | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) | | | | | | | 191 | | Easy | [Check Whether BST Contains Dead End](https://practice.geeksforgeeks.org/problems/check-whether-bst-contains-dead-end/1) | | | | | | | 192 | | Medium | [Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | | | | | | | 193 | | Medium | [Lowest Common Ancestor Of A Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | | | | | | | 194 | | Medium | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/) | | | | | | | 195 | | Medium | [All Nodes Distance K In Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/) | | | | | | - | 196 | | Medium | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | | - | | | | | 197 | | Medium | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | | | | | | | 198 | | Medium | [Redundant Connection](https://leetcode.com/problems/redundant-connection/) | | | | | | | 199 | | Medium | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | | | | | | | 200 | | Medium | [Path Sum III](https://leetcode.com/problems/path-sum-iii/) | | | | | | - | 201 | | Medium | [Construct Binary Tree From Preorder And Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal/) | | | - | | - | | 202 | | Medium | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) | | - | | | - | - | 203 | | Medium | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/) | | | | | - | | 204 | | Medium | [Populating Next Right Pointers In Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) | | | | - | - | - | 205 | | Medium | [Flatten Binary Tree To Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) | | | | | | | 206 | | Medium | [Maximum Width Of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/) | | | | | | | 207 | | Medium | [Min Distance Between Two Given Nodes Of A Binary Tree](https://practice.geeksforgeeks.org/problems/min-distance-between-two-given-nodes-of-a-binary-tree/1) | | | - | | | | 208 | | Medium | [Kth Smallest Element In A Bst](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | | - | | | | | 209 | | Medium | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) | | | | | - | | 210 | | Medium | [Count BST Nodes](https://practice.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-given-range/1) | | | | | | | 211 | | Medium | [Preorder To Postorder](https://practice.geeksforgeeks.org/problems/preorder-to-postorder4423/1) | | | - | | | - | 212 | | Hard | [Binary Tree To DLL](https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1) | | | | | | | 213 | | Hard | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | | | | - | | | 214 | | Hard | [Sum Of Distances In Tree](https://leetcode.com/problems/sum-of-distances-in-tree/) | | | | | - | | 215 | | Hard | [Binary Tree Cameras](https://leetcode.com/problems/binary-tree-cameras/) | | | - | - | | | 216 | | Hard | [Vertical Order Traversal Of A Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) | | | - | | | | 217 | | Hard | [Print K Sum Paths Binary Tree](https://www.geeksforgeeks.org/print-k-sum-paths-binary-tree/) | | | - | | | | 218 | | Hard | [Serialize And Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | | | - | | | | 219 | | Hard | [Find Median Bst Time O1 Space](https://www.geeksforgeeks.org/find-median-bst-time-o1-space/) | | | | | | | 220 | | Hard | [Largest Bst Binary Tree Set 2](https://www.geeksforgeeks.org/largest-bst-binary-tree-set-2/) | | | | | | - | 221 | | Hard | [Construct Bst From Given Preorder Traversa](https://www.geeksforgeeks.org/construct-bst-from-given-preorder-traversa/) | | | | | | | 222 | | | | | | | | | | 223 | | | GRAPHS | | | | | | | 224 | | Easy | [BFS Traversal Of Graph](https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1) | | | | - | | | 225 | | Easy | [Depth First Search Or Dfs For A Graph](https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/) | | - | | | | | 226 | | Easy | [Number Of Islands](https://leetcode.com/problems/number-of-islands/) | | | | | | | 227 | | Easy | [Flood Fill](https://leetcode.com/problems/flood-fill/) | | | | - | | | 228 | | Easy | [Rat In A Maze Problem](https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1) | | | | | | | 229 | | Easy | [Detect Cycle In An Undirected Graph](https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1) | | | | | | | 230 | | Easy | [Detect Cycle In A Graph](https://www.geeksforgeeks.org/detect-cycle-in-a-graph/) | | | | | | | 231 | | Medium | [Steps By Knight](https://practice.geeksforgeeks.org/problems/steps-by-knight5927/1) | | - | | | | | 232 | | Medium | [Decode String](https://leetcode.com/problems/decode-string/) | | - | | | | | 233 | | Medium | [Shortest Bridge](https://leetcode.com/problems/shortest-bridge/) | | - | | | | | 234 | | Medium | [Number Of Operations To Make Network Connected](https://leetcode.com/problems/number-of-operations-to-make-network-connected/) | | - | | - | | | 235 | | Medium | [Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states/) | | | | | | | 236 | | Medium | [Strongly Connected Componenets](https://practice.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1) | | | | | | | 237 | | Medium | [Time Needed To Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/) | | - | | | | | 238 | | Medium | [Graph Colour Applications](https://www.geeksforgeeks.org/graph-coloring-applications/#:~:text=Graph%20coloring%20problem%20is%20to,are%20colored%20using%20same%20color) | | | | | | | 239 | | Medium | [Most Stones Removed With Same Row Or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/) | | | | | | | 240 | | Medium | [As Far From Land As Possible](https://leetcode.com/problems/as-far-from-land-as-possible/) | | | | | | | 241 | | Medium | [Find The City With The Smallest Number Of Neighbors At A Threshold Distance](https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/) | | | | | | | 242 | | Medium | [Find Whether It Is Possible To Finish All Tasks Or Not From Given Dependencies](https://www.geeksforgeeks.org/find-whether-it-is-possible-to-finish-all-tasks-or-not-from-given-dependencies/) | | | | | | | 243 | | Medium | [Prims Minimum Spanning Tree Mst Greedy Algo 5](https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/) | | | | - | | | 244 | | Medium | [Implementing Floyd Warshall](https://practice.geeksforgeeks.org/problems/implementing-floyd-warshall2042/1) | | | | | | | 245 | | Medium | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) | | | | | | | 246 | | Medium | [Snakes And Ladders](https://leetcode.com/problems/snakes-and-ladders/) | | | | | | | 247 | | Medium | [Topological Sort](https://practice.geeksforgeeks.org/problems/topological-sort/1) | | | | | | - | 248 | | Medium | https://leetcode.com/problems/cheapest-flights-within-k-stops/description/ | | | - | | - | | 249 | | Medium | [Detect Negative Cycle Graph Bellman Ford](https://www.geeksforgeeks.org/detect-negative-cycle-graph-bellman-ford/) | | | | | | | 250 | | Medium | [Bipartite Graph](https://www.geeksforgeeks.org/bipartite-graph/) | | | | | | | 251 | | Hard | [Longest Increasing Path In A Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/) | | - | | | | | 252 | | Hard | [Making A Large Island](https://leetcode.com/problems/making-a-large-island/) | | | | | | | 253 | | Hard | [Remove Boxes](https://leetcode.com/problems/remove-boxes/) | | | | | - | - | 254 | | Hard | [Critical Connections In A Network](https://leetcode.com/problems/critical-connections-in-a-network/) | | | | - | | | 255 | | Hard | [Alien Dictionary](https://practice.geeksforgeeks.org/problems/alien-dictionary/1) | | | | - | | v | 256 | | Hard | [Water Jug Problem Using Bfs](https://www.geeksforgeeks.org/water-jug-problem-using-bfs/) | | | | | | | 257 | | Hard | [Travelling Salesman Problem Set 1](https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/) | | | | - | - | - | 258 | | Hard | [Total Number Spanning Trees Graph](https://www.geeksforgeeks.org/total-number-spanning-trees-graph/) | | | | | | | 259 | | Hard | [Word Ladder](https://leetcode.com/problems/word-ladder/) | | | | | | | 260 | | Hard | [Minimize Cash Flow Among Given Set Friends Borrowed Money](https://www.geeksforgeeks.org/minimize-cash-flow-among-given-set-friends-borrowed-money/) | | | | | | | 261 | | | | | | | | | | 262 | | | Tries | | | | | | | 263 | | Medium | [Design Add And Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | | | | | | | 264 | | Medium | [Word Break Problem Trie Solution](https://www.geeksforgeeks.org/word-break-problem-trie-solution/) | | - | | | | | 265 | | Medium | [Trie Insert And Search](https://www.geeksforgeeks.org/trie-insert-and-search/) | | - | | | | | 266 | | Medium | [K- Anagrams](https://practice.geeksforgeeks.org/problems/k-anagrams-1/0) | | - | | | | | 267 | | Hard | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) | | - | | | | | 268 | | Hard | [Phone Directory](https://practice.geeksforgeeks.org/problems/phone-directory/0) | | | | | | | 269 | | | | | | | | | | 270 | | | Heaps / PQs | | | | | | | 271 | | | | | | | | | | 272 | | Easy/Medium | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | | | | | | | 273 | | Easy/Medium | [Kth Largest Element In An Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | | | | | | | 274 | | Easy/Medium | [Ugly Number II](https://leetcode.com/problems/ugly-number-ii/) | | | | | | | 275 | | Easy/Medium | [Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/) | | | | | | | 276 | | Easy/Medium | [Kth Smallest Element In A Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/) | | | | | | | 277 | | Easy/Medium | [Reorganize String](https://leetcode.com/problems/reorganize-string/) | | | | | | | 278 | | Easy/Medium | [Find The Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/) | | | | | | | 279 | | Easy/Medium | [Smallest Positive Missing Number](https://practice.geeksforgeeks.org/problems/smallest-positive-missing-number-1587115621/1/) | | | | | | | 280 | | Easy/Medium | [Largest Subarray with 0 Sum](https://practice.geeksforgeeks.org/problems/largest-subarray-with-0-sum/1/) | | | | - | | | 281 | | Easy/Medium | [K Closest Points To Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | | | | | | | 282 | | Hard | [Minimum Number Of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops/) | | | | | | | 283 | | Hard | [Minimum Cost To Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers/) | | - | | | | | 284 | | Hard | [Swim In Rising Water](https://leetcode.com/problems/swim-in-rising-water/) | | | | | | | 285 | | Hard | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | | | | | | | 286 | | | | | | | | | | 287 | | | Dynamic Programming | | | | | | | 288 | | Easy | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | | | | | | | 289 | | Easy | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | | | - | | | | 290 | | Easy | [Ones And Zeroes](https://leetcode.com/problems/ones-and-zeroes/) | | | | | | - | 291 | | Easy | [Counting Bits](https://leetcode.com/problems/counting-bits/) | | | | | - | | 292 | | Medium | [Knight Dialer](https://leetcode.com/problems/knight-dialer/) | | | | | | | 293 | | Medium | [Cutted Segments](https://practice.geeksforgeeks.org/problems/cutted-segments1642/1) | | | | | | | 294 | | Medium | [Unique Paths](https://leetcode.com/problems/unique-paths/) | | - | | | | | 295 | | Medium | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | | - | | | | | 296 | | Medium | [Coin Change](https://leetcode.com/problems/coin-change/) | | | | | | - | 297 | | Medium | [Decode Ways](https://leetcode.com/problems/decode-ways/) | | - | | | - | | 298 | | Medium | [Maximum Length Of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | | | | | - | | 299 | | Medium | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | | | | | | | 300 | | Medium | [Longest Common Substring](https://practice.geeksforgeeks.org/problems/longest-common-substring1452/1) | | | | | - | | 301 | | Medium | [Count Square Submatrices With All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/) | | | - | | | | 302 | | Medium | [Maximal Square](https://leetcode.com/problems/maximal-square/) | | | | | | | 303 | | Medium | [Mobile Numeric Keypad](https://practice.geeksforgeeks.org/problems/mobile-numeric-keypad5456/1) | | | | | | | 304 | | Medium | [Weighted Job Scheduling](https://www.geeksforgeeks.org/weighted-job-scheduling/) | | | | | | | 305 | | Medium | [Delete And Earn](https://leetcode.com/problems/delete-and-earn/) | | | | | | | 306 | | Medium | [Range Sum Query 2D Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | | | | | - | | 307 | | Hard | [Optimal Binary Search Tree Dp 24](https://www.geeksforgeeks.org/optimal-binary-search-tree-dp-24/) | | | | | | | 308 | | Hard | [Frog Jump](https://leetcode.com/problems/frog-jump/) | | | | | | | 309 | | Hard | [Best Time To Buy And Sell Stock Iv](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | | | - | | | | 310 | | Hard | [Minimum Insertion Steps To Make A String Palindrome](https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/) | | | | | | | 311 | | Hard | [Largest Area Rectangular Sub Matrix Equal Number 1S 0S](https://www.geeksforgeeks.org/largest-area-rectangular-sub-matrix-equal-number-1s-0s/) | | | | | | - | 312 | | Hard | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | | - | | | | | 313 | | Hard | [Minimum Cost To Merge Stones](https://leetcode.com/problems/minimum-cost-to-merge-stones/) | | - | | | | | 314 | | Hard | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences/) | | - | | | | | 315 | | Hard | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/) | | - | | | | | 316 | | Hard | [Burst Balloons](https://leetcode.com/problems/burst-balloons/) | | | | | | | 317 | | Hard | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop/) | | | | | | | 318 | | | | | | | | | - | 319 | | | Two Pointer Approach | | | | | | | 320 | | Medium | [Sort Colors](https://leetcode.com/problems/sort-colors/) | | | | | - | | 321 | | Medium | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | | | | | | | 322 | | Medium | [Maximum Number Of Visible Points](https://leetcode.com/problems/maximum-number-of-visible-points/) | | | | | | | 323 | | | | | | | | | | 324 | | | | | | | | | | 325 | | | Greedy Algorithms | | | | | | | 326 | | Easy/Medium | [Gas Station](https://leetcode.com/problems/gas-station/) | | | | | | | 327 | | Easy/Medium | [Minimum Cost For Acquiring All Coins With K Extra Coins Allowed With Every Coin](https://www.geeksforgeeks.org/minimum-cost-for-acquiring-all-coins-with-k-extra-coins-allowed-with-every-coin/) | | | | | | | 328 | | Easy/Medium | [Restore The Array From Adjacent Pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/) | | | | | | - | 329 | | Easy/Medium | [Task Scheduler](https://leetcode.com/problems/task-scheduler/) | | | | | | | 330 | | Easy/Medium | [Minimum Deletions To Make Character Frequencies Unique](https://leetcode.com/problems/minimum-deletions-to-make-character-frequencies-unique/) | | | | | - | | 331 | | Easy/Medium | [Remove K Digits](https://leetcode.com/problems/remove-k-digits/) | | | | | - | | 332 | | Easy/Medium | https://www.spoj.com/problems/CHOCOLA/ | | | | | - | | 333 | | Easy/Medium | [Non Overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) | | | | | - | | 334 | | Easy/Medium | [Minimum Deletion Cost To Avoid Repeating Letters](https://leetcode.com/problems/minimum-deletion-cost-to-avoid-repeating-letters/) | | | | | | | 335 | | Easy/Medium | [Minimum Sum Two Numbers Formed Digits Array 2](https://www.geeksforgeeks.org/minimum-sum-two-numbers-formed-digits-array-2/) | | | | | | | 336 | | | | | | | | | - | 337 | | | | | | | | | | 338 | | | Backtracking | | | | | | | 339 | | Medium | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) | | | | | | | 340 | | Medium | [Smallest Subset Problem](https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1) | | | | | | | 341 | | Medium | [Combinations](https://leetcode.com/problems/combinations/) | - | | | | | - | 342 | | Medium | [Subsets II](https://leetcode.com/problems/subsets-ii/) | | | | | | | 343 | | Medium | [M Colouring Problem](https://practice.geeksforgeeks.org/problems/m-coloring-problem-1587115620/1) | | | | | | | 344 | | Medium | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/) | | | | | | | 345 | | Medium | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) | | | | | - | | 346 | | Medium | [Permutations II](https://leetcode.com/problems/permutations-ii/) | | | | | | | 347 | | Hard | [Word Search II](https://leetcode.com/problems/word-search-ii/) | - | | | | | | 348 | | Hard | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | | | - | | | | 349 | | Hard | [N Queens](https://leetcode.com/problems/n-queens/) | | | | | | | 350 | | Hard | [Unique Paths III](https://leetcode.com/problems/unique-paths-iii/) | | | | | - | | 351 | | Hard | [Find Maximum Number Possible By Doing At Most K Swaps](https://www.geeksforgeeks.org/find-maximum-number-possible-by-doing-at-most-k-swaps/) | | | | | | | 352 | | Hard | [Partition Set K Subsets Equal Sum](https://www.geeksforgeeks.org/partition-set-k-subsets-equal-sum/) | | | | | - | | 353 | | Hard | [Tug Of War](https://www.geeksforgeeks.org/tug-of-war/) | | | | | - | | 354 | | Hard | [Find Paths From Corner Cell To Middle Cell In Maze](https://www.geeksforgeeks.org/find-paths-from-corner-cell-to-middle-cell-in-maze/) | | - | | | | | 355 | | Hard | [Solving Cryptarithmetic Puzzles Backtracking 8](https://www.geeksforgeeks.org/solving-cryptarithmetic-puzzles-backtracking-8/) | | | | | | | 356 | | Hard | [Print Palindromic Partitions String](https://www.geeksforgeeks.org/print-palindromic-partitions-string/) | | | | | | | 357 | | | | | | | | | | 358 | | | Segment Tree | | | | | | | 359 | | Medium/Hard | [Range Sum Query Immutable](https://leetcode.com/problems/range-sum-query-immutable/) | - | | | | | | 360 | | Medium/Hard | [Range Sum Query Mutable](https://leetcode.com/problems/range-sum-query-mutable/) | | | | - | | | 361 | | Medium/Hard | [Count Of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) | | | | | | | 362 | | Medium/Hard | [Count Of Range Sum](https://leetcode.com/problems/count-of-range-sum/) | | | | | - | | 363 | --------------------------------------------------------------------------------