gitextract_dhdwtz4s/ ├── .github/ │ └── workflows/ │ └── sync.yml ├── .gitignore ├── LICENSE ├── README.md ├── codes/ │ └── python/ │ ├── 01_array/ │ │ ├── array_maxheap.py │ │ ├── array_sort_bubble_sort.py │ │ ├── array_sort_bucket_sort.py │ │ ├── array_sort_counting_sort.py │ │ ├── array_sort_insertion_sort.py │ │ ├── array_sort_maxheap_sort.py │ │ ├── array_sort_merge_sort.py │ │ ├── array_sort_minheap_sort.py │ │ ├── array_sort_quick_sort.py │ │ ├── array_sort_radix_sort.py │ │ ├── array_sort_selection_sort.py │ │ └── array_sort_shell_sort.py │ ├── 02_linked_list/ │ │ ├── linked_list.py │ │ ├── linked_list_bubble_sort.py │ │ ├── linked_list_bucket_sort.py │ │ ├── linked_list_counting_sort.py │ │ ├── linked_list_insertion_sort.py │ │ ├── linked_list_merge_sort.py │ │ ├── linked_list_quick_sort.py │ │ ├── linked_list_radix_sort.py │ │ └── linked_list_section_sort.py │ ├── 03_stack_queue_hash_table/ │ │ ├── queue_circularSequential_queue.py │ │ ├── queue_deque.py │ │ ├── queue_link_queue.py │ │ ├── queue_priority_queue.py │ │ ├── queue_sequential_queue.py │ │ ├── stack_link_stack.py │ │ ├── stack_monotone_stack.py │ │ └── stack_sequential_stack.py │ ├── 04_string/ │ │ ├── string_Strcmp.py │ │ ├── string_boyer_moore.py │ │ ├── string_brute_force.py │ │ ├── string_horspool.py │ │ ├── string_kmp.py │ │ ├── string_rabin_karp.py │ │ ├── string_sunday.py │ │ └── string_trie.py │ ├── 05_tree/ │ │ ├── tree_binaryindexed_tree.py │ │ ├── tree_dynamicSegmentTree_update_interval_1.py │ │ ├── tree_dynamicSegmentTree_update_interval_2.py │ │ ├── tree_segmentTree_update_interval_1.py │ │ ├── tree_segmentTree_update_interval_2.py │ │ ├── tree_segmentTree_update_point.py │ │ ├── tree_unionFind.py │ │ ├── tree_unionFind_QuickFind.py │ │ ├── tree_unionFind_QuickUnion.py │ │ ├── tree_unionFind_UnoinByRank.py │ │ └── tree_unionFind_UnoinBySize.py │ ├── 06_graph/ │ │ ├── Graph-Adjacency-List.py │ │ ├── Graph-Adjacency-Matrix.py │ │ ├── Graph-BFS.py │ │ ├── Graph-Bellman-Ford.py │ │ ├── Graph-DFS.py │ │ ├── Graph-Edgeset-Array.py │ │ ├── Graph-Hash-Table.py │ │ ├── Graph-Kruskal.py │ │ ├── Graph-Linked-Forward-Star.py │ │ ├── Graph-Prim.py │ │ ├── Graph-Topological-Sorting-DFS.py │ │ └── Graph-Topological-Sorting-Kahn.py │ └── 08_dynamic_programming/ │ ├── Digit-DP.py │ ├── Pack-2DCostPack.py │ ├── Pack-CompletePack.py │ ├── Pack-GroupPack.py │ ├── Pack-MixedPack.py │ ├── Pack-MultiplePack.py │ ├── Pack-ProblemVariants.py │ └── Pack-ZeroOnePack.py └── docs/ ├── 00_preface/ │ ├── 00_01_preface.md │ ├── 00_02_data_structures_algorithms.md │ ├── 00_03_algorithm_complexity.md │ ├── 00_04_leetcode_guide.md │ ├── 00_05_solutions_list.md │ ├── 00_06_categories_list.md │ ├── 00_07_interview_100_list.md │ ├── 00_08_interview_200_list.md │ └── index.md ├── 01_array/ │ ├── 01_01_array_basic.md │ ├── 01_02_array_sort.md │ ├── 01_03_array_bubble_sort.md │ ├── 01_04_array_selection_sort.md │ ├── 01_05_array_insertion_sort.md │ ├── 01_06_array_shell_sort.md │ ├── 01_07_array_merge_sort.md │ ├── 01_08_array_quick_sort.md │ ├── 01_09_array_heap_sort.md │ ├── 01_10_array_counting_sort.md │ ├── 01_11_array_bucket_sort.md │ ├── 01_12_array_radix_sort.md │ ├── 01_13_array_binary_search_01.md │ ├── 01_14_array_binary_search_02.md │ ├── 01_15_array_two_pointers.md │ ├── 01_16_array_sliding_window.md │ └── index.md ├── 02_linked_list/ │ ├── 02_01_linked_list_basic.md │ ├── 02_02_linked_list_sort.md │ ├── 02_03_linked_list_bubble_sort.md │ ├── 02_04_linked_list_selection_sort.md │ ├── 02_05_linked_list_insertion_sort.md │ ├── 02_06_linked_list_merge_sort.md │ ├── 02_07_linked_list_quick_sort.md │ ├── 02_08_linked_list_counting_sort.md │ ├── 02_09_linked_list_bucket_sort.md │ ├── 02_10_linked_list_radix_sort.md │ ├── 02_11_linked_list_two_pointers.md │ └── index.md ├── 03_stack_queue_hash_table/ │ ├── 03_01_stack_basic.md │ ├── 03_02_monotone_stack.md │ ├── 03_03_queue_basic.md │ ├── 03_04_priority_queue.md │ ├── 03_05_bidirectional_queue.md │ ├── 03_06_hash_table.md │ └── index.md ├── 04_string/ │ ├── 04_01_string_basic.md │ ├── 04_02_string_brute_force.md │ ├── 04_03_string_rabin_karp.md │ ├── 04_04_string_kmp.md │ ├── 04_05_string_boyer_moore.md │ ├── 04_06_string_horspool.md │ ├── 04_07_string_sunday.md │ ├── 04_08_trie.md │ ├── 04_09_ac_automaton.md │ ├── 04_10_suffix_array.md │ └── index.md ├── 05_tree/ │ ├── 05_01_tree_basic.md │ ├── 05_02_binary_tree_traverse.md │ ├── 05_03_binary_tree_reduction.md │ ├── 05_04_binary_search_tree.md │ ├── 05_05_segment_tree_01.md │ ├── 05_06_segment_tree_02.md │ ├── 05_07_binary_indexed_tree.md │ ├── 05_08_union_find.md │ └── index.md ├── 06_graph/ │ ├── 06_01_graph_basic.md │ ├── 06_02_graph_structure.md │ ├── 06_03_graph_dfs.md │ ├── 06_04_graph_bfs.md │ ├── 06_05_graph_topological_sorting.md │ ├── 06_06_graph_minimum_spanning_tree.md │ ├── 06_07_graph_shortest_path_01.md │ ├── 06_08_graph_shortest_path_02.md │ ├── 06_09_graph_multi_source_shortest_path.md │ ├── 06_10_graph_the_second_shortest_path.md │ ├── 06_11_graph_bipartite_basic.md │ ├── 06_12_graph_bipartite_matching.md │ └── index.md ├── 07_algorithm/ │ ├── 07_01_enumeration_algorithm.md │ ├── 07_02_recursive_algorithm.md │ ├── 07_03_divide_and_conquer_algorithm.md │ ├── 07_04_backtracking_algorithm.md │ ├── 07_05_greedy_algorithm.md │ ├── 07_06_bit_operation.md │ └── index.md ├── 08_dynamic_programming/ │ ├── 08_01_dynamic_programming_basic.md │ ├── 08_02_memoization_search.md │ ├── 08_03_linear_dp_01.md │ ├── 08_04_linear_dp_02.md │ ├── 08_05_linear_dp_03.md │ ├── 08_06_knapsack_problem_01.md │ ├── 08_07_knapsack_problem_02.md │ ├── 08_08_knapsack_problem_03.md │ ├── 08_09_knapsack_problem_04.md │ ├── 08_10_knapsack_problem_05.md │ ├── 08_11_interval_dp.md │ ├── 08_12_tree_dp.md │ ├── 08_13_state_compression_dp.md │ ├── 08_14_counting_dp.md │ ├── 08_15_digit_dp.md │ ├── 08_16_probability_dp.md │ └── index.md ├── README.md ├── others/ │ ├── index.md │ ├── todo_list.md │ └── update_time.md └── solutions/ ├── 0001-0099/ │ ├── 3sum-closest.md │ ├── 3sum.md │ ├── 4sum.md │ ├── add-binary.md │ ├── add-two-numbers.md │ ├── binary-tree-inorder-traversal.md │ ├── climbing-stairs.md │ ├── combination-sum-ii.md │ ├── combination-sum.md │ ├── combinations.md │ ├── container-with-most-water.md │ ├── count-and-say.md │ ├── decode-ways.md │ ├── divide-two-integers.md │ ├── edit-distance.md │ ├── find-first-and-last-position-of-element-in-sorted-array.md │ ├── find-the-index-of-the-first-occurrence-in-a-string.md │ ├── first-missing-positive.md │ ├── generate-parentheses.md │ ├── gray-code.md │ ├── group-anagrams.md │ ├── index.md │ ├── insert-interval.md │ ├── integer-to-roman.md │ ├── interleaving-string.md │ ├── jump-game-ii.md │ ├── jump-game.md │ ├── largest-rectangle-in-histogram.md │ ├── length-of-last-word.md │ ├── letter-combinations-of-a-phone-number.md │ ├── longest-common-prefix.md │ ├── longest-palindromic-substring.md │ ├── longest-substring-without-repeating-characters.md │ ├── longest-valid-parentheses.md │ ├── maximal-rectangle.md │ ├── maximum-subarray.md │ ├── median-of-two-sorted-arrays.md │ ├── merge-intervals.md │ ├── merge-k-sorted-lists.md │ ├── merge-sorted-array.md │ ├── merge-two-sorted-lists.md │ ├── minimum-path-sum.md │ ├── minimum-window-substring.md │ ├── multiply-strings.md │ ├── n-queens-ii.md │ ├── n-queens.md │ ├── next-permutation.md │ ├── palindrome-number.md │ ├── partition-list.md │ ├── permutation-sequence.md │ ├── permutations-ii.md │ ├── permutations.md │ ├── plus-one.md │ ├── powx-n.md │ ├── recover-binary-search-tree.md │ ├── regular-expression-matching.md │ ├── remove-duplicates-from-sorted-array-ii.md │ ├── remove-duplicates-from-sorted-array.md │ ├── remove-duplicates-from-sorted-list-ii.md │ ├── remove-duplicates-from-sorted-list.md │ ├── remove-element.md │ ├── remove-nth-node-from-end-of-list.md │ ├── restore-ip-addresses.md │ ├── reverse-integer.md │ ├── reverse-linked-list-ii.md │ ├── reverse-nodes-in-k-group.md │ ├── roman-to-integer.md │ ├── rotate-image.md │ ├── rotate-list.md │ ├── scramble-string.md │ ├── search-a-2d-matrix.md │ ├── search-in-rotated-sorted-array-ii.md │ ├── search-in-rotated-sorted-array.md │ ├── search-insert-position.md │ ├── set-matrix-zeroes.md │ ├── simplify-path.md │ ├── sort-colors.md │ ├── spiral-matrix-ii.md │ ├── spiral-matrix.md │ ├── sqrtx.md │ ├── string-to-integer-atoi.md │ ├── subsets-ii.md │ ├── subsets.md │ ├── substring-with-concatenation-of-all-words.md │ ├── sudoku-solver.md │ ├── swap-nodes-in-pairs.md │ ├── text-justification.md │ ├── trapping-rain-water.md │ ├── two-sum.md │ ├── unique-binary-search-trees-ii.md │ ├── unique-binary-search-trees.md │ ├── unique-paths-ii.md │ ├── unique-paths.md │ ├── valid-number.md │ ├── valid-parentheses.md │ ├── valid-sudoku.md │ ├── validate-binary-search-tree.md │ ├── wildcard-matching.md │ ├── word-search.md │ └── zigzag-conversion.md ├── 0100-0199/ │ ├── balanced-binary-tree.md │ ├── best-time-to-buy-and-sell-stock-ii.md │ ├── best-time-to-buy-and-sell-stock-iii.md │ ├── best-time-to-buy-and-sell-stock-iv.md │ ├── best-time-to-buy-and-sell-stock.md │ ├── binary-search-tree-iterator.md │ ├── binary-tree-level-order-traversal-ii.md │ ├── binary-tree-level-order-traversal.md │ ├── binary-tree-maximum-path-sum.md │ ├── binary-tree-postorder-traversal.md │ ├── binary-tree-preorder-traversal.md │ ├── binary-tree-right-side-view.md │ ├── binary-tree-upside-down.md │ ├── binary-tree-zigzag-level-order-traversal.md │ ├── candy.md │ ├── clone-graph.md │ ├── compare-version-numbers.md │ ├── construct-binary-tree-from-inorder-and-postorder-traversal.md │ ├── construct-binary-tree-from-preorder-and-inorder-traversal.md │ ├── convert-sorted-array-to-binary-search-tree.md │ ├── convert-sorted-list-to-binary-search-tree.md │ ├── copy-list-with-random-pointer.md │ ├── distinct-subsequences.md │ ├── dungeon-game.md │ ├── evaluate-reverse-polish-notation.md │ ├── excel-sheet-column-number.md │ ├── excel-sheet-column-title.md │ ├── factorial-trailing-zeroes.md │ ├── find-minimum-in-rotated-sorted-array-ii.md │ ├── find-minimum-in-rotated-sorted-array.md │ ├── find-peak-element.md │ ├── flatten-binary-tree-to-linked-list.md │ ├── fraction-to-recurring-decimal.md │ ├── gas-station.md │ ├── house-robber.md │ ├── index.md │ ├── insertion-sort-list.md │ ├── intersection-of-two-linked-lists.md │ ├── largest-number.md │ ├── linked-list-cycle-ii.md │ ├── linked-list-cycle.md │ ├── longest-consecutive-sequence.md │ ├── longest-substring-with-at-most-two-distinct-characters.md │ ├── lru-cache.md │ ├── majority-element.md │ ├── max-points-on-a-line.md │ ├── maximum-depth-of-binary-tree.md │ ├── maximum-gap.md │ ├── maximum-product-subarray.md │ ├── min-stack.md │ ├── minimum-depth-of-binary-tree.md │ ├── missing-ranges.md │ ├── number-of-1-bits.md │ ├── one-edit-distance.md │ ├── palindrome-partitioning-ii.md │ ├── palindrome-partitioning.md │ ├── pascals-triangle-ii.md │ ├── pascals-triangle.md │ ├── path-sum-ii.md │ ├── path-sum.md │ ├── populating-next-right-pointers-in-each-node-ii.md │ ├── populating-next-right-pointers-in-each-node.md │ ├── read-n-characters-given-read4-ii-call-multiple-times.md │ ├── read-n-characters-given-read4.md │ ├── reorder-list.md │ ├── repeated-dna-sequences.md │ ├── reverse-bits.md │ ├── reverse-words-in-a-string-ii.md │ ├── reverse-words-in-a-string.md │ ├── rotate-array.md │ ├── same-tree.md │ ├── single-number-ii.md │ ├── single-number.md │ ├── sort-list.md │ ├── sum-root-to-leaf-numbers.md │ ├── surrounded-regions.md │ ├── symmetric-tree.md │ ├── triangle.md │ ├── two-sum-ii-input-array-is-sorted.md │ ├── two-sum-iii-data-structure-design.md │ ├── valid-palindrome.md │ ├── word-break-ii.md │ ├── word-break.md │ ├── word-ladder-ii.md │ └── word-ladder.md ├── 0200-0299/ │ ├── 3sum-smaller.md │ ├── add-digits.md │ ├── alien-dictionary.md │ ├── basic-calculator-ii.md │ ├── basic-calculator.md │ ├── best-meeting-point.md │ ├── binary-tree-longest-consecutive-sequence.md │ ├── binary-tree-paths.md │ ├── bitwise-and-of-numbers-range.md │ ├── bulls-and-cows.md │ ├── closest-binary-search-tree-value-ii.md │ ├── closest-binary-search-tree-value.md │ ├── combination-sum-iii.md │ ├── contains-duplicate-ii.md │ ├── contains-duplicate-iii.md │ ├── contains-duplicate.md │ ├── count-complete-tree-nodes.md │ ├── count-primes.md │ ├── count-univalue-subtrees.md │ ├── course-schedule-ii.md │ ├── course-schedule.md │ ├── delete-node-in-a-linked-list.md │ ├── design-add-and-search-words-data-structure.md │ ├── different-ways-to-add-parentheses.md │ ├── encode-and-decode-strings.md │ ├── expression-add-operators.md │ ├── factor-combinations.md │ ├── find-median-from-data-stream.md │ ├── find-the-celebrity.md │ ├── find-the-duplicate-number.md │ ├── first-bad-version.md │ ├── flatten-2d-vector.md │ ├── flip-game-ii.md │ ├── flip-game.md │ ├── game-of-life.md │ ├── graph-valid-tree.md │ ├── group-shifted-strings.md │ ├── h-index-ii.md │ ├── h-index.md │ ├── happy-number.md │ ├── house-robber-ii.md │ ├── implement-queue-using-stacks.md │ ├── implement-stack-using-queues.md │ ├── implement-trie-prefix-tree.md │ ├── index.md │ ├── inorder-successor-in-bst.md │ ├── integer-to-english-words.md │ ├── invert-binary-tree.md │ ├── isomorphic-strings.md │ ├── kth-largest-element-in-an-array.md │ ├── kth-smallest-element-in-a-bst.md │ ├── lowest-common-ancestor-of-a-binary-search-tree.md │ ├── lowest-common-ancestor-of-a-binary-tree.md │ ├── majority-element-ii.md │ ├── maximal-square.md │ ├── meeting-rooms-ii.md │ ├── meeting-rooms.md │ ├── minimum-size-subarray-sum.md │ ├── missing-number.md │ ├── move-zeroes.md │ ├── nim-game.md │ ├── number-of-digit-one.md │ ├── number-of-islands.md │ ├── paint-fence.md │ ├── paint-house-ii.md │ ├── paint-house.md │ ├── palindrome-linked-list.md │ ├── palindrome-permutation-ii.md │ ├── palindrome-permutation.md │ ├── peeking-iterator.md │ ├── perfect-squares.md │ ├── power-of-two.md │ ├── product-of-array-except-self.md │ ├── rectangle-area.md │ ├── remove-linked-list-elements.md │ ├── reverse-linked-list.md │ ├── search-a-2d-matrix-ii.md │ ├── serialize-and-deserialize-binary-tree.md │ ├── shortest-palindrome.md │ ├── shortest-word-distance-ii.md │ ├── shortest-word-distance-iii.md │ ├── shortest-word-distance.md │ ├── single-number-iii.md │ ├── sliding-window-maximum.md │ ├── strobogrammatic-number-ii.md │ ├── strobogrammatic-number-iii.md │ ├── strobogrammatic-number.md │ ├── summary-ranges.md │ ├── the-skyline-problem.md │ ├── ugly-number-ii.md │ ├── ugly-number.md │ ├── unique-word-abbreviation.md │ ├── valid-anagram.md │ ├── verify-preorder-sequence-in-binary-search-tree.md │ ├── walls-and-gates.md │ ├── wiggle-sort.md │ ├── word-pattern-ii.md │ ├── word-pattern.md │ ├── word-search-ii.md │ └── zigzag-iterator.md ├── 0300-0399/ │ ├── additive-number.md │ ├── android-unlock-patterns.md │ ├── best-time-to-buy-and-sell-stock-with-cooldown.md │ ├── binary-tree-vertical-order-traversal.md │ ├── bomb-enemy.md │ ├── bulb-switcher.md │ ├── burst-balloons.md │ ├── coin-change.md │ ├── combination-sum-iv.md │ ├── count-numbers-with-unique-digits.md │ ├── count-of-range-sum.md │ ├── count-of-smaller-numbers-after-self.md │ ├── counting-bits.md │ ├── create-maximum-number.md │ ├── data-stream-as-disjoint-intervals.md │ ├── decode-string.md │ ├── design-hit-counter.md │ ├── design-phone-directory.md │ ├── design-snake-game.md │ ├── design-tic-tac-toe.md │ ├── design-twitter.md │ ├── elimination-game.md │ ├── evaluate-division.md │ ├── find-k-pairs-with-smallest-sums.md │ ├── find-leaves-of-binary-tree.md │ ├── find-the-difference.md │ ├── first-unique-character-in-a-string.md │ ├── flatten-nested-list-iterator.md │ ├── generalized-abbreviation.md │ ├── guess-number-higher-or-lower-ii.md │ ├── guess-number-higher-or-lower.md │ ├── house-robber-iii.md │ ├── increasing-triplet-subsequence.md │ ├── index.md │ ├── insert-delete-getrandom-o1-duplicates-allowed.md │ ├── insert-delete-getrandom-o1.md │ ├── integer-break.md │ ├── integer-replacement.md │ ├── intersection-of-two-arrays-ii.md │ ├── intersection-of-two-arrays.md │ ├── is-subsequence.md │ ├── kth-smallest-element-in-a-sorted-matrix.md │ ├── largest-bst-subtree.md │ ├── largest-divisible-subset.md │ ├── lexicographical-numbers.md │ ├── line-reflection.md │ ├── linked-list-random-node.md │ ├── logger-rate-limiter.md │ ├── longest-absolute-file-path.md │ ├── longest-increasing-path-in-a-matrix.md │ ├── longest-increasing-subsequence.md │ ├── longest-substring-with-at-least-k-repeating-characters.md │ ├── longest-substring-with-at-most-k-distinct-characters.md │ ├── max-sum-of-rectangle-no-larger-than-k.md │ ├── maximum-product-of-word-lengths.md │ ├── maximum-size-subarray-sum-equals-k.md │ ├── mini-parser.md │ ├── minimum-height-trees.md │ ├── moving-average-from-data-stream.md │ ├── nested-list-weight-sum-ii.md │ ├── nested-list-weight-sum.md │ ├── number-of-connected-components-in-an-undirected-graph.md │ ├── number-of-islands-ii.md │ ├── odd-even-linked-list.md │ ├── palindrome-pairs.md │ ├── patching-array.md │ ├── perfect-rectangle.md │ ├── plus-one-linked-list.md │ ├── power-of-four.md │ ├── power-of-three.md │ ├── random-pick-index.md │ ├── range-addition.md │ ├── range-sum-query-2d-immutable.md │ ├── range-sum-query-2d-mutable.md │ ├── range-sum-query-immutable.md │ ├── range-sum-query-mutable.md │ ├── ransom-note.md │ ├── rearrange-string-k-distance-apart.md │ ├── reconstruct-itinerary.md │ ├── remove-duplicate-letters.md │ ├── remove-invalid-parentheses.md │ ├── reverse-string.md │ ├── reverse-vowels-of-a-string.md │ ├── rotate-function.md │ ├── russian-doll-envelopes.md │ ├── self-crossing.md │ ├── shortest-distance-from-all-buildings.md │ ├── shuffle-an-array.md │ ├── smallest-rectangle-enclosing-black-pixels.md │ ├── sort-transformed-array.md │ ├── sparse-matrix-multiplication.md │ ├── sum-of-two-integers.md │ ├── super-pow.md │ ├── super-ugly-number.md │ ├── top-k-frequent-elements.md │ ├── utf-8-validation.md │ ├── valid-perfect-square.md │ ├── verify-preorder-serialization-of-a-binary-tree.md │ ├── water-and-jug-problem.md │ ├── wiggle-sort-ii.md │ └── wiggle-subsequence.md ├── 0400-0499/ │ ├── 132-pattern.md │ ├── 4sum-ii.md │ ├── add-strings.md │ ├── add-two-numbers-ii.md │ ├── all-oone-data-structure.md │ ├── arithmetic-slices-ii-subsequence.md │ ├── arithmetic-slices.md │ ├── arranging-coins.md │ ├── assign-cookies.md │ ├── battleships-in-a-board.md │ ├── binary-watch.md │ ├── can-i-win.md │ ├── circular-array-loop.md │ ├── concatenated-words.md │ ├── construct-quad-tree.md │ ├── construct-the-rectangle.md │ ├── convert-a-number-to-hexadecimal.md │ ├── convert-binary-search-tree-to-sorted-doubly-linked-list.md │ ├── convex-polygon.md │ ├── count-the-repetitions.md │ ├── delete-node-in-a-bst.md │ ├── diagonal-traverse.md │ ├── encode-n-ary-tree-to-binary-tree.md │ ├── encode-string-with-shortest-length.md │ ├── find-all-anagrams-in-a-string.md │ ├── find-all-duplicates-in-an-array.md │ ├── find-all-numbers-disappeared-in-an-array.md │ ├── find-permutation.md │ ├── find-right-interval.md │ ├── fizz-buzz.md │ ├── flatten-a-multilevel-doubly-linked-list.md │ ├── frog-jump.md │ ├── generate-random-point-in-a-circle.md │ ├── hamming-distance.md │ ├── heaters.md │ ├── implement-rand10-using-rand7.md │ ├── index.md │ ├── island-perimeter.md │ ├── k-th-smallest-in-lexicographical-order.md │ ├── largest-palindrome-product.md │ ├── lfu-cache.md │ ├── license-key-formatting.md │ ├── longest-palindrome.md │ ├── longest-repeating-character-replacement.md │ ├── magical-string.md │ ├── matchsticks-to-square.md │ ├── max-consecutive-ones-ii.md │ ├── max-consecutive-ones.md │ ├── maximum-xor-of-two-numbers-in-an-array.md │ ├── minimum-genetic-mutation.md │ ├── minimum-moves-to-equal-array-elements-ii.md │ ├── minimum-moves-to-equal-array-elements.md │ ├── minimum-number-of-arrows-to-burst-balloons.md │ ├── minimum-unique-word-abbreviation.md │ ├── n-ary-tree-level-order-traversal.md │ ├── next-greater-element-i.md │ ├── non-decreasing-subsequences.md │ ├── non-overlapping-intervals.md │ ├── nth-digit.md │ ├── number-complement.md │ ├── number-of-boomerangs.md │ ├── number-of-segments-in-a-string.md │ ├── ones-and-zeroes.md │ ├── optimal-account-balancing.md │ ├── pacific-atlantic-water-flow.md │ ├── partition-equal-subset-sum.md │ ├── path-sum-iii.md │ ├── poor-pigs.md │ ├── predict-the-winner.md │ ├── queue-reconstruction-by-height.md │ ├── random-point-in-non-overlapping-rectangles.md │ ├── reconstruct-original-digits-from-english.md │ ├── remove-k-digits.md │ ├── repeated-substring-pattern.md │ ├── reverse-pairs.md │ ├── robot-room-cleaner.md │ ├── sentence-screen-fitting.md │ ├── sequence-reconstruction.md │ ├── serialize-and-deserialize-bst.md │ ├── serialize-and-deserialize-n-ary-tree.md │ ├── sliding-window-median.md │ ├── smallest-good-base.md │ ├── sort-characters-by-frequency.md │ ├── split-array-largest-sum.md │ ├── string-compression.md │ ├── strong-password-checker.md │ ├── sum-of-left-leaves.md │ ├── target-sum.md │ ├── teemo-attacking.md │ ├── ternary-expression-parser.md │ ├── the-maze-iii.md │ ├── the-maze.md │ ├── third-maximum-number.md │ ├── total-hamming-distance.md │ ├── trapping-rain-water-ii.md │ ├── unique-substrings-in-wraparound-string.md │ ├── valid-word-abbreviation.md │ ├── valid-word-square.md │ ├── validate-ip-address.md │ ├── word-squares.md │ └── zuma-game.md ├── 0500-0599/ │ ├── 01-matrix.md │ ├── array-nesting.md │ ├── array-partition.md │ ├── base-7.md │ ├── beautiful-arrangement.md │ ├── binary-tree-longest-consecutive-sequence-ii.md │ ├── binary-tree-tilt.md │ ├── boundary-of-binary-tree.md │ ├── brick-wall.md │ ├── coin-change-ii.md │ ├── complex-number-multiplication.md │ ├── construct-binary-tree-from-string.md │ ├── contiguous-array.md │ ├── continuous-subarray-sum.md │ ├── convert-bst-to-greater-tree.md │ ├── delete-operation-for-two-strings.md │ ├── design-in-memory-file-system.md │ ├── detect-capital.md │ ├── diameter-of-binary-tree.md │ ├── distribute-candies.md │ ├── encode-and-decode-tinyurl.md │ ├── erect-the-fence.md │ ├── fibonacci-number.md │ ├── find-bottom-left-tree-value.md │ ├── find-largest-value-in-each-tree-row.md │ ├── find-mode-in-binary-search-tree.md │ ├── find-the-closest-palindrome.md │ ├── fraction-addition-and-subtraction.md │ ├── freedom-trail.md │ ├── index.md │ ├── inorder-successor-in-bst-ii.md │ ├── ipo.md │ ├── k-diff-pairs-in-an-array.md │ ├── keyboard-row.md │ ├── kill-process.md │ ├── logical-or-of-two-binary-grids-represented-as-quad-trees.md │ ├── lonely-pixel-i.md │ ├── lonely-pixel-ii.md │ ├── longest-harmonious-subsequence.md │ ├── longest-line-of-consecutive-one-in-matrix.md │ ├── longest-palindromic-subsequence.md │ ├── longest-uncommon-subsequence-i.md │ ├── longest-uncommon-subsequence-ii.md │ ├── longest-word-in-dictionary-through-deleting.md │ ├── maximum-depth-of-n-ary-tree.md │ ├── maximum-vacation-days.md │ ├── minesweeper.md │ ├── minimum-absolute-difference-in-bst.md │ ├── minimum-index-sum-of-two-lists.md │ ├── minimum-time-difference.md │ ├── most-frequent-subtree-sum.md │ ├── n-ary-tree-postorder-traversal.md │ ├── n-ary-tree-preorder-traversal.md │ ├── next-greater-element-ii.md │ ├── next-greater-element-iii.md │ ├── number-of-provinces.md │ ├── optimal-division.md │ ├── out-of-boundary-paths.md │ ├── output-contest-matches.md │ ├── perfect-number.md │ ├── permutation-in-string.md │ ├── random-flip-matrix.md │ ├── random-pick-with-weight.md │ ├── range-addition-ii.md │ ├── relative-ranks.md │ ├── remove-boxes.md │ ├── reshape-the-matrix.md │ ├── reverse-string-ii.md │ ├── reverse-words-in-a-string-iii.md │ ├── shortest-unsorted-continuous-subarray.md │ ├── single-element-in-a-sorted-array.md │ ├── split-array-with-equal-sum.md │ ├── split-concatenated-strings.md │ ├── squirrel-simulation.md │ ├── student-attendance-record-i.md │ ├── student-attendance-record-ii.md │ ├── subarray-sum-equals-k.md │ ├── subtree-of-another-tree.md │ ├── super-washing-machines.md │ ├── tag-validator.md │ ├── the-maze-ii.md │ ├── valid-square.md │ └── word-abbreviation.md ├── 0600-0699/ │ ├── 2-keys-keyboard.md │ ├── 24-game.md │ ├── 4-keys-keyboard.md │ ├── add-bold-tag-in-string.md │ ├── add-one-row-to-tree.md │ ├── average-of-levels-in-binary-tree.md │ ├── baseball-game.md │ ├── beautiful-arrangement-ii.md │ ├── binary-number-with-alternating-bits.md │ ├── bulb-switcher-ii.md │ ├── can-place-flowers.md │ ├── coin-path.md │ ├── construct-string-from-binary-tree.md │ ├── count-binary-substrings.md │ ├── course-schedule-iii.md │ ├── cut-off-trees-for-golf-event.md │ ├── decode-ways-ii.md │ ├── degree-of-an-array.md │ ├── design-circular-deque.md │ ├── design-circular-queue.md │ ├── design-compressed-string-iterator.md │ ├── design-excel-sum-formula.md │ ├── design-log-storage-system.md │ ├── design-search-autocomplete-system.md │ ├── dota2-senate.md │ ├── employee-importance.md │ ├── equal-tree-partition.md │ ├── exclusive-time-of-functions.md │ ├── falling-squares.md │ ├── find-duplicate-file-in-system.md │ ├── find-duplicate-subtrees.md │ ├── find-k-closest-elements.md │ ├── find-the-derangement-of-an-array.md │ ├── image-smoother.md │ ├── implement-magic-dictionary.md │ ├── index.md │ ├── k-empty-slots.md │ ├── k-inverse-pairs-array.md │ ├── knight-probability-in-chessboard.md │ ├── longest-continuous-increasing-subsequence.md │ ├── longest-univalue-path.md │ ├── map-sum-pairs.md │ ├── max-area-of-island.md │ ├── maximum-average-subarray-i.md │ ├── maximum-average-subarray-ii.md │ ├── maximum-binary-tree.md │ ├── maximum-distance-in-arrays.md │ ├── maximum-length-of-pair-chain.md │ ├── maximum-product-of-three-numbers.md │ ├── maximum-sum-of-3-non-overlapping-subarrays.md │ ├── maximum-swap.md │ ├── maximum-width-of-binary-tree.md │ ├── merge-two-binary-trees.md │ ├── minimum-factorization.md │ ├── next-closest-time.md │ ├── non-decreasing-array.md │ ├── non-negative-integers-without-consecutive-ones.md │ ├── number-of-distinct-islands.md │ ├── number-of-longest-increasing-subsequence.md │ ├── palindromic-substrings.md │ ├── partition-to-k-equal-sum-subsets.md │ ├── path-sum-iv.md │ ├── print-binary-tree.md │ ├── redundant-connection-ii.md │ ├── redundant-connection.md │ ├── remove-9.md │ ├── repeated-string-match.md │ ├── replace-words.md │ ├── robot-return-to-origin.md │ ├── second-minimum-node-in-a-binary-tree copy.md │ ├── second-minimum-node-in-a-binary-tree.md │ ├── set-mismatch.md │ ├── shopping-offers.md │ ├── smallest-range-covering-elements-from-k-lists.md │ ├── solve-the-equation.md │ ├── split-array-into-consecutive-subsequences.md │ ├── stickers-to-spell-word.md │ ├── strange-printer.md │ ├── sum-of-square-numbers.md │ ├── task-scheduler.md │ ├── top-k-frequent-words copy.md │ ├── top-k-frequent-words.md │ ├── trim-a-binary-search-tree.md │ ├── two-sum-iv-input-is-a-bst.md │ ├── valid-palindrome-ii.md │ ├── valid-parenthesis-string.md │ └── valid-triangle-number.md ├── 0700-0799/ │ ├── 1-bit-and-2-bit-characters.md │ ├── accounts-merge.md │ ├── all-paths-from-source-to-target.md │ ├── asteroid-collision.md │ ├── basic-calculator-iv.md │ ├── best-time-to-buy-and-sell-stock-with-transaction-fee.md │ ├── binary-search.md │ ├── bold-words-in-string.md │ ├── champagne-tower.md │ ├── cheapest-flights-within-k-stops.md │ ├── cherry-pickup.md │ ├── contain-virus.md │ ├── count-different-palindromic-subsequences.md │ ├── couples-holding-hands.md │ ├── cracking-the-safe.md │ ├── custom-sort-string.md │ ├── daily-temperatures.md │ ├── delete-and-earn.md │ ├── design-hashmap.md │ ├── design-hashset.md │ ├── design-linked-list.md │ ├── domino-and-tromino-tiling.md │ ├── escape-the-ghosts.md │ ├── find-k-th-smallest-pair-distance.md │ ├── find-pivot-index.md │ ├── find-smallest-letter-greater-than-target.md │ ├── flood-fill.md │ ├── global-and-local-inversions.md │ ├── index.md │ ├── insert-into-a-binary-search-tree.md │ ├── insert-into-a-sorted-circular-linked-list.md │ ├── is-graph-bipartite.md │ ├── jewels-and-stones.md │ ├── k-th-smallest-prime-fraction.md │ ├── k-th-symbol-in-grammar.md │ ├── kth-largest-element-in-a-stream.md │ ├── largest-number-at-least-twice-of-others.md │ ├── largest-plus-sign.md │ ├── letter-case-permutation.md │ ├── longest-word-in-dictionary.md │ ├── max-chunks-to-make-sorted-ii.md │ ├── max-chunks-to-make-sorted.md │ ├── maximum-length-of-repeated-subarray.md │ ├── min-cost-climbing-stairs.md │ ├── minimum-ascii-delete-sum-for-two-strings.md │ ├── minimum-distance-between-bst-nodes.md │ ├── minimum-window-subsequence.md │ ├── monotone-increasing-digits.md │ ├── my-calendar-i.md │ ├── my-calendar-ii.md │ ├── my-calendar-iii.md │ ├── network-delay-time.md │ ├── number-of-atoms.md │ ├── number-of-matching-subsequences.md │ ├── number-of-subarrays-with-bounded-maximum.md │ ├── open-the-lock.md │ ├── parse-lisp-expression.md │ ├── partition-labels.md │ ├── prefix-and-suffix-search.md │ ├── preimage-size-of-factorial-zeroes-function.md │ ├── prime-number-of-set-bits-in-binary-representation.md │ ├── pyramid-transition-matrix.md │ ├── rabbits-in-forest.md │ ├── random-pick-with-blacklist.md │ ├── range-module.md │ ├── reach-a-number.md │ ├── reaching-points.md │ ├── remove-comments.md │ ├── reorganize-string.md │ ├── rotate-string.md │ ├── rotated-digits.md │ ├── search-in-a-binary-search-tree.md │ ├── search-in-a-sorted-array-of-unknown-size.md │ ├── self-dividing-numbers.md │ ├── set-intersection-size-at-least-two.md │ ├── shortest-completing-word.md │ ├── sliding-puzzle.md │ ├── smallest-rotation-with-highest-score.md │ ├── split-linked-list-in-parts.md │ ├── subarray-product-less-than-k.md │ ├── swap-adjacent-in-lr-string.md │ ├── swim-in-rising-water.md │ ├── to-lower-case.md │ ├── toeplitz-matrix.md │ ├── transform-to-chessboard.md │ └── valid-tic-tac-toe-state.md ├── 0800-0899/ │ ├── advantage-shuffle.md │ ├── all-nodes-distance-k-in-binary-tree.md │ ├── all-possible-full-binary-trees.md │ ├── ambiguous-coordinates.md │ ├── backspace-string-compare.md │ ├── binary-gap.md │ ├── binary-tree-pruning.md │ ├── binary-trees-with-factors.md │ ├── bitwise-ors-of-subarrays.md │ ├── boats-to-save-people.md │ ├── bricks-falling-when-hit.md │ ├── buddy-strings.md │ ├── bus-routes.md │ ├── car-fleet.md │ ├── card-flipping-game.md │ ├── chalkboard-xor-game.md │ ├── consecutive-numbers-sum.md │ ├── construct-binary-tree-from-preorder-and-postorder-traversal.md │ ├── count-unique-characters-of-all-substrings-of-a-given-string.md │ ├── decoded-string-at-index.md │ ├── exam-room.md │ ├── expressive-words.md │ ├── fair-candy-swap.md │ ├── find-and-replace-in-string.md │ ├── find-and-replace-pattern.md │ ├── find-eventual-safe-states.md │ ├── flipping-an-image.md │ ├── friends-of-appropriate-ages.md │ ├── goat-latin.md │ ├── groups-of-special-equivalent-strings.md │ ├── guess-the-word.md │ ├── hand-of-straights.md │ ├── image-overlap.md │ ├── increasing-order-search-tree.md │ ├── index.md │ ├── k-similar-strings.md │ ├── keys-and-rooms.md │ ├── koko-eating-bananas.md │ ├── largest-sum-of-averages.md │ ├── largest-triangle-area.md │ ├── leaf-similar-trees.md │ ├── lemonade-change.md │ ├── length-of-longest-fibonacci-subsequence.md │ ├── linked-list-components.md │ ├── longest-mountain-in-array.md │ ├── loud-and-rich.md │ ├── magic-squares-in-grid.md │ ├── making-a-large-island.md │ ├── masking-personal-information.md │ ├── max-increase-to-keep-city-skyline.md │ ├── maximize-distance-to-closest-person.md │ ├── maximum-frequency-stack.md │ ├── middle-of-the-linked-list.md │ ├── minimum-cost-to-hire-k-workers.md │ ├── minimum-number-of-refueling-stops.md │ ├── minimum-swaps-to-make-sequences-increasing.md │ ├── mirror-reflection.md │ ├── monotonic-array.md │ ├── most-common-word.md │ ├── most-profit-assigning-work.md │ ├── new-21-game.md │ ├── nth-magical-number.md │ ├── number-of-lines-to-write-string.md │ ├── orderly-queue.md │ ├── peak-index-in-a-mountain-array.md │ ├── positions-of-large-groups.md │ ├── possible-bipartition.md │ ├── prime-palindrome.md │ ├── profitable-schemes.md │ ├── projection-area-of-3d-shapes.md │ ├── push-dominoes.md │ ├── race-car.md │ ├── reachable-nodes-in-subdivided-graph.md │ ├── rectangle-area-ii.md │ ├── rectangle-overlap.md │ ├── reordered-power-of-2.md │ ├── score-after-flipping-matrix.md │ ├── score-of-parentheses.md │ ├── shifting-letters copy.md │ ├── shifting-letters.md │ ├── short-encoding-of-words.md │ ├── shortest-distance-to-a-character.md │ ├── shortest-path-to-get-all-keys.md │ ├── shortest-path-visiting-all-nodes.md │ ├── shortest-subarray-with-sum-at-least-k.md │ ├── similar-rgb-color.md │ ├── similar-string-groups.md │ ├── smallest-subtree-with-all-the-deepest-nodes.md │ ├── soup-servings.md │ ├── spiral-matrix-iii.md │ ├── split-array-into-fibonacci-sequence.md │ ├── split-array-with-same-average.md │ ├── stone-game.md │ ├── subdomain-visit-count.md │ ├── sum-of-distances-in-tree.md │ ├── sum-of-subsequence-widths.md │ ├── super-egg-drop.md │ ├── surface-area-of-3d-shapes.md │ ├── transpose-matrix.md │ ├── uncommon-words-from-two-sentences.md │ ├── unique-morse-code-words.md │ └── walking-robot-simulation.md ├── 0900-0999/ │ ├── 3sum-with-multiplicity.md │ ├── add-to-array-form-of-integer.md │ ├── array-of-doubled-pairs.md │ ├── available-captures-for-rook.md │ ├── bag-of-tokens.md │ ├── beautiful-array.md │ ├── binary-subarrays-with-sum.md │ ├── binary-tree-cameras.md │ ├── broken-calculator.md │ ├── cat-and-mouse.md │ ├── check-completeness-of-a-binary-tree.md │ ├── complete-binary-tree-inserter.md │ ├── cousins-in-binary-tree.md │ ├── delete-columns-to-make-sorted-ii.md │ ├── delete-columns-to-make-sorted-iii.md │ ├── delete-columns-to-make-sorted.md │ ├── di-string-match.md │ ├── distinct-subsequences-ii.md │ ├── distribute-coins-in-binary-tree.md │ ├── equal-rational-numbers.md │ ├── find-the-shortest-superstring.md │ ├── find-the-town-judge.md │ ├── flip-binary-tree-to-match-preorder-traversal.md │ ├── flip-equivalent-binary-trees.md │ ├── flip-string-to-monotone-increasing.md │ ├── fruit-into-baskets.md │ ├── index.md │ ├── interval-list-intersections.md │ ├── k-closest-points-to-origin.md │ ├── knight-dialer.md │ ├── largest-component-size-by-common-factor.md │ ├── largest-perimeter-triangle.md │ ├── largest-time-for-given-digits.md │ ├── least-operators-to-express-number.md │ ├── long-pressed-name.md │ ├── longest-turbulent-subarray.md │ ├── maximum-binary-tree-ii.md │ ├── maximum-sum-circular-subarray.md │ ├── maximum-width-ramp.md │ ├── minimize-malware-spread-ii.md │ ├── minimize-malware-spread.md │ ├── minimum-add-to-make-parentheses-valid.md │ ├── minimum-area-rectangle-ii.md │ ├── minimum-area-rectangle.md │ ├── minimum-cost-for-tickets.md │ ├── minimum-falling-path-sum.md │ ├── minimum-increment-to-make-array-unique.md │ ├── minimum-number-of-k-consecutive-bit-flips.md │ ├── most-stones-removed-with-same-row-or-column.md │ ├── n-repeated-element-in-size-2n-array.md │ ├── number-of-music-playlists.md │ ├── number-of-recent-calls.md │ ├── number-of-squareful-arrays.md │ ├── numbers-at-most-n-given-digit-set.md │ ├── numbers-with-same-consecutive-differences.md │ ├── odd-even-jump.md │ ├── online-election.md │ ├── online-stock-span.md │ ├── pancake-sorting.md │ ├── partition-array-into-disjoint-intervals.md │ ├── powerful-integers.md │ ├── prison-cells-after-n-days.md │ ├── range-sum-of-bst.md │ ├── regions-cut-by-slashes.md │ ├── reorder-data-in-log-files.md │ ├── reveal-cards-in-increasing-order.md │ ├── reverse-only-letters.md │ ├── rle-iterator.md │ ├── rotting-oranges.md │ ├── satisfiability-of-equality-equations.md │ ├── shortest-bridge.md │ ├── smallest-range-i.md │ ├── smallest-range-ii.md │ ├── smallest-string-starting-from-leaf.md │ ├── snakes-and-ladders.md │ ├── sort-an-array.md │ ├── sort-array-by-parity-ii.md │ ├── sort-array-by-parity.md │ ├── squares-of-a-sorted-array.md │ ├── stamping-the-sequence.md │ ├── string-without-aaa-or-bbb.md │ ├── subarray-sums-divisible-by-k.md │ ├── subarrays-with-k-different-integers.md │ ├── sum-of-even-numbers-after-queries.md │ ├── sum-of-subarray-minimums.md │ ├── super-palindromes.md │ ├── tallest-billboard.md │ ├── three-equal-parts.md │ ├── time-based-key-value-store.md │ ├── triples-with-bitwise-and-equal-to-zero.md │ ├── unique-email-addresses.md │ ├── unique-paths-iii.md │ ├── univalued-binary-tree.md │ ├── valid-mountain-array.md │ ├── valid-permutations-for-di-sequence.md │ ├── validate-stack-sequences.md │ ├── verifying-an-alien-dictionary.md │ ├── vertical-order-traversal-of-a-binary-tree.md │ ├── vowel-spellchecker.md │ ├── word-subsets.md │ └── x-of-a-kind-in-a-deck-of-cards.md ├── 1000-1099/ │ ├── best-sightseeing-pair.md │ ├── binary-search-tree-to-greater-sum-tree.md │ ├── camelcase-matching.md │ ├── capacity-to-ship-packages-within-d-days.md │ ├── coloring-a-border.md │ ├── complement-of-base-10-integer.md │ ├── construct-binary-search-tree-from-preorder-traversal.md │ ├── divisor-game.md │ ├── duplicate-zeros.md │ ├── find-common-characters.md │ ├── find-in-mountain-array.md │ ├── grumpy-bookstore-owner.md │ ├── height-checker.md │ ├── index-pairs-of-a-string.md │ ├── index.md │ ├── last-stone-weight-ii.md │ ├── letter-tile-possibilities.md │ ├── max-consecutive-ones-iii.md │ ├── maximize-sum-of-array-after-k-negations.md │ ├── minimum-cost-to-merge-stones.md │ ├── minimum-score-triangulation-of-polygon.md │ ├── number-of-enclaves.md │ ├── numbers-with-repeated-digits.md │ ├── recover-a-tree-from-preorder-traversal.md │ ├── remove-all-adjacent-duplicates-in-string.md │ ├── remove-outermost-parentheses.md │ ├── robot-bounded-in-circle.md │ ├── shortest-path-in-binary-matrix.md │ ├── smallest-subsequence-of-distinct-characters.md │ ├── stream-of-characters.md │ ├── two-city-scheduling.md │ ├── two-sum-less-than-k.md │ ├── uncrossed-lines.md │ └── valid-boomerang.md ├── 1100-1199/ │ ├── corporate-flight-bookings.md │ ├── defanging-an-ip-address.md │ ├── delete-nodes-and-return-forest.md │ ├── diet-plan-performance.md │ ├── distance-between-bus-stops.md │ ├── distribute-candies-to-people.md │ ├── find-k-length-substrings-with-no-repeated-characters.md │ ├── index.md │ ├── longest-common-subsequence.md │ ├── maximum-level-sum-of-a-binary-tree.md │ ├── minimum-swaps-to-group-all-1s-together.md │ ├── n-th-tribonacci-number.md │ ├── number-of-dice-rolls-with-target-sum.md │ ├── parallel-courses.md │ └── relative-sort-array.md ├── 1200-1299/ │ ├── airplane-seat-assignment-probability.md │ ├── check-if-it-is-a-straight-line.md │ ├── count-vowels-permutation.md │ ├── divide-array-in-sets-of-k-consecutive-numbers.md │ ├── find-elements-in-a-contaminated-binary-tree.md │ ├── get-equal-substrings-within-budget.md │ ├── index.md │ ├── meeting-scheduler.md │ ├── minimum-cost-to-move-chips-to-the-same-position.md │ ├── minimum-swaps-to-make-strings-equal.md │ ├── minimum-time-visiting-all-points.md │ ├── number-of-closed-islands.md │ ├── reconstruct-a-2-row-binary-matrix.md │ ├── search-suggestions-system.md │ ├── smallest-string-with-swaps.md │ ├── subtract-the-product-and-sum-of-digits-of-an-integer.md │ └── tree-diameter.md ├── 1300-1399/ │ ├── all-elements-in-two-binary-search-trees.md │ ├── angle-between-hands-of-a-clock.md │ ├── closest-divisors.md │ ├── convert-integer-to-the-sum-of-two-no-zero-integers.md │ ├── decompress-run-length-encoded-list.md │ ├── design-a-stack-with-increment-operation.md │ ├── index.md │ ├── maximum-students-taking-exam.md │ ├── minimum-number-of-steps-to-make-two-strings-anagram.md │ ├── number-of-operations-to-make-network-connected.md │ ├── number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.md │ ├── number-of-substrings-containing-all-three-characters.md │ ├── print-words-vertically.md │ ├── reduce-array-size-to-the-half.md │ ├── sum-of-mutated-array-closest-to-target.md │ └── xor-queries-of-a-subarray.md ├── 1400-1499/ │ ├── average-salary-excluding-the-minimum-and-maximum-salary.md │ ├── consecutive-characters.md │ ├── construct-k-palindrome-strings.md │ ├── form-largest-integer-with-digits-that-add-up-to-target.md │ ├── index.md │ ├── longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.md │ ├── longest-subarray-of-1s-after-deleting-one-element.md │ ├── maximum-number-of-vowels-in-a-substring-of-given-length.md │ ├── maximum-points-you-can-obtain-from-cards.md │ ├── maximum-score-after-splitting-a-string.md │ ├── minimum-number-of-days-to-make-m-bouquets.md │ ├── number-of-students-doing-homework-at-a-given-time.md │ ├── path-crossing.md │ ├── rearrange-words-in-a-sentence.md │ ├── running-sum-of-1d-array.md │ ├── simplified-fractions.md │ ├── string-matching-in-an-array.md │ ├── subrectangle-queries.md │ └── xor-operation-in-an-array.md ├── 1500-1599/ │ ├── can-make-arithmetic-progression-from-sequence.md │ ├── count-good-triplets.md │ ├── count-odd-numbers-in-an-interval-range.md │ ├── index.md │ ├── maximum-length-of-subarray-with-positive-product.md │ ├── maximum-number-of-coins-you-can-get.md │ ├── min-cost-to-connect-all-points.md │ ├── minimum-cost-to-connect-two-groups-of-points.md │ ├── minimum-cost-to-cut-a-stick.md │ ├── minimum-operations-to-make-array-equal.md │ ├── reformat-date.md │ ├── special-positions-in-a-binary-matrix.md │ ├── split-a-string-into-the-max-number-of-unique-substrings.md │ └── thousand-separator.md ├── 1600-1699/ │ ├── count-sorted-vowel-strings.md │ ├── count-subtrees-with-max-distance-between-cities.md │ ├── design-parking-system.md │ ├── determine-if-two-strings-are-close.md │ ├── find-valid-matrix-given-row-and-column-sums.md │ ├── get-maximum-in-generated-array.md │ ├── index.md │ ├── maximum-erasure-value.md │ ├── maximum-nesting-depth-of-the-parentheses.md │ ├── minimum-deletions-to-make-character-frequencies-unique.md │ ├── minimum-operations-to-reduce-x-to-zero.md │ ├── number-of-distinct-substrings-in-a-string.md │ ├── path-with-minimum-effort.md │ └── richest-customer-wealth.md ├── 1700-1799/ │ ├── calculate-money-in-leetcode-bank.md │ ├── check-if-one-string-swap-can-make-strings-equal.md │ ├── decode-xored-array.md │ ├── find-center-of-star-graph.md │ ├── find-nearest-point-that-has-the-same-x-or-y-coordinate.md │ ├── index.md │ ├── latest-time-by-replacing-hidden-digits.md │ ├── longest-nice-substring.md │ ├── maximum-absolute-sum-of-any-subarray.md │ ├── maximum-number-of-balls-in-a-box.md │ ├── maximum-units-on-a-truck.md │ └── tuple-with-same-product.md ├── 1800-1899/ │ ├── check-if-all-the-integers-in-a-range-are-covered.md │ ├── index.md │ ├── longest-word-with-all-prefixes.md │ ├── maximum-ice-cream-bars.md │ ├── minimize-maximum-pair-sum-in-array.md │ ├── minimum-operations-to-make-the-array-increasing.md │ ├── minimum-xor-sum-of-two-arrays.md │ ├── redistribute-characters-to-make-all-strings-equal.md │ ├── replace-all-digits-with-characters.md │ ├── sign-of-the-product-of-an-array.md │ ├── sorting-the-sentence.md │ └── substrings-of-size-three-with-distinct-characters.md ├── 1900-1999/ │ ├── add-minimum-number-of-rungs.md │ ├── check-if-all-characters-have-equal-number-of-occurrences.md │ ├── concatenation-of-array.md │ ├── count-square-sum-triples.md │ ├── eliminate-maximum-number-of-monsters.md │ ├── find-the-middle-index-in-array.md │ ├── index.md │ ├── largest-odd-number-in-string.md │ ├── maximum-compatibility-score-sum.md │ ├── minimum-difference-between-highest-and-lowest-of-k-scores.md │ ├── minimum-number-of-work-sessions-to-finish-the-tasks.md │ ├── the-number-of-good-subsets.md │ └── unique-length-3-palindromic-subsequences.md ├── 2000-2099/ │ ├── final-value-of-variable-after-performing-operations.md │ ├── index.md │ ├── number-of-pairs-of-strings-with-concatenation-equal-to-target.md │ └── parallel-courses-iii.md ├── 2100-2199/ │ ├── find-substring-with-given-hash-value.md │ ├── index.md │ └── maximum-and-sum-of-array.md ├── 2200-2299/ │ ├── add-two-integers.md │ ├── count-integers-in-intervals.md │ ├── count-lattice-points-inside-a-circle.md │ ├── index.md │ └── longest-path-with-different-adjacent-characters.md ├── 2300-2399/ │ ├── count-special-integers.md │ └── index.md ├── 2400-2499/ │ ├── index.md │ └── number-of-common-factors.md ├── 2500-2599/ │ ├── difference-between-maximum-and-minimum-price-sum.md │ ├── index.md │ └── number-of-ways-to-earn-points.md ├── 2700-2799/ │ ├── count-of-integers.md │ └── index.md ├── LCR/ │ ├── 0H97ZC.md │ ├── 0on3uN.md │ ├── 0ynMMM.md │ ├── 1fGaJU.md │ ├── 21dk04.md │ ├── 2AoeFn.md │ ├── 2VG8Kg.md │ ├── 2bCMpM.md │ ├── 3Etpl5.md │ ├── 3u1WK4.md │ ├── 4sjJUc.md │ ├── 4ueAj6.md │ ├── 569nqc.md │ ├── 6eUYwP.md │ ├── 7LpjUW.md │ ├── 7WHec2.md │ ├── 7WqeDu.md │ ├── 7p8L0Z.md │ ├── 8Zf90G.md │ ├── A1NYOS.md │ ├── D0F0SV.md │ ├── FortPu.md │ ├── Gu0c2T.md │ ├── GzCJIP.md │ ├── H8086Q.md │ ├── IDBivT.md │ ├── JFETK5.md │ ├── LGjMqU.md │ ├── LwUNpT.md │ ├── M1oyTv.md │ ├── M99OJA.md │ ├── N6YdxV.md │ ├── NUPfPr.md │ ├── NYBBNL.md │ ├── NaqhDT.md │ ├── O4NDxx.md │ ├── OrIXps.md │ ├── P5rCT8.md │ ├── PzWKhm.md │ ├── Q91FMA.md │ ├── QA2IGt.md │ ├── QC3q1f.md │ ├── QTMn0o.md │ ├── Qv1Da2.md │ ├── RQku0D.md │ ├── SLwz0R.md │ ├── SsGoHC.md │ ├── TVdhkn.md │ ├── UHnkqh.md │ ├── US1pGT.md │ ├── UhWRSj.md │ ├── VvJkup.md │ ├── WGki4K.md │ ├── WNC0Lk.md │ ├── WhsWhI.md │ ├── XagZNi.md │ ├── XltzEq.md │ ├── YaVDxD.md │ ├── Ygoe9J.md │ ├── ZL6zAn.md │ ├── ZVAVXX.md │ ├── a7VOhD.md │ ├── aMhZSa.md │ ├── aseY1I.md │ ├── bLyHh0.md │ ├── ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof.md │ ├── ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof.md │ ├── ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof.md │ ├── bao-han-minhan-shu-de-zhan-lcof.md │ ├── bu-ke-pai-zhong-de-shun-zi-lcof.md │ ├── bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof.md │ ├── c32eOV.md │ ├── chou-shu-lcof.md │ ├── cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof.md │ ├── cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof.md │ ├── cong-shang-dao-xia-da-yin-er-cha-shu-lcof.md │ ├── cong-wei-dao-tou-da-yin-lian-biao-lcof.md │ ├── dKk3P7.md │ ├── da-yin-cong-1dao-zui-da-de-nwei-shu-lcof.md │ ├── di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof.md │ ├── diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.md │ ├── dui-cheng-de-er-cha-shu-lcof.md │ ├── dui-lie-de-zui-da-zhi-lcof.md │ ├── er-cha-shu-de-jing-xiang-lcof.md │ ├── er-cha-shu-de-shen-du-lcof.md │ ├── er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof.md │ ├── er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof.md │ ├── er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof.md │ ├── er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof.md │ ├── er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof.md │ ├── er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof.md │ ├── er-jin-zhi-zhong-1de-ge-shu-lcof.md │ ├── er-wei-shu-zu-zhong-de-cha-zhao-lcof.md │ ├── fan-zhuan-dan-ci-shun-xu-lcof.md │ ├── fan-zhuan-lian-biao-lcof.md │ ├── fei-bo-na-qi-shu-lie-lcof.md │ ├── fpTFWP.md │ ├── fu-za-lian-biao-de-fu-zhi-lcof.md │ ├── g5c51o.md │ ├── gaM7Ch.md │ ├── gou-jian-cheng-ji-shu-zu-lcof.md │ ├── gu-piao-de-zui-da-li-run-lcof.md │ ├── h54YBf.md │ ├── hPov7L.md │ ├── he-bing-liang-ge-pai-xu-de-lian-biao-lcof.md │ ├── he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof.md │ ├── he-wei-sde-liang-ge-shu-zi-lcof.md │ ├── hua-dong-chuang-kou-de-zui-da-zhi-lcof.md │ ├── iIQa4I.md │ ├── iSwD2y.md │ ├── index.md │ ├── jBjn9C.md │ ├── jC7MId.md │ ├── jJ0w9p.md │ ├── ji-qi-ren-de-yun-dong-fan-wei-lcof.md │ ├── jian-sheng-zi-lcof.md │ ├── ju-zhen-zhong-de-lu-jing-lcof.md │ ├── kLl5u1.md │ ├── kTOapQ.md │ ├── lMSNwu.md │ ├── li-wu-de-zui-da-jie-zhi-lcof.md │ ├── lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof.md │ ├── lian-xu-zi-shu-zu-de-zui-da-he-lcof.md │ ├── liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof.md │ ├── lwyVBB.md │ ├── ms70jA.md │ ├── nZZqjQ.md │ ├── om3reC.md │ ├── opLdQZ.md │ ├── pOCWxh.md │ ├── ping-heng-er-cha-shu-lcof.md │ ├── qIsx9U.md │ ├── qJnOS7.md │ ├── qing-wa-tiao-tai-jie-wen-ti-lcof.md │ ├── qiu-12n-lcof.md │ ├── que-shi-de-shu-zi-lcof.md │ ├── sfvd7V.md │ ├── shan-chu-lian-biao-de-jie-dian-lcof.md │ ├── shu-de-zi-jie-gou-lcof.md │ ├── shu-ju-liu-zhong-de-zhong-wei-shu-lcof.md │ ├── shu-zhi-de-zheng-shu-ci-fang-lcof.md │ ├── shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof.md │ ├── shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof.md │ ├── shu-zu-zhong-de-ni-xu-dui-lcof.md │ ├── shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof.md │ ├── shu-zu-zhong-zhong-fu-de-shu-zi-lcof.md │ ├── shun-shi-zhen-da-yin-ju-zhen-lcof.md │ ├── ti-huan-kong-ge-lcof.md │ ├── tvdfij.md │ ├── uUsW3B.md │ ├── vEAB3K.md │ ├── vlzXQL.md │ ├── vvXgSW.md │ ├── w3tCBm.md │ ├── w6cpku.md │ ├── wtcaE1.md │ ├── xoh6Oh.md │ ├── xu-lie-hua-er-cha-shu-lcof.md │ ├── xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof.md │ ├── xx4gT2.md │ ├── yong-liang-ge-zhan-shi-xian-dui-lie-lcof.md │ ├── yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof.md │ ├── z1R5dt.md │ ├── zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof.md │ ├── zhan-de-ya-ru-dan-chu-xu-lie-lcof.md │ ├── zhong-jian-er-cha-shu-lcof.md │ ├── zi-fu-chuan-de-pai-lie-lcof.md │ ├── zlDJc7.md │ ├── zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof.md │ ├── zui-xiao-de-kge-shu-lcof.md │ └── zuo-xuan-zhuan-zi-fu-chuan-lcof.md ├── index.md └── interviews/ ├── bracket-lcci.md ├── calculator-lcci.md ├── color-fill-lcci.md ├── eight-queens-lcci.md ├── factorial-zeros-lcci.md ├── first-common-ancestor-lcci.md ├── group-anagrams-lcci.md ├── implement-queue-using-stacks-lcci.md ├── index.md ├── intersection-of-two-linked-lists-lcci.md ├── kth-node-from-end-of-list-lcci.md ├── legal-binary-search-tree-lcci.md ├── linked-list-cycle-lcci.md ├── longest-word-lcci.md ├── min-stack-lcci.md ├── minimum-height-tree-lcci.md ├── multi-search-lcci.md ├── number-of-2s-in-range-lcci.md ├── palindrome-linked-list-lcci.md ├── paths-with-sum-lcci.md ├── permutation-i-lcci.md ├── permutation-ii-lcci.md ├── power-set-lcci.md ├── rotate-matrix-lcci.md ├── smallest-k-lcci.md ├── sorted-matrix-search-lcci.md ├── sorted-merge-lcci.md ├── successor-lcci.md ├── sum-lists-lcci.md ├── words-frequency-lcci.md └── zero-matrix-lcci.md