Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/weak-head/leetcode

:computer: :wine_glass: Solutions to LeetCode problems
https://github.com/weak-head/leetcode

leetcode leetcode-python leetcode-solutions python

Last synced: 9 days ago
JSON representation

:computer: :wine_glass: Solutions to LeetCode problems

Awesome Lists containing this project

README

        

# leetcode

[![Build Status][travis-img]][travis-url]
[![codecov][codecov-img]][codecov-url]
[![Codacy Coverage][codacy-cov-img]][codacy-cov-url]
[![Gitpod][gitpod-img]][gitpod-url]
[![Codacy Code Quality][codacy-qlt-img]][codacy-qlt-url]
[![flake8][flake8-img]][flake8-url]
[![CodeQL][codeql-img]][codeql-url]
[![Python 3.9][python-39-img]][python-39-url]
[![black][black-img]][black-url]
[![][tokei-ln-img]][tokei-ln-url]

[travis-img]: https://app.travis-ci.com/weak-head/leetcode.svg?branch=main
[travis-url]: https://app.travis-ci.com/github/weak-head/leetcode

[codecov-img]: https://codecov.io/gh/weak-head/leetcode/branch/main/graph/badge.svg
[codecov-url]: https://codecov.io/gh/weak-head/leetcode

[codacy-cov-img]: https://app.codacy.com/project/badge/Coverage/7780e21ba17046a3b43fe68a77677bed
[codacy-cov-url]: https://app.codacy.com/gh/weak-head/leetcode/dashboard?branch=main

[codacy-qlt-img]: https://app.codacy.com/project/badge/Grade/7780e21ba17046a3b43fe68a77677bed
[codacy-qlt-url]: https://www.codacy.com/gh/weak-head/leetcode/dashboard?branch=main

[tokei-ln-img]: https://tokei.rs/b1/github/weak-head/leetcode?category=code
[tokei-ln-url]: https://github.com/weak-head/leetcode/tree/main/leetcode

[python-39-img]: https://img.shields.io/badge/python-3.9-blue.svg
[python-39-url]: https://www.python.org/downloads/release/python-390/

[flake8-img]: https://github.com/weak-head/leetcode/workflows/flake8/badge.svg
[flake8-url]: https://github.com/weak-head/leetcode/actions?query=workflow%3Aflake8

[codeql-img]: https://github.com/weak-head/leetcode/workflows/CodeQL/badge.svg
[codeql-url]: https://github.com/weak-head/leetcode/actions?query=workflow%3ACodeQL

[black-img]: https://img.shields.io/badge/code%20style-black-000000.svg
[black-url]: https://github.com/psf/black

[gitpod-img]: https://img.shields.io/badge/Gitpod-ready--to--code-blue?logo=gitpod
[gitpod-url]: https://gitpod.io/#https://github.com/weak-head/leetcode

## Open in Gitpod

[![Open in Gitpod](https://img.shields.io/badge/Gitpod-Open%20in%20Gitpod-%230092CF.svg)](https://gitpod.io#https://github.com/weak-head/leetcode/)

And you are ready to play with the repo.
Or alternatively setup your own local environment...

## Environment setup

```bash
# Install python
pyenv install 3.9.0

# Create virtual env
pyenv virtualenv 3.9.0 leetcode
pyenv local leetcode

# Install dependencies
pip install pipenv
pipenv install --dev

# Optional, enable pre-commit hook
pre-commit install
```

## Typical flow

```bash
# Create a new template for the problem
# Example:
# make new 1 https://leetcode.com/problems/two-sum/
make new

# Stage changes and run test cases for this problem
# This will execute:
# - git add .
# - pre-commit
# - pytest
make add

# Commit changes
# This will:
# - stage changes
# - run test cases
# - generate commit message
# - commit changes
make commit
```

## List of Problems (Total: 404)
| # | Title | Solution | Test cases |
|-----:|-----------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------|----------------------------------------------------------------------------------------|
| 1 | [Two Sum](https://leetcode.com/problems/two-sum/) | [src](leetcode/p0001_two_sum.py) | [tst](tests/test_p0001_two_sum.py) |
| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [src](leetcode/p0002_add_two_numbers.py) | [tst](tests/test_p0002_add_two_numbers.py) |
| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [src](leetcode/p0003_longest_substring_without_repeating_characters.py) | [tst](tests/test_p0003_longest_substring_without_repeating_characters.py) |
| 4 | [Median Of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [src](leetcode/p0004_median_of_two_sorted_arrays.py) | [tst](tests/test_p0004_median_of_two_sorted_arrays.py) |
| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [src](leetcode/p0005_longest_palindromic_substring.py) | [tst](tests/test_p0005_longest_palindromic_substring.py) |
| 6 | [Zigzag Conversion](https://leetcode.com/problems/zigzag-conversion/) | [src](leetcode/p0006_zigzag_conversion.py) | [tst](tests/test_p0006_zigzag_conversion.py) |
| 7 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | [src](leetcode/p0007_reverse_integer.py) | [tst](tests/test_p0007_reverse_integer.py) |
| 8 | [String To Integer Atoi](https://leetcode.com/problems/string-to-integer-atoi/) | [src](leetcode/p0008_string_to_integer_atoi.py) | [tst](tests/test_p0008_string_to_integer_atoi.py) |
| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [src](leetcode/p0009_palindrome_number.py) | [tst](tests/test_p0009_palindrome_number.py) |
| 10 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) | [src](leetcode/p0010_regular_expression_matching.py) | [tst](tests/test_p0010_regular_expression_matching.py) |
| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [src](leetcode/p0011_container_with_most_water.py) | [tst](tests/test_p0011_container_with_most_water.py) |
| 12 | [Integer To Roman](https://leetcode.com/problems/integer-to-roman/) | [src](leetcode/p0012_integer_to_roman.py) | [tst](tests/test_p0012_integer_to_roman.py) |
| 13 | [Roman To Integer](https://leetcode.com/problems/roman-to-integer/) | [src](leetcode/p0013_roman_to_integer.py) | [tst](tests/test_p0013_roman_to_integer.py) |
| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | [src](leetcode/p0014_longest_common_prefix.py) | [tst](tests/test_p0014_longest_common_prefix.py) |
| 15 | [3Sum](https://leetcode.com/problems/3sum/) | [src](leetcode/p0015_3sum.py) | [tst](tests/test_p0015_3sum.py) |
| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest/) | [src](leetcode/p0016_3sum_closest.py) | [tst](tests/test_p0016_3sum_closest.py) |
| 17 | [Letter Combinations Of A Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | [src](leetcode/p0017_letter_combinations_of_a_phone_number.py) | [tst](tests/test_p0017_letter_combinations_of_a_phone_number.py) |
| 18 | [4Sum](https://leetcode.com/problems/4sum/) | [src](leetcode/p0018_4sum.py) | [tst](tests/test_p0018_4sum.py) |
| 19 | [Remove Nth Node From End Of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [src](leetcode/p0019_remove_nth_node_from_end_of_list.py) | [tst](tests/test_p0019_remove_nth_node_from_end_of_list.py) |
| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [src](leetcode/p0020_valid_parentheses.py) | [tst](tests/test_p0020_valid_parentheses.py) |
| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [src](leetcode/p0021_merge_two_sorted_lists.py) | [tst](tests/test_p0021_merge_two_sorted_lists.py) |
| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | [src](leetcode/p0022_generate_parentheses.py) | [tst](tests/test_p0022_generate_parentheses.py) |
| 23 | [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | [src](leetcode/p0023_merge_k_sorted_lists.py) | [tst](tests/test_p0023_merge_k_sorted_lists.py) |
| 24 | [Swap Nodes In Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | [src](leetcode/p0024_swap_nodes_in_pairs.py) | [tst](tests/test_p0024_swap_nodes_in_pairs.py) |
| 25 | [Reverse Nodes In K Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | [src](leetcode/p0025_reverse_nodes_in_k_group.py) | [tst](tests/test_p0025_reverse_nodes_in_k_group.py) |
| 26 | [Remove Duplicates From Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [src](leetcode/p0026_remove_duplicates_from_sorted_array.py) | [tst](tests/test_p0026_remove_duplicates_from_sorted_array.py) |
| 27 | [Remove Element](https://leetcode.com/problems/remove-element/) | [src](leetcode/p0027_remove_element.py) | [tst](tests/test_p0027_remove_element.py) |
| 28 | [Implement Strstr](https://leetcode.com/problems/implement-strstr/) | [src](leetcode/p0028_implement_strstr.py) | [tst](tests/test_p0028_implement_strstr.py) |
| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | [src](leetcode/p0029_divide_two_integers.py) | [tst](tests/test_p0029_divide_two_integers.py) |
| 30 | [Substring With Concatenation Of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/) | [src](leetcode/p0030_substring_with_concatenation_of_all_words.py) | [tst](tests/test_p0030_substring_with_concatenation_of_all_words.py) |
| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation/) | [src](leetcode/p0031_next_permutation.py) | [tst](tests/test_p0031_next_permutation.py) |
| 32 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | [src](leetcode/p0032_longest_valid_parentheses.py) | [tst](tests/test_p0032_longest_valid_parentheses.py) |
| 33 | [Search In Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [src](leetcode/p0033_search_in_rotated_sorted_array.py) | [tst](tests/test_p0033_search_in_rotated_sorted_array.py) |
| 34 | [Find First And Last Position Of Element In Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) | [src](leetcode/p0034_find_first_and_last_position_of_element_in_sorted_array.py) | [tst](tests/test_p0034_find_first_and_last_position_of_element_in_sorted_array.py) |
| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [src](leetcode/p0035_search_insert_position.py) | [tst](tests/test_p0035_search_insert_position.py) |
| 36 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | [src](leetcode/p0036_valid_sudoku.py) | [tst](tests/test_p0036_valid_sudoku.py) |
| 37 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | [src](leetcode/p0037_sudoku_solver.py) | [tst](tests/test_p0037_sudoku_solver.py) |
| 38 | [Count And Say](https://leetcode.com/problems/count-and-say/) | [src](leetcode/p0038_count_and_say.py) | [tst](tests/test_p0038_count_and_say.py) |
| 39 | [Combination Sum](https://leetcode.com/problems/combination-sum/) | [src](leetcode/p0039_combination_sum.py) | [tst](tests/test_p0039_combination_sum.py) |
| 40 | [Combination Sum Ii](https://leetcode.com/problems/combination-sum-ii/) | [src](leetcode/p0040_combination_sum_ii.py) | [tst](tests/test_p0040_combination_sum_ii.py) |
| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | [src](leetcode/p0041_first_missing_positive.py) | [tst](tests/test_p0041_first_missing_positive.py) |
| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | [src](leetcode/p0042_trapping_rain_water.py) | [tst](tests/test_p0042_trapping_rain_water.py) |
| 43 | [Multiply Strings](https://leetcode.com/problems/multiply-strings/) | [src](leetcode/p0043_multiply_strings.py) | [tst](tests/test_p0043_multiply_strings.py) |
| 44 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching/) | [src](leetcode/p0044_wildcard_matching.py) | [tst](tests/test_p0044_wildcard_matching.py) |
| 45 | [Jump Game Ii](https://leetcode.com/problems/jump-game-ii/) | [src](leetcode/p0045_jump_game_ii.py) | [tst](tests/test_p0045_jump_game_ii.py) |
| 46 | [Permutations](https://leetcode.com/problems/permutations/) | [src](leetcode/p0046_permutations.py) | [tst](tests/test_p0046_permutations.py) |
| 47 | [Permutations Ii](https://leetcode.com/problems/permutations-ii/) | [src](leetcode/p0047_permutations_ii.py) | [tst](tests/test_p0047_permutations_ii.py) |
| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | [src](leetcode/p0048_rotate_image.py) | [tst](tests/test_p0048_rotate_image.py) |
| 49 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | [src](leetcode/p0049_group_anagrams.py) | [tst](tests/test_p0049_group_anagrams.py) |
| 50 | [Powx N](https://leetcode.com/problems/powx-n/) | [src](leetcode/p0050_powx_n.py) | [tst](tests/test_p0050_powx_n.py) |
| 51 | [N Queens](https://leetcode.com/problems/n-queens/) | [src](leetcode/p0051_n_queens.py) | [tst](tests/test_p0051_n_queens.py) |
| 52 | [N Queens Ii](https://leetcode.com/problems/n-queens-ii/) | [src](leetcode/p0052_n_queens_ii.py) | [tst](tests/test_p0052_n_queens_ii.py) |
| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [src](leetcode/p0053_maximum_subarray.py) | [tst](tests/test_p0053_maximum_subarray.py) |
| 54 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | [src](leetcode/p0054_spiral_matrix.py) | [tst](tests/test_p0054_spiral_matrix.py) |
| 55 | [Jump Game](https://leetcode.com/problems/jump-game/) | [src](leetcode/p0055_jump_game.py) | [tst](tests/test_p0055_jump_game.py) |
| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | [src](leetcode/p0056_merge_intervals.py) | [tst](tests/test_p0056_merge_intervals.py) |
| 58 | [Length Of Last Word](https://leetcode.com/problems/length-of-last-word/) | [src](leetcode/p0058_length_of_last_word.py) | [tst](tests/test_p0058_length_of_last_word.py) |
| 61 | [Rotate List](https://leetcode.com/problems/rotate-list/) | [src](leetcode/p0061_rotate_list.py) | [tst](tests/test_p0061_rotate_list.py) |
| 63 | [Unique Paths Ii](https://leetcode.com/problems/unique-paths-ii/) | [src](leetcode/p0063_unique_paths_ii.py) | [tst](tests/test_p0063_unique_paths_ii.py) |
| 64 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | [src](leetcode/p0064_minimum_path_sum.py) | [tst](tests/test_p0064_minimum_path_sum.py) |
| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path/) | [src](leetcode/p0071_simplify_path.py) | [tst](tests/test_p0071_simplify_path.py) |
| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance/) | [src](leetcode/p0072_edit_distance.py) | [tst](tests/test_p0072_edit_distance.py) |
| 74 | [Search A 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | [src](leetcode/p0074_search_a_2d_matrix.py) | [tst](tests/test_p0074_search_a_2d_matrix.py) |
| 75 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | [src](leetcode/p0075_sort_colors.py) | [tst](tests/test_p0075_sort_colors.py) |
| 76 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | [src](leetcode/p0076_minimum_window_substring.py) | [tst](tests/test_p0076_minimum_window_substring.py) |
| 77 | [Combinations](https://leetcode.com/problems/combinations/) | [src](leetcode/p0077_combinations.py) | [tst](tests/test_p0077_combinations.py) |
| 78 | [Subsets](https://leetcode.com/problems/subsets/) | [src](leetcode/p0078_subsets.py) | [tst](tests/test_p0078_subsets.py) |
| 79 | [Word Search](https://leetcode.com/problems/word-search/) | [src](leetcode/p0079_word_search.py) | [tst](tests/test_p0079_word_search.py) |
| 84 | [Largest Rectangle In Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) | [src](leetcode/p0084_largest_rectangle_in_histogram.py) | [tst](tests/test_p0084_largest_rectangle_in_histogram.py) |
| 86 | [Partition List](https://leetcode.com/problems/partition-list/) | [src](leetcode/p0086_partition_list.py) | [tst](tests/test_p0086_partition_list.py) |
| 90 | [Subsets Ii](https://leetcode.com/problems/subsets-ii/) | [src](leetcode/p0090_subsets_ii.py) | [tst](tests/test_p0090_subsets_ii.py) |
| 91 | [Decode Ways](https://leetcode.com/problems/decode-ways/) | [src](leetcode/p0091_decode_ways.py) | [tst](tests/test_p0091_decode_ways.py) |
| 92 | [Reverse Linked List Ii](https://leetcode.com/problems/reverse-linked-list-ii/) | [src](leetcode/p0092_reverse_linked_list_ii.py) | [tst](tests/test_p0092_reverse_linked_list_ii.py) |
| 95 | [Unique Binary Search Trees Ii](https://leetcode.com/problems/unique-binary-search-trees-ii/) | [src](leetcode/p0095_unique_binary_search_trees_ii.py) | [tst](tests/test_p0095_unique_binary_search_trees_ii.py) |
| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | [src](leetcode/p0098_validate_binary_search_tree.py) | [tst](tests/test_p0098_validate_binary_search_tree.py) |
| 99 | [Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/) | [src](leetcode/p0099_recover_binary_search_tree.py) | [tst](tests/test_p0099_recover_binary_search_tree.py) |
| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | [src](leetcode/p0101_symmetric_tree.py) | [tst](tests/test_p0101_symmetric_tree.py) |
| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [src](leetcode/p0102_binary_tree_level_order_traversal.py) | [tst](tests/test_p0102_binary_tree_level_order_traversal.py) |
| 103 | [Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/) | [src](leetcode/p0103_binary_tree_zigzag_level_order_traversal.py) | [tst](tests/test_p0103_binary_tree_zigzag_level_order_traversal.py) |
| 105 | [Construct Binary Tree From Preorder And Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [src](leetcode/p0105_construct_binary_tree_from_preorder_and_inorder_traversal.py) | [tst](tests/test_p0105_construct_binary_tree_from_preorder_and_inorder_traversal.py) |
| 108 | [Convert Sorted Array To Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | [src](leetcode/p0108_convert_sorted_array_to_binary_search_tree.py) | [tst](tests/test_p0108_convert_sorted_array_to_binary_search_tree.py) |
| 109 | [Convert Sorted List To Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/) | [src](leetcode/p0109_convert_sorted_list_to_binary_search_tree.py) | [tst](tests/test_p0109_convert_sorted_list_to_binary_search_tree.py) |
| 112 | [Path Sum](https://leetcode.com/problems/path-sum/) | [src](leetcode/p0112_path_sum.py) | [tst](tests/test_p0112_path_sum.py) |
| 113 | [Path Sum Ii](https://leetcode.com/problems/path-sum-ii/) | [src](leetcode/p0113_path_sum_ii.py) | [tst](tests/test_p0113_path_sum_ii.py) |
| 118 | [Pascals Triangle](https://leetcode.com/problems/pascals-triangle/) | [src](leetcode/p0118_pascals_triangle.py) | [tst](tests/test_p0118_pascals_triangle.py) |
| 120 | [Triangle](https://leetcode.com/problems/triangle/) | [src](leetcode/p0120_triangle.py) | [tst](tests/test_p0120_triangle.py) |
| 121 | [Best Time To Buy And Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [src](leetcode/p0121_best_time_to_buy_and_sell_stock.py) | [tst](tests/test_p0121_best_time_to_buy_and_sell_stock.py) |
| 122 | [Best Time To Buy And Sell Stock Ii](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | [src](leetcode/p0122_best_time_to_buy_and_sell_stock_ii.py) | [tst](tests/test_p0122_best_time_to_buy_and_sell_stock_ii.py) |
| 123 | [Best Time To Buy And Sell Stock Iii](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) | [src](leetcode/p0123_best_time_to_buy_and_sell_stock_iii.py) | [tst](tests/test_p0123_best_time_to_buy_and_sell_stock_iii.py) |
| 124 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | [src](leetcode/p0124_binary_tree_maximum_path_sum.py) | [tst](tests/test_p0124_binary_tree_maximum_path_sum.py) |
| 127 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | [src](leetcode/p0127_word_ladder.py) | [tst](tests/test_p0127_word_ladder.py) |
| 130 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) | [src](leetcode/p0130_surrounded_regions.py) | [tst](tests/test_p0130_surrounded_regions.py) |
| 133 | [Clone Graph](https://leetcode.com/problems/clone-graph/) | [src](leetcode/p0133_clone_graph.py) | [tst](tests/test_p0133_clone_graph.py) |
| 135 | [Candy](https://leetcode.com/problems/candy/) | [src](leetcode/p0135_candy.py) | [tst](tests/test_p0135_candy.py) |
| 136 | [Single Number](https://leetcode.com/problems/single-number/) | [src](leetcode/p0136_single_number.py) | [tst](tests/test_p0136_single_number.py) |
| 138 | [Copy List With Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) | [src](leetcode/p0138_copy_list_with_random_pointer.py) | [tst](tests/test_p0138_copy_list_with_random_pointer.py) |
| 139 | [Word Break](https://leetcode.com/problems/word-break/) | [src](leetcode/p0139_word_break.py) | [tst](tests/test_p0139_word_break.py) |
| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | [src](leetcode/p0141_linked_list_cycle.py) | [tst](tests/test_p0141_linked_list_cycle.py) |
| 142 | [Linked List Cycle Ii](https://leetcode.com/problems/linked-list-cycle-ii/) | [src](leetcode/p0142_linked_list_cycle_ii.py) | [tst](tests/test_p0142_linked_list_cycle_ii.py) |
| 146 | [Lru Cache](https://leetcode.com/problems/lru-cache/) | [src](leetcode/p0146_lru_cache.py) | [tst](tests/test_p0146_lru_cache.py) |
| 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | [src](leetcode/p0150_evaluate_reverse_polish_notation.py) | [tst](tests/test_p0150_evaluate_reverse_polish_notation.py) |
| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | [src](leetcode/p0152_maximum_product_subarray.py) | [tst](tests/test_p0152_maximum_product_subarray.py) |
| 157 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/) | [src](leetcode/p0157_read_n_characters_given_read4.py) | [tst](tests/test_p0157_read_n_characters_given_read4.py) |
| 158 | [Read N Characters Given Read4 Ii Call Multiple Times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/) | [src](leetcode/p0158_read_n_characters_given_read4_ii_call_multiple_times.py) | [tst](tests/test_p0158_read_n_characters_given_read4_ii_call_multiple_times.py) |
| 160 | [Intersection Of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [src](leetcode/p0160_intersection_of_two_linked_lists.py) | [tst](tests/test_p0160_intersection_of_two_linked_lists.py) |
| 161 | [One Edit Distance](https://leetcode.com/problems/one-edit-distance/) | [src](leetcode/p0161_one_edit_distance.py) | [tst](tests/test_p0161_one_edit_distance.py) |
| 174 | [Dungeon Game](https://leetcode.com/problems/dungeon-game/) | [src](leetcode/p0174_dungeon_game.py) | [tst](tests/test_p0174_dungeon_game.py) |
| 188 | [Best Time To Buy And Sell Stock Iv](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | [src](leetcode/p0188_best_time_to_buy_and_sell_stock_iv.py) | [tst](tests/test_p0188_best_time_to_buy_and_sell_stock_iv.py) |
| 191 | [Number Of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [src](leetcode/p0191_number_of_1_bits.py) | [tst](tests/test_p0191_number_of_1_bits.py) |
| 198 | [House Robber](https://leetcode.com/problems/house-robber/) | [src](leetcode/p0198_house_robber.py) | [tst](tests/test_p0198_house_robber.py) |
| 199 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | [src](leetcode/p0199_binary_tree_right_side_view.py) | [tst](tests/test_p0199_binary_tree_right_side_view.py) |
| 200 | [Number Of Islands](https://leetcode.com/problems/number-of-islands/) | [src](leetcode/p0200_number_of_islands.py) | [tst](tests/test_p0200_number_of_islands.py) |
| 204 | [Count Primes](https://leetcode.com/problems/count-primes/) | [src](leetcode/p0204_count_primes.py) | [tst](tests/test_p0204_count_primes.py) |
| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) | [src](leetcode/p0205_isomorphic_strings.py) | [tst](tests/test_p0205_isomorphic_strings.py) |
| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [src](leetcode/p0206_reverse_linked_list.py) | [tst](tests/test_p0206_reverse_linked_list.py) |
| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule/) | [src](leetcode/p0207_course_schedule.py) | [tst](tests/test_p0207_course_schedule.py) |
| 208 | [Implement Trie Prefix Tree](https://leetcode.com/problems/implement-trie-prefix-tree/) | [src](leetcode/p0208_implement_trie_prefix_tree.py) | [tst](tests/test_p0208_implement_trie_prefix_tree.py) |
| 210 | [Course Schedule Ii](https://leetcode.com/problems/course-schedule-ii/) | [src](leetcode/p0210_course_schedule_ii.py) | [tst](tests/test_p0210_course_schedule_ii.py) |
| 212 | [Word Search Ii](https://leetcode.com/problems/word-search-ii/) | [src](leetcode/p0212_word_search_ii.py) | [tst](tests/test_p0212_word_search_ii.py) |
| 213 | [House Robber Ii](https://leetcode.com/problems/house-robber-ii/) | [src](leetcode/p0213_house_robber_ii.py) | [tst](tests/test_p0213_house_robber_ii.py) |
| 215 | [Kth Largest Element In An Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [src](leetcode/p0215_kth_largest_element_in_an_array.py) | [tst](tests/test_p0215_kth_largest_element_in_an_array.py) |
| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square/) | [src](leetcode/p0221_maximal_square.py) | [tst](tests/test_p0221_maximal_square.py) |
| 224 | [Basic Calculator](https://leetcode.com/problems/basic-calculator/) | [src](leetcode/p0224_basic_calculator.py) | [tst](tests/test_p0224_basic_calculator.py) |
| 225 | [Implement Stack Using Queues](https://leetcode.com/problems/implement-stack-using-queues/) | [src](leetcode/p0225_implement_stack_using_queues.py) | [tst](tests/test_p0225_implement_stack_using_queues.py) |
| 227 | [Basic Calculator Ii](https://leetcode.com/problems/basic-calculator-ii/) | [src](leetcode/p0227_basic_calculator_ii.py) | [tst](tests/test_p0227_basic_calculator_ii.py) |
| 232 | [Implement Queue Using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | [src](leetcode/p0232_implement_queue_using_stacks.py) | [tst](tests/test_p0232_implement_queue_using_stacks.py) |
| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [src](leetcode/p0234_palindrome_linked_list.py) | [tst](tests/test_p0234_palindrome_linked_list.py) |
| 236 | [Lowest Common Ancestor Of A Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | [src](leetcode/p0236_lowest_common_ancestor_of_a_binary_tree.py) | [tst](tests/test_p0236_lowest_common_ancestor_of_a_binary_tree.py) |
| 238 | [Product Of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | [src](leetcode/p0238_product_of_array_except_self.py) | [tst](tests/test_p0238_product_of_array_except_self.py) |
| 239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | [src](leetcode/p0239_sliding_window_maximum.py) | [tst](tests/test_p0239_sliding_window_maximum.py) |
| 240 | [Search A 2D Matrix Ii](https://leetcode.com/problems/search-a-2d-matrix-ii/) | [src](leetcode/p0240_search_a_2d_matrix_ii.py) | [tst](tests/test_p0240_search_a_2d_matrix_ii.py) |
| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [src](leetcode/p0242_valid_anagram.py) | [tst](tests/test_p0242_valid_anagram.py) |
| 243 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/) | [src](leetcode/p0243_shortest_word_distance.py) | [tst](tests/test_p0243_shortest_word_distance.py) |
| 244 | [Shortest Word Distance Ii](https://leetcode.com/problems/shortest-word-distance-ii/) | [src](leetcode/p0244_shortest_word_distance_ii.py) | [tst](tests/test_p0244_shortest_word_distance_ii.py) |
| 246 | [Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/) | [src](leetcode/p0246_strobogrammatic_number.py) | [tst](tests/test_p0246_strobogrammatic_number.py) |
| 249 | [Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/) | [src](leetcode/p0249_group_shifted_strings.py) | [tst](tests/test_p0249_group_shifted_strings.py) |
| 252 | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms/) | [src](leetcode/p0252_meeting_rooms.py) | [tst](tests/test_p0252_meeting_rooms.py) |
| 253 | [Meeting Rooms Ii](https://leetcode.com/problems/meeting-rooms-ii/) | [src](leetcode/p0253_meeting_rooms_ii.py) | [tst](tests/test_p0253_meeting_rooms_ii.py) |
| 256 | [Paint House](https://leetcode.com/problems/paint-house/) | [src](leetcode/p0256_paint_house.py) | [tst](tests/test_p0256_paint_house.py) |
| 257 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/) | [src](leetcode/p0257_binary_tree_paths.py) | [tst](tests/test_p0257_binary_tree_paths.py) |
| 259 | [3Sum Smaller](https://leetcode.com/problems/3sum-smaller/) | [src](leetcode/p0259_3sum_smaller.py) | [tst](tests/test_p0259_3sum_smaller.py) |
| 261 | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/) | [src](leetcode/p0261_graph_valid_tree.py) | [tst](tests/test_p0261_graph_valid_tree.py) |
| 265 | [Paint House Ii](https://leetcode.com/problems/paint-house-ii/) | [src](leetcode/p0265_paint_house_ii.py) | [tst](tests/test_p0265_paint_house_ii.py) |
| 268 | [Missing Number](https://leetcode.com/problems/missing-number/) | [src](leetcode/p0268_missing_number.py) | [tst](tests/test_p0268_missing_number.py) |
| 269 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) | [src](leetcode/p0269_alien_dictionary.py) | [tst](tests/test_p0269_alien_dictionary.py) |
| 273 | [Integer To English Words](https://leetcode.com/problems/integer-to-english-words/) | [src](leetcode/p0273_integer_to_english_words.py) | [tst](tests/test_p0273_integer_to_english_words.py) |
| 277 | [Find The Celebrity](https://leetcode.com/problems/find-the-celebrity/) | [src](leetcode/p0277_find_the_celebrity.py) | [tst](tests/test_p0277_find_the_celebrity.py) |
| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | [src](leetcode/p0278_first_bad_version.py) | [tst](tests/test_p0278_first_bad_version.py) |
| 284 | [Peeking Iterator](https://leetcode.com/problems/peeking-iterator/) | [src](leetcode/p0284_peeking_iterator.py) | [tst](tests/test_p0284_peeking_iterator.py) |
| 285 | [Inorder Successor In Bst](https://leetcode.com/problems/inorder-successor-in-bst/) | [src](leetcode/p0285_inorder_successor_in_bst.py) | [tst](tests/test_p0285_inorder_successor_in_bst.py) |
| 286 | [Walls And Gates](https://leetcode.com/problems/walls-and-gates/) | [src](leetcode/p0286_walls_and_gates.py) | [tst](tests/test_p0286_walls_and_gates.py) |
| 295 | [Find Median From Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | [src](leetcode/p0295_find_median_from_data_stream.py) | [tst](tests/test_p0295_find_median_from_data_stream.py) |
| 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | [src](leetcode/p0300_longest_increasing_subsequence.py) | [tst](tests/test_p0300_longest_increasing_subsequence.py) |
| 303 | [Range Sum Query Immutable](https://leetcode.com/problems/range-sum-query-immutable/) | [src](leetcode/p0303_range_sum_query_immutable.py) | [tst](tests/test_p0303_range_sum_query_immutable.py) |
| 304 | [Range Sum Query 2D Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | [src](leetcode/p0304_range_sum_query_2d_immutable.py) | [tst](tests/test_p0304_range_sum_query_2d_immutable.py) |
| 309 | [Best Time To Buy And Sell Stock With Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [src](leetcode/p0309_best_time_to_buy_and_sell_stock_with_cooldown.py) | [tst](tests/test_p0309_best_time_to_buy_and_sell_stock_with_cooldown.py) |
| 310 | [Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/) | [src](leetcode/p0310_minimum_height_trees.py) | [tst](tests/test_p0310_minimum_height_trees.py) |
| 311 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/) | [src](leetcode/p0311_sparse_matrix_multiplication.py) | [tst](tests/test_p0311_sparse_matrix_multiplication.py) |
| 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons/) | [src](leetcode/p0312_burst_balloons.py) | [tst](tests/test_p0312_burst_balloons.py) |
| 314 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/) | [src](leetcode/p0314_binary_tree_vertical_order_traversal.py) | [tst](tests/test_p0314_binary_tree_vertical_order_traversal.py) |
| 317 | [Shortest Distance From All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/) | [src](leetcode/p0317_shortest_distance_from_all_buildings.py) | [tst](tests/test_p0317_shortest_distance_from_all_buildings.py) |
| 322 | [Coin Change](https://leetcode.com/problems/coin-change/) | [src](leetcode/p0322_coin_change.py) | [tst](tests/test_p0322_coin_change.py) |
| 323 | [Number Of Connected Components In An Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | [src](leetcode/p0323_number_of_connected_components_in_an_undirected_graph.py) | [tst](tests/test_p0323_number_of_connected_components_in_an_undirected_graph.py) |
| 325 | [Maximum Size Subarray Sum Equals K](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/) | [src](leetcode/p0325_maximum_size_subarray_sum_equals_k.py) | [tst](tests/test_p0325_maximum_size_subarray_sum_equals_k.py) |
| 326 | [Power Of Three](https://leetcode.com/problems/power-of-three/) | [src](leetcode/p0326_power_of_three.py) | [tst](tests/test_p0326_power_of_three.py) |
| 328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | [src](leetcode/p0328_odd_even_linked_list.py) | [tst](tests/test_p0328_odd_even_linked_list.py) |
| 334 | [Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/) | [src](leetcode/p0334_increasing_triplet_subsequence.py) | [tst](tests/test_p0334_increasing_triplet_subsequence.py) |
| 337 | [House Robber Iii](https://leetcode.com/problems/house-robber-iii/) | [src](leetcode/p0337_house_robber_iii.py) | [tst](tests/test_p0337_house_robber_iii.py) |
| 339 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/) | [src](leetcode/p0339_nested_list_weight_sum.py) | [tst](tests/test_p0339_nested_list_weight_sum.py) |
| 340 | [Longest Substring With At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/) | [src](leetcode/p0340_longest_substring_with_at_most_k_distinct_characters.py) | [tst](tests/test_p0340_longest_substring_with_at_most_k_distinct_characters.py) |
| 341 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) | [src](leetcode/p0341_flatten_nested_list_iterator.py) | [tst](tests/test_p0341_flatten_nested_list_iterator.py) |
| 343 | [Integer Break](https://leetcode.com/problems/integer-break/) | [src](leetcode/p0343_integer_break.py) | [tst](tests/test_p0343_integer_break.py) |
| 346 | [Moving Average From Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/) | [src](leetcode/p0346_moving_average_from_data_stream.py) | [tst](tests/test_p0346_moving_average_from_data_stream.py) |
| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | [src](leetcode/p0347_top_k_frequent_elements.py) | [tst](tests/test_p0347_top_k_frequent_elements.py) |
| 348 | [Design Tic Tac Toe](https://leetcode.com/problems/design-tic-tac-toe/) | [src](leetcode/p0348_design_tic_tac_toe.py) | [tst](tests/test_p0348_design_tic_tac_toe.py) |
| 353 | [Design Snake Game](https://leetcode.com/problems/design-snake-game/) | [src](leetcode/p0353_design_snake_game.py) | [tst](tests/test_p0353_design_snake_game.py) |
| 354 | [Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/) | [src](leetcode/p0354_russian_doll_envelopes.py) | [tst](tests/test_p0354_russian_doll_envelopes.py) |
| 355 | [Design Twitter](https://leetcode.com/problems/design-twitter/) | [src](leetcode/p0355_design_twitter.py) | [tst](tests/test_p0355_design_twitter.py) |
| 359 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/) | [src](leetcode/p0359_logger_rate_limiter.py) | [tst](tests/test_p0359_logger_rate_limiter.py) |
| 362 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter/) | [src](leetcode/p0362_design_hit_counter.py) | [tst](tests/test_p0362_design_hit_counter.py) |
| 364 | [Nested List Weight Sum Ii](https://leetcode.com/problems/nested-list-weight-sum-ii/) | [src](leetcode/p0364_nested_list_weight_sum_ii.py) | [tst](tests/test_p0364_nested_list_weight_sum_ii.py) |
| 376 | [Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/) | [src](leetcode/p0376_wiggle_subsequence.py) | [tst](tests/test_p0376_wiggle_subsequence.py) |
| 377 | [Combination Sum Iv](https://leetcode.com/problems/combination-sum-iv/) | [src](leetcode/p0377_combination_sum_iv.py) | [tst](tests/test_p0377_combination_sum_iv.py) |
| 380 | [Insert Delete Getrandom O1](https://leetcode.com/problems/insert-delete-getrandom-o1/) | [src](leetcode/p0380_insert_delete_getrandom_o1.py) | [tst](tests/test_p0380_insert_delete_getrandom_o1.py) |
| 382 | [Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/) | [src](leetcode/p0382_linked_list_random_node.py) | [tst](tests/test_p0382_linked_list_random_node.py) |
| 384 | [Shuffle An Array](https://leetcode.com/problems/shuffle-an-array/) | [src](leetcode/p0384_shuffle_an_array.py) | [tst](tests/test_p0384_shuffle_an_array.py) |
| 387 | [First Unique Character In A String](https://leetcode.com/problems/first-unique-character-in-a-string/) | [src](leetcode/p0387_first_unique_character_in_a_string.py) | [tst](tests/test_p0387_first_unique_character_in_a_string.py) |
| 398 | [Random Pick Index](https://leetcode.com/problems/random-pick-index/) | [src](leetcode/p0398_random_pick_index.py) | [tst](tests/test_p0398_random_pick_index.py) |
| 413 | [Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/) | [src](leetcode/p0413_arithmetic_slices.py) | [tst](tests/test_p0413_arithmetic_slices.py) |
| 415 | [Add Strings](https://leetcode.com/problems/add-strings/) | [src](leetcode/p0415_add_strings.py) | [tst](tests/test_p0415_add_strings.py) |
| 417 | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) | [src](leetcode/p0417_pacific_atlantic_water_flow.py) | [tst](tests/test_p0417_pacific_atlantic_water_flow.py) |
| 423 | [Reconstruct Original Digits From English](https://leetcode.com/problems/reconstruct-original-digits-from-english/) | [src](leetcode/p0423_reconstruct_original_digits_from_english.py) | [tst](tests/test_p0423_reconstruct_original_digits_from_english.py) |
| 426 | [Convert Binary Search Tree To Sorted Doubly Linked List](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/) | [src](leetcode/p0426_convert_binary_search_tree_to_sorted_doubly_linked_list.py) | [tst](tests/test_p0426_convert_binary_search_tree_to_sorted_doubly_linked_list.py) |
| 428 | [Serialize And Deserialize N Ary Tree](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree/) | [src](leetcode/p0428_serialize_and_deserialize_n_ary_tree.py) | [tst](tests/test_p0428_serialize_and_deserialize_n_ary_tree.py) |
| 435 | [Non Overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) | [src](leetcode/p0435_non_overlapping_intervals.py) | [tst](tests/test_p0435_non_overlapping_intervals.py) |
| 437 | [Path Sum Iii](https://leetcode.com/problems/path-sum-iii/) | [src](leetcode/p0437_path_sum_iii.py) | [tst](tests/test_p0437_path_sum_iii.py) |
| 438 | [Find All Anagrams In A String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | [src](leetcode/p0438_find_all_anagrams_in_a_string.py) | [tst](tests/test_p0438_find_all_anagrams_in_a_string.py) |
| 446 | [Arithmetic Slices Ii Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/) | [src](leetcode/p0446_arithmetic_slices_ii_subsequence.py) | [tst](tests/test_p0446_arithmetic_slices_ii_subsequence.py) |
| 450 | [Delete Node In A Bst](https://leetcode.com/problems/delete-node-in-a-bst/) | [src](leetcode/p0450_delete_node_in_a_bst.py) | [tst](tests/test_p0450_delete_node_in_a_bst.py) |
| 451 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/) | [src](leetcode/p0451_sort_characters_by_frequency.py) | [tst](tests/test_p0451_sort_characters_by_frequency.py) |
| 452 | [Minimum Number Of Arrows To Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/) | [src](leetcode/p0452_minimum_number_of_arrows_to_burst_balloons.py) | [tst](tests/test_p0452_minimum_number_of_arrows_to_burst_balloons.py) |
| 459 | [Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/) | [src](leetcode/p0459_repeated_substring_pattern.py) | [tst](tests/test_p0459_repeated_substring_pattern.py) |
| 460 | [Lfu Cache](https://leetcode.com/problems/lfu-cache/) | [src](leetcode/p0460_lfu_cache.py) | [tst](tests/test_p0460_lfu_cache.py) |
| 463 | [Island Perimeter](https://leetcode.com/problems/island-perimeter/) | [src](leetcode/p0463_island_perimeter.py) | [tst](tests/test_p0463_island_perimeter.py) |
| 465 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing/) | [src](leetcode/p0465_optimal_account_balancing.py) | [tst](tests/test_p0465_optimal_account_balancing.py) |
| 471 | [Encode String With Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length/) | [src](leetcode/p0471_encode_string_with_shortest_length.py) | [tst](tests/test_p0471_encode_string_with_shortest_length.py) |
| 474 | [Ones And Zeroes](https://leetcode.com/problems/ones-and-zeroes/) | [src](leetcode/p0474_ones_and_zeroes.py) | [tst](tests/test_p0474_ones_and_zeroes.py) |
| 478 | [Generate Random Point In A Circle](https://leetcode.com/problems/generate-random-point-in-a-circle/) | [src](leetcode/p0478_generate_random_point_in_a_circle.py) | [tst](tests/test_p0478_generate_random_point_in_a_circle.py) |
| 489 | [Robot Room Cleaner](https://leetcode.com/problems/robot-room-cleaner/) | [src](leetcode/p0489_robot_room_cleaner.py) | [tst](tests/test_p0489_robot_room_cleaner.py) |
| 496 | [Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/) | [src](leetcode/p0496_next_greater_element_i.py) | [tst](tests/test_p0496_next_greater_element_i.py) |
| 503 | [Next Greater Element Ii](https://leetcode.com/problems/next-greater-element-ii/) | [src](leetcode/p0503_next_greater_element_ii.py) | [tst](tests/test_p0503_next_greater_element_ii.py) |
| 509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | [src](leetcode/p0509_fibonacci_number.py) | [tst](tests/test_p0509_fibonacci_number.py) |
| 516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/) | [src](leetcode/p0516_longest_palindromic_subsequence.py) | [tst](tests/test_p0516_longest_palindromic_subsequence.py) |
| 518 | [Coin Change 2](https://leetcode.com/problems/coin-change-2/) | [src](leetcode/p0518_coin_change_2.py) | [tst](tests/test_p0518_coin_change_2.py) |
| 524 | [Longest Word In Dictionary Through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/) | [src](leetcode/p0524_longest_word_in_dictionary_through_deleting.py) | [tst](tests/test_p0524_longest_word_in_dictionary_through_deleting.py) |
| 535 | [Encode And Decode Tinyurl](https://leetcode.com/problems/encode-and-decode-tinyurl/) | [src](leetcode/p0535_encode_and_decode_tinyurl.py) | [tst](tests/test_p0535_encode_and_decode_tinyurl.py) |
| 536 | [Construct Binary Tree From String](https://leetcode.com/problems/construct-binary-tree-from-string/) | [src](leetcode/p0536_construct_binary_tree_from_string.py) | [tst](tests/test_p0536_construct_binary_tree_from_string.py) |
| 538 | [Convert Bst To Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/) | [src](leetcode/p0538_convert_bst_to_greater_tree.py) | [tst](tests/test_p0538_convert_bst_to_greater_tree.py) |
| 542 | [01 Matrix](https://leetcode.com/problems/01-matrix/) | [src](leetcode/p0542_01_matrix.py) | [tst](tests/test_p0542_01_matrix.py) |
| 543 | [Diameter Of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | [src](leetcode/p0543_diameter_of_binary_tree.py) | [tst](tests/test_p0543_diameter_of_binary_tree.py) |
| 545 | [Boundary Of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree/) | [src](leetcode/p0545_boundary_of_binary_tree.py) | [tst](tests/test_p0545_boundary_of_binary_tree.py) |
| 547 | [Number Of Provinces](https://leetcode.com/problems/number-of-provinces/) | [src](leetcode/p0547_number_of_provinces.py) | [tst](tests/test_p0547_number_of_provinces.py) |
| 554 | [Brick Wall](https://leetcode.com/problems/brick-wall/) | [src](leetcode/p0554_brick_wall.py) | [tst](tests/test_p0554_brick_wall.py) |
| 556 | [Next Greater Element Iii](https://leetcode.com/problems/next-greater-element-iii/) | [src](leetcode/p0556_next_greater_element_iii.py) | [tst](tests/test_p0556_next_greater_element_iii.py) |
| 560 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | [src](leetcode/p0560_subarray_sum_equals_k.py) | [tst](tests/test_p0560_subarray_sum_equals_k.py) |
| 573 | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation/) | [src](leetcode/p0573_squirrel_simulation.py) | [tst](tests/test_p0573_squirrel_simulation.py) |
| 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies/) | [src](leetcode/p0575_distribute_candies.py) | [tst](tests/test_p0575_distribute_candies.py) |
| 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/) | [src](leetcode/p0581_shortest_unsorted_continuous_subarray.py) | [tst](tests/test_p0581_shortest_unsorted_continuous_subarray.py) |
| 582 | [Kill Process](https://leetcode.com/problems/kill-process/) | [src](leetcode/p0582_kill_process.py) | [tst](tests/test_p0582_kill_process.py) |
| 583 | [Delete Operation For Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/) | [src](leetcode/p0583_delete_operation_for_two_strings.py) | [tst](tests/test_p0583_delete_operation_for_two_strings.py) |
| 588 | [Design In Memory File System](https://leetcode.com/problems/design-in-memory-file-system/) | [src](leetcode/p0588_design_in_memory_file_system.py) | [tst](tests/test_p0588_design_in_memory_file_system.py) |
| 589 | [N Ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/) | [src](leetcode/p0589_n_ary_tree_preorder_traversal.py) | [tst](tests/test_p0589_n_ary_tree_preorder_traversal.py) |
| 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/) | [src](leetcode/p0594_longest_harmonious_subsequence.py) | [tst](tests/test_p0594_longest_harmonious_subsequence.py) |
| 609 | [Find Duplicate File In System](https://leetcode.com/problems/find-duplicate-file-in-system/) | [src](leetcode/p0609_find_duplicate_file_in_system.py) | [tst](tests/test_p0609_find_duplicate_file_in_system.py) |
| 616 | [Add Bold Tag In String](https://leetcode.com/problems/add-bold-tag-in-string/) | [src](leetcode/p0616_add_bold_tag_in_string.py) | [tst](tests/test_p0616_add_bold_tag_in_string.py) |
| 622 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue/) | [src](leetcode/p0622_design_circular_queue.py) | [tst](tests/test_p0622_design_circular_queue.py) |
| 623 | [Add One Row To Tree](https://leetcode.com/problems/add-one-row-to-tree/) | [src](leetcode/p0623_add_one_row_to_tree.py) | [tst](tests/test_p0623_add_one_row_to_tree.py) |
| 630 | [Course Schedule Iii](https://leetcode.com/problems/course-schedule-iii/) | [src](leetcode/p0630_course_schedule_iii.py) | [tst](tests/test_p0630_course_schedule_iii.py) |
| 632 | [Smallest Range Covering Elements From K Lists](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/) | [src](leetcode/p0632_smallest_range_covering_elements_from_k_lists.py) | [tst](tests/test_p0632_smallest_range_covering_elements_from_k_lists.py) |
| 637 | [Average Of Levels In Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/) | [src](leetcode/p0637_average_of_levels_in_binary_tree.py) | [tst](tests/test_p0637_average_of_levels_in_binary_tree.py) |
| 642 | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system/) | [src](leetcode/p0642_design_search_autocomplete_system.py) | [tst](tests/test_p0642_design_search_autocomplete_system.py) |
| 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch/) | [src](leetcode/p0645_set_mismatch.py) | [tst](tests/test_p0645_set_mismatch.py) |
| 647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | [src](leetcode/p0647_palindromic_substrings.py) | [tst](tests/test_p0647_palindromic_substrings.py) |
| 650 | [2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/) | [src](leetcode/p0650_2_keys_keyboard.py) | [tst](tests/test_p0650_2_keys_keyboard.py) |
| 651 | [4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard/) | [src](leetcode/p0651_4_keys_keyboard.py) | [tst](tests/test_p0651_4_keys_keyboard.py) |
| 653 | [Two Sum Iv Input Is A Bst](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/) | [src](leetcode/p0653_two_sum_iv_input_is_a_bst.py) | [tst](tests/test_p0653_two_sum_iv_input_is_a_bst.py) |
| 662 | [Maximum Width Of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/) | [src](leetcode/p0662_maximum_width_of_binary_tree.py) | [tst](tests/test_p0662_maximum_width_of_binary_tree.py) |
| 666 | [Path Sum Iv](https://leetcode.com/problems/path-sum-iv/) | [src](leetcode/p0666_path_sum_iv.py) | [tst](tests/test_p0666_path_sum_iv.py) |
| 667 | [Beautiful Arrangement Ii](https://leetcode.com/problems/beautiful-arrangement-ii/) | [src](leetcode/p0667_beautiful_arrangement_ii.py) | [tst](tests/test_p0667_beautiful_arrangement_ii.py) |
| 668 | [Kth Smallest Number In Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/) | [src](leetcode/p0668_kth_smallest_number_in_multiplication_table.py) | [tst](tests/test_p0668_kth_smallest_number_in_multiplication_table.py) |
| 669 | [Trim A Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/) | [src](leetcode/p0669_trim_a_binary_search_tree.py) | [tst](tests/test_p0669_trim_a_binary_search_tree.py) |
| 692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | [src](leetcode/p0692_top_k_frequent_words.py) | [tst](tests/test_p0692_top_k_frequent_words.py) |
| 694 | [Number Of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands/) | [src](leetcode/p0694_number_of_distinct_islands.py) | [tst](tests/test_p0694_number_of_distinct_islands.py) |
| 695 | [Max Area Of Island](https://leetcode.com/problems/max-area-of-island/) | [src](leetcode/p0695_max_area_of_island.py) | [tst](tests/test_p0695_max_area_of_island.py) |
| 696 | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings/) | [src](leetcode/p0696_count_binary_substrings.py) | [tst](tests/test_p0696_count_binary_substrings.py) |
| 698 | [Partition To K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/) | [src](leetcode/p0698_partition_to_k_equal_sum_subsets.py) | [tst](tests/test_p0698_partition_to_k_equal_sum_subsets.py) |
| 706 | [Design Hashmap](https://leetcode.com/problems/design-hashmap/) | [src](leetcode/p0706_design_hashmap.py) | [tst](tests/test_p0706_design_hashmap.py) |
| 708 | [Insert Into A Sorted Circular Linked List](https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list/) | [src](leetcode/p0708_insert_into_a_sorted_circular_linked_list.py) | [tst](tests/test_p0708_insert_into_a_sorted_circular_linked_list.py) |
| 714 | [Best Time To Buy And Sell Stock With Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/) | [src](leetcode/p0714_best_time_to_buy_and_sell_stock_with_transaction_fee.py) | [tst](tests/test_p0714_best_time_to_buy_and_sell_stock_with_transaction_fee.py) |
| 721 | [Accounts Merge](https://leetcode.com/problems/accounts-merge/) | [src](leetcode/p0721_accounts_merge.py) | [tst](tests/test_p0721_accounts_merge.py) |
| 723 | [Candy Crush](https://leetcode.com/problems/candy-crush/) | [src](leetcode/p0723_candy_crush.py) | [tst](tests/test_p0723_candy_crush.py) |
| 727 | [Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence/) | [src](leetcode/p0727_minimum_window_subsequence.py) | [tst](tests/test_p0727_minimum_window_subsequence.py) |
| 729 | [My Calendar I](https://leetcode.com/problems/my-calendar-i/) | [src](leetcode/p0729_my_calendar_i.py) | [tst](tests/test_p0729_my_calendar_i.py) |
| 733 | [Flood Fill](https://leetcode.com/problems/flood-fill/) | [src](leetcode/p0733_flood_fill.py) | [tst](tests/test_p0733_flood_fill.py) |
| 739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | [src](leetcode/p0739_daily_temperatures.py) | [tst](tests/test_p0739_daily_temperatures.py) |
| 745 | [Prefix And Suffix Search](https://leetcode.com/problems/prefix-and-suffix-search/) | [src](leetcode/p0745_prefix_and_suffix_search.py) | [tst](tests/test_p0745_prefix_and_suffix_search.py) |
| 750 | [Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles/) | [src](leetcode/p0750_number_of_corner_rectangles.py) | [tst](tests/test_p0750_number_of_corner_rectangles.py) |
| 759 | [Employee Free Time](https://leetcode.com/problems/employee-free-time/) | [src](leetcode/p0759_employee_free_time.py) | [tst](tests/test_p0759_employee_free_time.py) |
| 764 | [Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign/) | [src](leetcode/p0764_largest_plus_sign.py) | [tst](tests/test_p0764_largest_plus_sign.py) |
| 772 | [Basic Calculator Iii](https://leetcode.com/problems/basic-calculator-iii/) | [src](leetcode/p0772_basic_calculator_iii.py) | [tst](tests/test_p0772_basic_calculator_iii.py) |
| 774 | [Minimize Max Distance To Gas Station](https://leetcode.com/problems/minimize-max-distance-to-gas-station/) | [src](leetcode/p0774_minimize_max_distance_to_gas_station.py) | [tst](tests/test_p0774_minimize_max_distance_to_gas_station.py) |
| 775 | [Global And Local Inversions](https://leetcode.com/problems/global-and-local-inversions/) | [src](leetcode/p0775_global_and_local_inversions.py) | [tst](tests/test_p0775_global_and_local_inversions.py) |
| 778 | [Swim In Rising Water](https://leetcode.com/problems/swim-in-rising-water/) | [src](leetcode/p0778_swim_in_rising_water.py) | [tst](tests/test_p0778_swim_in_rising_water.py) |
| 784 | [Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/) | [src](leetcode/p0784_letter_case_permutation.py) | [tst](tests/test_p0784_letter_case_permutation.py) |
| 785 | [Is Graph Bipartite](https://leetcode.com/problems/is-graph-bipartite/) | [src](leetcode/p0785_is_graph_bipartite.py) | [tst](tests/test_p0785_is_graph_bipartite.py) |
| 787 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/) | [src](leetcode/p0787_cheapest_flights_within_k_stops.py) | [tst](tests/test_p0787_cheapest_flights_within_k_stops.py) |
| 792 | [Number Of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/) | [src](leetcode/p0792_number_of_matching_subsequences.py) | [tst](tests/test_p0792_number_of_matching_subsequences.py) |
| 795 | [Number Of Subarrays With Bounded Maximum](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/) | [src](leetcode/p0795_number_of_subarrays_with_bounded_maximum.py) | [tst](tests/test_p0795_number_of_subarrays_with_bounded_maximum.py) |
| 797 | [All Paths From Source To Target](https://leetcode.com/problems/all-paths-from-source-to-target/) | [src](leetcode/p0797_all_paths_from_source_to_target.py) | [tst](tests/test_p0797_all_paths_from_source_to_target.py) |
| 815 | [Bus Routes](https://leetcode.com/problems/bus-routes/) | [src](leetcode/p0815_bus_routes.py) | [tst](tests/test_p0815_bus_routes.py) |
| 820 | [Short Encoding Of Words](https://leetcode.com/problems/short-encoding-of-words/) | [src](leetcode/p0820_short_encoding_of_words.py) | [tst](tests/test_p0820_short_encoding_of_words.py) |
| 821 | [Shortest Distance To A Character](https://leetcode.com/problems/shortest-distance-to-a-character/) | [src](leetcode/p0821_shortest_distance_to_a_character.py) | [tst](tests/test_p0821_shortest_distance_to_a_character.py) |
| 823 | [Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/) | [src](leetcode/p0823_binary_trees_with_factors.py) | [tst](tests/test_p0823_binary_trees_with_factors.py) |
| 827 | [Making A Large Island](https://leetcode.com/problems/making-a-large-island/) | [src](leetcode/p0827_making_a_large_island.py) | [tst](tests/test_p0827_making_a_large_island.py) |
| 829 | [Consecutive Numbers Sum](https://leetcode.com/problems/consecutive-numbers-sum/) | [src](leetcode/p0829_consecutive_numbers_sum.py) | [tst](tests/test_p0829_consecutive_numbers_sum.py) |
| 841 | [Keys And Rooms](https://leetcode.com/problems/keys-and-rooms/) | [src](leetcode/p0841_keys_and_rooms.py) | [tst](tests/test_p0841_keys_and_rooms.py) |
| 848 | [Shifting Letters](https://leetcode.com/problems/shifting-letters/) | [src](leetcode/p0848_shifting_letters.py) | [tst](tests/test_p0848_shifting_letters.py) |
| 855 | [Exam Room](https://leetcode.com/problems/exam-room/) | [src](leetcode/p0855_exam_room.py) | [tst](tests/test_p0855_exam_room.py) |
| 856 | [Score Of Parentheses](https://leetcode.com/problems/score-of-parentheses/) | [src](leetcode/p0856_score_of_parentheses.py) | [tst](tests/test_p0856_score_of_parentheses.py) |
| 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change/) | [src](leetcode/p0860_lemonade_change.py) | [tst](tests/test_p0860_lemonade_change.py) |
| 863 | [All Nodes Distance K In Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/) | [src](leetcode/p0863_all_nodes_distance_k_in_binary_tree.py) | [tst](tests/test_p0863_all_nodes_distance_k_in_binary_tree.py) |
| 869 | [Reordered Power Of 2](https://leetcode.com/problems/reordered-power-of-2/) | [src](leetcode/p0869_reordered_power_of_2.py) | [tst](tests/test_p0869_reordered_power_of_2.py) |
| 870 | [Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle/) | [src](leetcode/p0870_advantage_shuffle.py) | [tst](tests/test_p0870_advantage_shuffle.py) |
| 871 | [Minimum Number Of Refueling Stops](https://leetcode.com/problems/minimum-number-of-refueling-stops/) | [src](leetcode/p0871_minimum_number_of_refueling_stops.py) | [tst](tests/test_p0871_minimum_number_of_refueling_stops.py) |
| 875 | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/) | [src](leetcode/p0875_koko_eating_bananas.py) | [tst](tests/test_p0875_koko_eating_bananas.py) |
| 876 | [Middle Of The Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | [src](leetcode/p0876_middle_of_the_linked_list.py) | [tst](tests/test_p0876_middle_of_the_linked_list.py) |
| 877 | [Stone Game](https://leetcode.com/problems/stone-game/) | [src](leetcode/p0877_stone_game.py) | [tst](tests/test_p0877_stone_game.py) |
| 882 | [Reachable Nodes In Subdivided Graph](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph/) | [src](leetcode/p0882_reachable_nodes_in_subdivided_graph.py) | [tst](tests/test_p0882_reachable_nodes_in_subdivided_graph.py) |
| 887 | [Super Egg Drop](https://leetcode.com/problems/super-egg-drop/) | [src](leetcode/p0887_super_egg_drop.py) | [tst](tests/test_p0887_super_egg_drop.py) |
| 895 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/) | [src](leetcode/p0895_maximum_frequency_stack.py) | [tst](tests/test_p0895_maximum_frequency_stack.py) |
| 899 | [Orderly Queue](https://leetcode.com/problems/orderly-queue/) | [src](leetcode/p0899_orderly_queue.py) | [tst](tests/test_p0899_orderly_queue.py) |
| 906 | [Super Palindromes](https://leetcode.com/problems/super-palindromes/) | [src](leetcode/p0906_super_palindromes.py) | [tst](tests/test_p0906_super_palindromes.py) |
| 907 | [Sum Of Subarray Minimums](https://leetcode.com/problems/sum-of-subarray-minimums/) | [src](leetcode/p0907_sum_of_subarray_minimums.py) | [tst](tests/test_p0907_sum_of_subarray_minimums.py) |
| 916 | [Word Subsets](https://leetcode.com/problems/word-subsets/) | [src](leetcode/p0916_word_subsets.py) | [tst](tests/test_p0916_word_subsets.py) |
| 922 | [Sort Array By Parity Ii](https://leetcode.com/problems/sort-array-by-parity-ii/) | [src](leetcode/p0922_sort_array_by_parity_ii.py) | [tst](tests/test_p0922_sort_array_by_parity_ii.py) |
| 923 | [3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/) | [src](leetcode/p0923_3sum_with_multiplicity.py) | [tst](tests/test_p0923_3sum_with_multiplicity.py) |
| 936 | [Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence/) | [src](leetcode/p0936_stamping_the_sequence.py) | [tst](tests/test_p0936_stamping_the_sequence.py) |
| 946 | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences/) | [src](leetcode/p0946_validate_stack_sequences.py) | [tst](tests/test_p0946_validate_stack_sequences.py) |
| 947 | [Most Stones Removed With Same Row Or Column](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/) | [src](leetcode/p0947_most_stones_removed_with_same_row_or_column.py) | [tst](tests/test_p0947_most_stones_removed_with_same_row_or_column.py) |
| 953 | [Verifying An Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/) | [src](leetcode/p0953_verifying_an_alien_dictionary.py) | [tst](tests/test_p0953_verifying_an_alien_dictionary.py) |
| 966 | [Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/) | [src](leetcode/p0966_vowel_spellchecker.py) | [tst](tests/test_p0966_vowel_spellchecker.py) |
| 969 | [Pancake Sorting](https://leetcode.com/problems/pancake-sorting/) | [src](leetcode/p0969_pancake_sorting.py) | [tst](tests/test_p0969_pancake_sorting.py) |
| 970 | [Powerful Integers](https://leetcode.com/problems/powerful-integers/) | [src](leetcode/p0970_powerful_integers.py) | [tst](tests/test_p0970_powerful_integers.py) |
| 971 | [Flip Binary Tree To Match Preorder Traversal](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal/) | [src](leetcode/p0971_flip_binary_tree_to_match_preorder_traversal.py) | [tst](tests/test_p0971_flip_binary_tree_to_match_preorder_traversal.py) |
| 973 | [K Closest Points To Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | [src](leetcode/p0973_k_closest_points_to_origin.py) | [tst](tests/test_p0973_k_closest_points_to_origin.py) |
| 978 | [Longest Turbulent Subarray](https://leetcode.com/problems/longest-turbulent-subarray/) | [src](leetcode/p0978_longest_turbulent_subarray.py) | [tst](tests/test_p0978_longest_turbulent_subarray.py) |
| 981 | [Time Based Key Value Store](https://leetcode.com/problems/time-based-key-value-store/) | [src](leetcode/p0981_time_based_key_value_store.py) | [tst](tests/test_p0981_time_based_key_value_store.py) |
| 986 | [Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/) | [src](leetcode/p0986_interval_list_intersections.py) | [tst](tests/test_p0986_interval_list_intersections.py) |
| 987 | [Vertical Order Traversal Of A Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/) | [src](leetcode/p0987_vertical_order_traversal_of_a_binary_tree.py) | [tst](tests/test_p0987_vertical_order_traversal_of_a_binary_tree.py) |
| 990 | [Satisfiability Of Equality Equations](https://leetcode.com/problems/satisfiability-of-equality-equations/) | [src](leetcode/p0990_satisfiability_of_equality_equations.py) | [tst](tests/test_p0990_satisfiability_of_equality_equations.py) |
| 991 | [Broken Calculator](https://leetcode.com/problems/broken-calculator/) | [src](leetcode/p0991_broken_calculator.py) | [tst](tests/test_p0991_broken_calculator.py) |
| 1000 | [Minimum Cost To Merge Stones](https://leetcode.com/problems/minimum-cost-to-merge-stones/) | [src](leetcode/p1000_minimum_cost_to_merge_stones.py) | [tst](tests/test_p1000_minimum_cost_to_merge_stones.py) |
| 1004 | [Max Consecutive Ones Iii](https://leetcode.com/problems/max-consecutive-ones-iii/) | [src](leetcode/p1004_max_consecutive_ones_iii.py) | [tst](tests/test_p1004_max_consecutive_ones_iii.py) |
| 1005 | [Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/) | [src](leetcode/p1005_maximize_sum_of_array_after_k_negations.py) | [tst](tests/test_p1005_maximize_sum_of_array_after_k_negations.py) |
| 1006 | [Clumsy Factorial](https://leetcode.com/problems/clumsy-factorial/) | [src](leetcode/p1006_clumsy_factorial.py) | [tst](tests/test_p1006_clumsy_factorial.py) |
| 1007 | [Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row/) | [src](leetcode/p1007_minimum_domino_rotations_for_equal_row.py) | [tst](tests/test_p1007_minimum_domino_rotations_for_equal_row.py) |
| 1008 | [Construct Binary Search Tree From Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/) | [src](leetcode/p1008_construct_binary_search_tree_from_preorder_traversal.py) | [tst](tests/test_p1008_construct_binary_search_tree_from_preorder_traversal.py) |
| 1009 | [Complement Of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/) | [src](leetcode/p1009_complement_of_base_10_integer.py) | [tst](tests/test_p1009_complement_of_base_10_integer.py) |
| 1010 | [Pairs Of Songs With Total Durations Divisible By 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) | [src](leetcode/p1010_pairs_of_songs_with_total_durations_divisible_by_60.py) | [tst](tests/test_p1010_pairs_of_songs_with_total_durations_divisible_by_60.py) |
| 1011 | [Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/) | [src](leetcode/p1011_capacity_to_ship_packages_within_d_days.py) | [tst](tests/test_p1011_capacity_to_ship_packages_within_d_days.py) |
| 1013 | [Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/) | [src](leetcode/p1013_partition_array_into_three_parts_with_equal_sum.py) | [tst](tests/test_p1013_partition_array_into_three_parts_with_equal_sum.py) |
| 1038 | [Binary Search Tree To Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/) | [src](leetcode/p1038_binary_search_tree_to_greater_sum_tree.py) | [tst](tests/test_p1038_binary_search_tree_to_greater_sum_tree.py) |
| 1041 | [Robot Bounded In Circle](https://leetcode.com/problems/robot-bounded-in-circle/) | [src](leetcode/p1041_robot_bounded_in_circle.py) | [tst](tests/test_p1041_robot_bounded_in_circle.py) |
| 1047 | [Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | [src](leetcode/p1047_remove_all_adjacent_duplicates_in_string.py) | [tst](tests/test_p1047_remove_all_adjacent_duplicates_in_string.py) |
| 1048 | [Longest String Chain](https://leetcode.com/problems/longest-string-chain/) | [src](leetcode/p1048_longest_string_chain.py) | [tst](tests/test_p1048_longest_string_chain.py) |
| 1057 | [Campus Bikes](https://leetcode.com/problems/campus-bikes/) | [src](leetcode/p1057_campus_bikes.py) | [tst](tests/test_p1057_campus_bikes.py) |
| 1059 | [All Paths From Source Lead To Destination](https://leetcode.com/problems/all-paths-from-source-lead-to-destination/) | [src](leetcode/p1059_all_paths_from_source_lead_to_destination.py) | [tst](tests/test_p1059_all_paths_from_source_lead_to_destination.py) |
| 1086 | [High Five](https://leetcode.com/problems/high-five/) | [src](leetcode/p1086_high_five.py) | [tst](tests/test_p1086_high_five.py) |
| 1091 | [Shortest Path In Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/) | [src](leetcode/p1091_shortest_path_in_binary_matrix.py) | [tst](tests/test_p1091_shortest_path_in_binary_matrix.py) |
| 1105 | [Filling Bookcase Shelves](https://leetcode.com/problems/filling-bookcase-shelves/) | [src](leetcode/p1105_filling_bookcase_shelves.py) | [tst](tests/test_p1105_filling_bookcase_shelves.py) |
| 1120 | [Maximum Average Subtree](https://leetcode.com/problems/maximum-average-subtree/) | [src](leetcode/p1120_maximum_average_subtree.py) | [tst](tests/test_p1120_maximum_average_subtree.py) |
| 1133 | [Largest Unique Number](https://leetcode.com/problems/largest-unique-number/) | [src](leetcode/p1133_largest_unique_number.py) | [tst](tests/test_p1133_largest_unique_number.py) |
| 1136 | [Parallel Courses](https://leetcode.com/problems/parallel-courses/) | [src](leetcode/p1136_parallel_courses.py) | [tst](tests/test_p1136_parallel_courses.py) |
| 1140 | [Stone Game Ii](https://leetcode.com/problems/stone-game-ii/) | [src](leetcode/p1140_stone_game_ii.py) | [tst](tests/test_p1140_stone_game_ii.py) |
| 1143 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | [src](leetcode/p1143_longest_common_subsequence.py) | [tst](tests/test_p1143_longest_common_subsequence.py) |
| 1151 | [Minimum Swaps To Group All 1S Together](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/) | [src](leetcode/p1151_minimum_swaps_to_group_all_1s_together.py) | [tst](tests/test_p1151_minimum_swaps_to_group_all_1s_together.py) |
| 1153 | [String Transforms Into Another String](https://leetcode.com/problems/string-transforms-into-another-string/) | [src](leetcode/p1153_string_transforms_into_another_string.py) | [tst](tests/test_p1153_string_transforms_into_another_string.py) |
| 1165 | [Single Row Keyboard](https://leetcode.com/problems/single-row-keyboard/) | [src](leetcode/p1165_single_row_keyboard.py) | [tst](tests/test_p1165_single_row_keyboard.py) |
| 1166 | [Design File System](https://leetcode.com/problems/design-file-system/) | [src](leetcode/p1166_design_file_system.py) | [tst](tests/test_p1166_design_file_system.py) |
| 1167 | [Minimum Cost To Connect Sticks](https://leetcode.com/problems/minimum-cost-to-connect-sticks/) | [src](leetcode/p1167_minimum_cost_to_connect_sticks.py) | [tst](tests/test_p1167_minimum_cost_to_connect_sticks.py) |
| 1182 | [Shortest Distance To Target Color](https://leetcode.com/problems/shortest-distance-to-target-color/) | [src](leetcode/p1182_shortest_distance_to_target_color.py) | [tst](tests/test_p1182_shortest_distance_to_target_color.py) |
| 1186 | [Maximum Subarray Sum With One Deletion](https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion/) | [src](leetcode/p1186_maximum_subarray_sum_with_one_deletion.py) | [tst](tests/test_p1186_maximum_subarray_sum_with_one_deletion.py) |
| 1191 | [K Concatenation Maximum Sum](https://leetcode.com/problems/k-concatenation-maximum-sum/) | [src](leetcode/p1191_k_concatenation_maximum_sum.py) | [tst](tests/test_p1191_k_concatenation_maximum_sum.py) |
| 1197 | [Minimum Knight Moves](https://leetcode.com/problems/minimum-knight-moves/) | [src](leetcode/p1197_minimum_knight_moves.py) | [tst](tests/test_p1197_minimum_knight_moves.py) |
| 1198 | [Find Smallest Common Element In All Rows](https://leetcode.com/problems/find-smallest-common-element-in-all-rows/) | [src](leetcode/p1198_find_smallest_common_element_in_all_rows.py) | [tst](tests/test_p1198_find_smallest_common_element_in_all_rows.py) |
| 1209 | [Remove All Adjacent Duplicates In String Ii](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | [src](leetcode/p1209_remove_all_adjacent_duplicates_in_string_ii.py) | [tst](tests/test_p1209_remove_all_adjacent_duplicates_in_string_ii.py) |
| 1217 | [Minimum Cost To Move Chips To The Same Position](https://leetcode.com/problems/minimum-cost-to-move-chips-to-the-same-position/) | [src](leetcode/p1217_minimum_cost_to_move_chips_to_the_same_position.py) | [tst](tests/test_p1217_minimum_cost_to_move_chips_to_the_same_position.py) |
| 1228 | [Missing Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression/) | [src](leetcode/p1228_missing_number_in_arithmetic_progression.py) | [tst](tests/test_p1228_missing_number_in_arithmetic_progression.py) |
| 1229 | [Meeting Scheduler](https://leetcode.com/problems/meeting-scheduler/) | [src](leetcode/p1229_meeting_scheduler.py) | [tst](tests/test_p1229_meeting_scheduler.py) |
| 1236 | [Web Crawler](https://leetcode.com/problems/web-crawler/) | [src](leetcode/p1236_web_crawler.py) | [tst](tests/test_p1236_web_crawler.py) |
| 1242 | [Web Crawler Multithreaded](https://leetcode.com/problems/web-crawler-multithreaded/) | [src](leetcode/p1242_web_crawler_multithreaded.py) | [tst](tests/test_p1242_web_crawler_multithreaded.py) |
| 1244 | [Design A Leaderboard](https://leetcode.com/problems/design-a-leaderboard/) | [src](leetcode/p1244_design_a_leaderboard.py) | [tst](tests/test_p1244_design_a_leaderboard.py) |
| 1249 | [Minimum Remove To Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/) | [src](leetcode/p1249_minimum_remove_to_make_valid_parentheses.py) | [tst](tests/test_p1249_minimum_remove_to_make_valid_parentheses.py) |
| 1275 | [Find Winner On A Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/) | [src](leetcode/p1275_find_winner_on_a_tic_tac_toe_game.py) | [tst](tests/test_p1275_find_winner_on_a_tic_tac_toe_game.py) |
| 1302 | [Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/) | [src](leetcode/p1302_deepest_leaves_sum.py) | [tst](tests/test_p1302_deepest_leaves_sum.py) |
| 1329 | [Sort The Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/) | [src](leetcode/p1329_sort_the_matrix_diagonally.py) | [tst](tests/test_p1329_sort_the_matrix_diagonally.py) |
| 1332 | [Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/) | [src](leetcode/p1332_remove_palindromic_subsequences.py) | [tst](tests/test_p1332_remove_palindromic_subsequences.py) |
| 1335 | [Minimum Difficulty Of A Job Schedule](https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/) | [src](leetcode/p1335_minimum_difficulty_of_a_job_schedule.py) | [tst](tests/test_p1335_minimum_difficulty_of_a_job_schedule.py) |
| 1337 | [The K Weakest Rows In A Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/) | [src](leetcode/p1337_the_k_weakest_rows_in_a_matrix.py) | [tst](tests/test_p1337_the_k_weakest_rows_in_a_matrix.py) |
| 1339 | [Maximum Product Of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/) | [src](leetcode/p1339_maximum_product_of_splitted_binary_tree.py) | [tst](tests/test_p1339_maximum_product_of_splitted_binary_tree.py) |
| 1342 | [Number Of Steps To Reduce A Number To Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/) | [src](leetcode/p1342_number_of_steps_to_reduce_a_number_to_zero.py) | [tst](tests/test_p1342_number_of_steps_to_reduce_a_number_to_zero.py) |
| 1353 | [Maximum Number Of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/) | [src](leetcode/p1353_maximum_number_of_events_that_can_be_attended.py) | [tst](tests/test_p1353_maximum_number_of_events_that_can_be_attended.py) |
| 1354 | [Construct Target Array With Multiple Sums](https://leetcode.com/problems/construct-target-array-with-multiple-sums/) | [src](leetcode/p1354_construct_target_array_with_multiple_sums.py) | [tst](tests/test_p1354_construct_target_array_with_multiple_sums.py) |
| 1396 | [Design Underground System](https://leetcode.com/problems/design-underground-system/) | [src](leetcode/p1396_design_underground_system.py) | [tst](tests/test_p1396_design_underground_system.py) |
| 1406 | [Stone Game Iii](https://leetcode.com/problems/stone-game-iii/) | [src](leetcode/p1406_stone_game_iii.py) | [tst](tests/test_p1406_stone_game_iii.py) |
| 1423 | [Maximum Points You Can Obtain From Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/) | [src](leetcode/p1423_maximum_points_you_can_obtain_from_cards.py) | [tst](tests/test_p1423_maximum_points_you_can_obtain_from_cards.py) |
| 1428 | [Leftmost Column With At Least A One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/) | [src](leetcode/p1428_leftmost_column_with_at_least_a_one.py) | [tst](tests/test_p1428_leftmost_column_with_at_least_a_one.py) |
| 1437 | [Check If All 1S Are At Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/) | [src](leetcode/p1437_check_if_all_1s_are_at_least_length_k_places_away.py) | [tst](tests/test_p1437_check_if_all_1s_are_at_least_length_k_places_away.py) |
| 1448 | [Count Good Nodes In Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/) | [src](leetcode/p1448_count_good_nodes_in_binary_tree.py) | [tst](tests/test_p1448_count_good_nodes_in_binary_tree.py) |
| 1461 | [Check If A String Contains All Binary Codes Of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/) | [src](leetcode/p1461_check_if_a_string_contains_all_binary_codes_of_size_k.py) | [tst](tests/test_p1461_check_if_a_string_contains_all_binary_codes_of_size_k.py) |
| 1471 | [The K Strongest Values In An Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array/) | [src](leetcode/p1471_the_k_strongest_values_in_an_array.py) | [tst](tests/test_p1471_the_k_strongest_values_in_an_array.py) |
| 1494 | [Parallel Courses Ii](https://leetcode.com/problems/parallel-courses-ii/) | [src](leetcode/p1494_parallel_courses_ii.py) | [tst](tests/test_p1494_parallel_courses_ii.py) |
| 1498 | [Number Of Subsequences That Satisfy The Given Sum Condition](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/) | [src](leetcode/p1498_number_of_subsequences_that_satisfy_the_given_sum_condition.py) | [tst](tests/test_p1498_number_of_subsequences_that_satisfy_the_given_sum_condition.py) |
| 1500 | [Design A File Sharing System](https://leetcode.com/problems/design-a-file-sharing-system/) | [src](leetcode/p1500_design_a_file_sharing_system.py) | [tst](tests/test_p1500_design_a_file_sharing_system.py) |
| 1551 | [Minimum Operations To Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/) | [src](leetcode/p1551_minimum_operations_to_make_array_equal.py) | [tst](tests/test_p1551_minimum_operations_to_make_array_equal.py) |
| 1584 | [Min Cost To Connect All Points](https://leetcode.com/problems/min-cost-to-connect-all-points/) | [src](leetcode/p1584_min_cost_to_connect_all_points.py) | [tst](tests/test_p1584_min_cost_to_connect_all_points.py) |
| 1629 | [Slowest Key](https://leetcode.com/problems/slowest-key/) | [src](leetcode/p1629_slowest_key.py) | [tst](tests/test_p1629_slowest_key.py) |
| 1631 | [Path With Minimum Effort](https://leetcode.com/problems/path-with-minimum-effort/) | [src](leetcode/p1631_path_with_minimum_effort.py) | [tst](tests/test_p1631_path_with_minimum_effort.py) |
| 1641 | [Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/) | [src](leetcode/p1641_count_sorted_vowel_strings.py) | [tst](tests/test_p1641_count_sorted_vowel_strings.py) |
| 1642 | [Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/) | [src](leetcode/p1642_furthest_building_you_can_reach.py) | [tst](tests/test_p1642_furthest_building_you_can_reach.py) |
| 1644 | [Lowest Common Ancestor Of A Binary Tree Ii](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii/) | [src](leetcode/p1644_lowest_common_ancestor_of_a_binary_tree_ii.py) | [tst](tests/test_p1644_lowest_common_ancestor_of_a_binary_tree_ii.py) |
| 1646 | [Get Maximum In Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/) | [src](leetcode/p1646_get_maximum_in_generated_array.py) | [tst](tests/test_p1646_get_maximum_in_generated_array.py) |
| 1650 | [Lowest Common Ancestor Of A Binary Tree Iii](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/) | [src](leetcode/p1650_lowest_common_ancestor_of_a_binary_tree_iii.py) | [tst](tests/test_p1650_lowest_common_ancestor_of_a_binary_tree_iii.py) |
| 1657 | [Determine If Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/) | [src](leetcode/p1657_determine_if_two_strings_are_close.py) | [tst](tests/test_p1657_determine_if_two_strings_are_close.py) |
| 1658 | [Minimum Operations To Reduce X To Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/) | [src](leetcode/p1658_minimum_operations_to_reduce_x_to_zero.py) | [tst](tests/test_p1658_minimum_operations_to_reduce_x_to_zero.py) |
| 1663 | [Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/) | [src](leetcode/p1663_smallest_string_with_a_given_numeric_value.py) | [tst](tests/test_p1663_smallest_string_with_a_given_numeric_value.py) |
| 1673 | [Find The Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/) | [src](leetcode/p1673_find_the_most_competitive_subsequence.py) | [tst](tests/test_p1673_find_the_most_competitive_subsequence.py) |
| 1675 | [Minimize Deviation In Array](https://leetcode.com/problems/minimize-deviation-in-array/) | [src](leetcode/p1675_minimize_deviation_in_array.py) | [tst](tests/test_p1675_minimize_deviation_in_array.py) |
| 1676 | [Lowest Common Ancestor Of A Binary Tree Iv](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv/) | [src](leetcode/p1676_lowest_common_ancestor_of_a_binary_tree_iv.py) | [tst](tests/test_p1676_lowest_common_ancestor_of_a_binary_tree_iv.py) |
| 1679 | [Max Number Of K Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/) | [src](leetcode/p1679_max_number_of_k_sum_pairs.py) | [tst](tests/test_p1679_max_number_of_k_sum_pairs.py) |
| 1680 | [Concatenation Of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/) | [src](leetcode/p1680_concatenation_of_consecutive_binary_numbers.py) | [tst](tests/test_p1680_concatenation_of_consecutive_binary_numbers.py) |
| 1704 | [Determine If String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/) | [src](leetcode/p1704_determine_if_string_halves_are_alike.py) | [tst](tests/test_p1704_determine_if_string_halves_are_alike.py) |
| 1710 | [Maximum Units On A Truck](https://leetcode.com/problems/maximum-units-on-a-truck/) | [src](leetcode/p1710_maximum_units_on_a_truck.py) | [tst](tests/test_p1710_maximum_units_on_a_truck.py) |
| 1721 | [Swapping Nodes In A Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/) | [src](leetcode/p1721_swapping_nodes_in_a_linked_list.py) | [tst](tests/test_p1721_swapping_nodes_in_a_linked_list.py) |