https://github.com/straylittlepunk/leetcode

Leetcode Problems Solution
https://github.com/straylittlepunk/leetcode
algorithms-datastructures leetcode rust
Last synced: 7 months ago
JSON representation
Leetcode Problems Solution
Host: GitHub
URL: https://github.com/straylittlepunk/leetcode
Owner: StrayLittlePunk
License: apache-2.0
Created: 2020-11-25T01:09:50.000Z (almost 5 years ago)
Default Branch: main
Last Pushed: 2022-07-11T11:32:17.000Z (over 3 years ago)
Last Synced: 2023-04-14T08:33:58.504Z (over 2 years ago)
Topics: algorithms-datastructures, leetcode, rust
Language: Rust
Homepage: https://leetcode.com/saralee17/
Size: 686 KB
Stars: 0
Watchers: 1
Forks: 0
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project

README

          
LeetCode

========

(Notes: "🔒" means you need to buy subscription from Leetcode)

## Directory

   - [Array](#array)

   - [Backtracking](#backtracking)

   - [Bit Manipulation](#bit-manipulation)

   - [C](#c)

   - [Design](#design)

   - [Dynamic Programming](#dynamic-programming)

   - [Graph](#graph)

   - [Linkedlist](#linkedlist)

   - [Math](#math)

   - [Random](#random)

   - [SqlBash](#sqlbash)

   - [Stack Priority Queue](#stack-priority-queue)

   - [String](#string)

   - [Tree](#tree)

### Array

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [Rust](./array/src/solution/s0004_median_of_two_sorted_arrays.rs)|Hard|

|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [Rust](./array/src/solution/s0011_container_with_most_water.rs)|Medium|

|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)| [Rust](./array/src/solution/s0021_merge_two_sorted_lists.rs)|Easy|

|27|[Remove Element](https://leetcode.com/problems/remove-element/)| [Rust](./array/src/solution/s0027_remove_element.rs)|Easy|

|33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)| [Rust](./array/src/solution/s0027_remove_element.rs)|Hard|

|34|[Search for a Range](https://leetcode.com/problems/search-for-a-range/)| [Rust](./array/src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs)|Medium|

|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)| [Rust](./array/src/solution/s0035_search_insert_position.rs)|Medium|

|42|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)| [Rust](./array/src/solution/s0042_trapping_rain_water.rs)|Hard|

|45|[Jump Game II](https://leetcode.com/problems/jump-game-ii/)| [Rust](./array/src/solution/s0045_jump_game_ii.rs)|Hard|

|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)| [Rust](./array/src/solution/s0053_maximum_subarray.rs)|Medium|

|75|[Sort Colors](https://leetcode.com/problems/sort-colors/)| [Rust](./array/src/solution/s0075_sort_colors.rs)|Medium|

|81|[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)| [Rust](./array/src/solution/s0081_search_in_rotated_sorted_array_ii.rs)|Medium|

|88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)| [Rust](./array/src/solution/s0088_merge_sorted_array.rs)|Easy|

|121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)| [Rust](./array/src/solution/s0121_best_time_to_buy_and_sell_stock.rs)|Medium|

|122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)| [Rust](./array/src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs)|Medium|

|123|[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/)| [Rust](./array/src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs)|Hard|

|135|[Candy](https://leetcode.com/problems/candy/)| [Rust](./array/src/solution/s0135_candy.rs)|Hard|

|152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)| [Rust](./array/src/solution/s0152_maximum_product_subarray.rs)|Medium|

|153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)| [Rust](./array/src/solution/s0153_find_minimum_in_rotated_sorted_array.rs)|Medium|

|154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)| [Rust](./array/src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs)|Hard|

|162|[Find Peak Element](https://leetcode.com/problems/find-peak-element/) | [Rust](./array/src/solution/s0162_find_peak_element.rs)|Medium|

|163|[Missing Ranges](https://leetcode.com/problems/missing-ranges/) | [Rust](./array/src/solution/s0163_missing_ranges.rs)|Medium|

|164|[Maximum Gap](https://leetcode.com/problems/maximum-gap/) | [Rust](./array/src/solution/s0164_maximum_gap.rs)|Hard|

|188|[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/)| [Rust](./array/src/solution/s0188_best_time_to_buy_and_sell_stock_iv.rs)|Hard|

|209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)| [Rust](./array/src/solution/s0209_minimum_size_subarray_sum.rs)|Medium|

|228|[Summary Ranges](https://leetcode.com/problems/summary-ranges/)| [Rust](./array/src/solution/s0228_summary_ranges.rs)|Easy|

|229|[Majority Element II](https://leetcode.com/problems/majority-element-ii/) | [Rust](./array/src/solution/s0228_summary_ranges.rs)|Medium|

|238|[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)| [Rust](./array/src/solution/s0238_product_of_array_except_self.rs)|Medium|

|239|[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/)| [Rust](./array/src/solution/s0239_sliding_window_maximum.rs)|Hard|

|243|[Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/)| [Rust](./array/src/solution/s0243_shortest_word_distance.rs)|Easy|

|252|[Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)| [Rust](./array/src/solution/s0252_meeting_rooms.rs)|Easy|

|253|[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)| [Rust](./array/src/solution/s0253_meeting_rooms_ii.rs)|Medium|

|280|[Wiggle Sort](https://leetcode.com/problems/wiggle-sort/)| [Rust](./array/src/solution/s0280_wiggle_sort.rs)|Medium|

|283|[Move Zeroes](https://leetcode.com/problems/move-zeroes/)  | [Rust](./array/src/solution/s0283_move_zeroes.rs)|Easy|

|287|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)  | [Rust](./array/src/solution/s0287_find_the_duplicate_number.rs)|Hard|

|289|[Game of Life](https://leetcode.com/problems/game-of-life/) | [Rust](./array/src/solution/s0289_game_of_life.rs)|Medium|

|295|[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | [Rust](./array/src/solution/s0295_find_median_from_data_stream.rs)|Hard|

|300|[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)  | [Rust](./array/src/solution/s0300_longest_increasing_subsequence.rs)|Medium|

|309|[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [Rust](./array/src/solution/s0309_best_time_to_buy_and_sell_stock_cooldown.rs)|Medium|

|321|[Create Maximum Number](https://leetcode.com/problems/create-maximum-number/) | [Rust](./array/src/solution/s0321_create_maximum_number.rs)|Hard|

|324|[Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/) | [Rust](./array/src/solution/s0324_wiggle_sort_ii.rs)|Medium|

|325|[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/) | [Rust](./array/src/solution/s0325_maximum_size_subarray_sum_equals_k.rs)|Medium|

|330|[Patching Array](https://leetcode.com/problems/patching-array/) | [Rust](./array/src/solution/s0330_patching_array.rs)|Medium|

|334|[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/) | [Rust](./array/src/solution/s0334_increasing_triplet_subsequence.rs)|Medium|

|349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | [Rust](./array/src/solution/s0349_intersection_of_two_arrays.rs)|Easy|

|350|[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | [Rust](./array/src/solution/s0350_intersection_of_two_arrays_ii.rs)|Easy|

|352|[Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals/) | [Rust](./array/src/solution//array/src/solution/s0352_data_stream_as_disjoint_intervals.rs)|Hard|

|354|[Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/) | [~~Rust~~](./array/src/solution//array/src/solution/s0354_russian_doll_envelopes.rs)|Hard|

|376|[Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/) | [Rust](./array/src/solution/s0376_wiggle_subsequence.rs)|Medium|

|560|[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | [Rust](./array/src/solution/s0560_subarray_sum_equals_k.rs)|Medium|

|575|[Distribute Candies](https://leetcode.com/problems/distribute-candies/) | [Rust](./array/src/solution/s0575_distribute_candies.rs)|Easy|

|581|[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/) | [Rust](./array/src/solution/s0581_shortest_unsorted_continuous_subarray.rs)|Easy|

|665|[Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array/) | [Rust](./array/src/solution/s0665_non_decreasing_array.rs)|Medium|

|674|[Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/) | [Rust](./array/src/solution/s0674_longest_continuous_increasing_subsequence.rs)|Easy|

|704|[Binary Search](https://leetcode.com/problems/binary-search/) | [Rust](./array/src/solution/s0704_binary_search.rs)|Easy|

|724|[Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) | [Rust](./array/src/solution/s0724_find_pivot_index.rs)|Easy|

|821|[Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/) | [Rust](./array/src/solution/s0821_shortest_distance_to_a_character.rs)|Easy|

|896|[Monotonic Array](https://leetcode.com/problems/monotonic-array/) | [Rust](./array/src/solution/s0896_monotonic_array.rs)|Easy|

|904|[Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/) | [Rust](./array/src/solution/s0904_fruit_into_baskets.rs)|Medium|

|905|[Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/) | [Rust](./array/src/solution/s0905_sort_array_by_parity.rs)|Easy|

|931|[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/) | [Rust](./array/src/solution/s0931_minimum_falling_path_sum.rs)|Medium|

|939|[Minimum Area Rectangle](https://leetcode.com/problems/minimum-area-rectangle/) | [Rust](./array/src/solution/s0939_minimum_area_rectangle.rs)|Medium|

|941|[Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/) | [Rust](./array/src/solution/s0941_valid_mountain_array.rs)|Easy|

|969|[Pancake Sorting](https://leetcode.com/problems/pancake-sorting/) | [Rust](./array/src/solution/s0969_pancake_sorting.rs)|Medium|

|977|[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | [Rust](./array/src/solution/s0977_squares_of_a_sorted_array.rs)|Easy|

|986|[Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/) | [Rust](./array/src/solution/s0986_interval_list_intersections.rs)|Medium|

|989|[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/) | [Rust](./array/src/solution/s0989_add_to_array_form_of_integer.rs)|Easy|

|1053|[Previous Permutation With One Swap](https://leetcode.com/problems/previous-permutation-with-one-swap/) | [Rust](./array/src/solution/s1053_previous_permutation_with_one_swap.rs)|Medium|

|1266|[Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/) | [Rust](./array/src/solution/s1266_minimum_time_visiting_all_points.rs)|Easy|

|1281|[Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/) | [Rust](./array/src/solution/s1281_subtract_the_product_and_sum_of_digits_of_an_integer.rs)|Easy|

|1287|[Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/) | [Rust](./array/src/solution/s1287_element_appearing_more_than_25_in_sorted_array.rs)|Easy|

|1299|[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/) | [Rust](./array/src/solution/s1299_replace_elements_with_greatest_element_on_right_side.rs)|Easy|

|1314|[Matrix Block Sum](https://leetcode.com/problems/matrix-block-sum/) | [Rust](./array/src/solution/s1314_matrix_block_sum.rs)|Medium|

|1375|[Bulb Switcher III](https://leetcode.com/problems/bulb-switcher-iii/) | [Rust](./array/src/solution/s1375_bulb_switcher_iii.rs)|Medium|

### Backtracking

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)| [Rust](./backtracking/src/solution/s0017_letter_combinations_of_a_phone_number.rs)|Medium|

|31|[Next Permutation](https://leetcode.com/problems/next-permutation/)| [Rust](./backtracking/src/solution/s0031_next_permutation.rs)|Medium|

|39|[Combination Sum](https://leetcode.com/problems/combination-sum/)| [Rust](./backtracking/src/solution/s0039_combination_sum.rs)|Medium|

|40|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)| [Rust](./backtracking/src/solution/s0040_combination_sum_ii.rs)|Medium|

|46|[Permutations](https://leetcode.com/problems/permutations/)| [Rust](./backtracking/src/solution/s0046_permutations.rs)|Medium|

|47|[Permutations II](https://leetcode.com/problems/permutations-ii/)| [Rust](./backtracking/src/solution/s0047_permutations_ii.rs)|Hard|

|60|[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/)| [Rust](./backtracking/src/solution/s0060_permutation_sequence.rs)|Medium|

|77|[Combinations](https://leetcode.com/problems/combinations/)| [Rust](./backtracking/src/solution/s0077_combinations.rs)|Medium|

|78|[Subsets](https://leetcode.com/problems/subsets/)| [Rust](./backtracking/src/solution/s0078_subsets.rs)|Medium|

|90|[Subsets II](https://leetcode.com/problems/subsets-ii/)| [Rust](./backtracking/src/solution/s0090_subsets_ii.rs)|Medium|

|93|[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)| [Rust](./backtracking/src/solution/s0093_restore_ip_addresses.rs)|Medium|

|140|[Word Break II](https://leetcode.com/problems/word-break-ii/)| [Rust](./backtracking/src/solution/s0140_word_break_ii.rs)|Hard|

|216|[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/)| [Rust](./backtracking/src/solution/s0216_combination_sum_iii.rs)|Medium|

|254|[Factor Combinations](https://leetcode.com/problems/factor-combinations/)| [Rust](./backtracking/src/solution/s0254_factor_combinations.rs)|Medium|

|282|[Expression Add Operators](https://leetcode.com/problems/expression-add-operators/)  | [Rust](./backtracking/src/solution/s0282_expression_add_operators.rs)|Hard|

|291|[Word Pattern II](https://leetcode.com/problems/word-pattern-ii/)  | [Rust](./backtracking/src/solution/s0291_word_pattern_ii.rs)|Hard|

|320|[Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation/)  | [Rust](./backtracking/src/solution/s0320_generalized_abbreviation.rs)|Medium|

|351|[Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/)  | [Rust](./backtracking/src/solution/s0351_android_unlock_patterns.rs)|Medium|

|377|[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/) | [Rust](./backtracking/src/solution/s0377_combination_sum_iv.rs)|Medium|

|784|[Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/) | [Rust](./backtracking/src/solution/s0784_letter_case_permutation.rs)|Medium|

|1219|[Path with Maximum Gold](https://leetcode.com/problems/path-with-maximum-gold/) | [Rust](./backtracking/src/solution/s1219_path_with_maximum_gold.rs)|Medium|

### Bit Manipulation

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|89|[Gray Code](https://leetcode.com/problems/gray-code/)| [Rust](./bitmanipulation/src/solution/s0089_gray_code.rs)|Medium|

|136|[Single Number](https://leetcode.com/problems/single-number/)| [Rust](./bitmanipulation/src/solution/s0136_single_number.rs)|Medium|

|137|[Single Number II](https://leetcode.com/problems/single-number-ii/)| [Rust](./bitmanipulation/src/solution/s0137_single_number_ii.rs)|Medium|

|191|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)| [Rust](./bitmanipulation/src/solution/s0191_number_of_1_bits.rs)|Easy|

|201|[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/)| [Rust](./bitmanipulation/src/solution/s0201_bitwise_and_of_numbers_range.rs)|Medium|

|260|[Single Number III](https://leetcode.com/problems/single-number-iii/)| [Rust](./bitmanipulation/src/solution/s0260_single_number_iii.rs)|Medium|

|268|[Missing Number](https://leetcode.com/problems/missing-number/)| [Rust](./bitmanipulation/src/solution/s0268_missing_number.rs)|Medium|

|318|[Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) | [Rust](./bitmanipulation/src/solution/s0318_maximum_product_of_word_lengths.rs)|Medium|

|338|[Counting Bits](https://leetcode.com/problems/counting-bits/) | [Rust](./bitmanipulation/src/solution/s0338_counting_bits.rs)|Medium|

|371|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/description/) | [Rust](./bitmanipulation/src/solution/s0371_sum_of_two_integers.rs)|Easy|

|389|[Find the Difference](https://leetcode.com/problems/find-the-difference/) | [Rust](./bitmanipulation/src/solution/s0389_find_the_difference.rs)|Easy|

|393|[UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/) | [Rust](./bitmanipulation/src/solution/s0393_utf8_validation.rs)|Medium|

### C

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|116|[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)| [C](./c/solution/s0116_populating_next_right_pointers_in_each_node.c)|Medium|

|117|[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/)| [C](./c/solution/s0117_populating_next_right_pointers_in_each_node_ii.c)|Hard|

|133|[Clone Graph](https://leetcode.com/problems/clone-graph/)| [C](./c/solution/s0133_clone_graph.c)|Medium|

|138|[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/)| [C](./c/solution/s0138_copy_list_with_random_pointer.c)|Hard|

|141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)| [C](./c/solution/s0141_linked_list_cycle.c)|Medium|

|142|[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)| [C](./c/solution/s0142_linked_list_cycle_ii.c)|Medium|

|157|[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/)| [C](./c/solution/s0157_read_n_characters_given_read4.c)|Easy|

|158|[Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/) | [C](./c/solution/s0158_read_n_characters_given_read4_ii_call_multiple_times.c)|Hard|

|160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [C](./c/solution/s0160_intersection_of_two_linked_lists.c)|Easy|

|190|[Reverse Bits](https://leetcode.com/problems/reverse-bits/)| [C](./c/solution/s0190_reverse_bits.c)|Easy|

|235|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)| [C](./c/solution/s0235_lowest_common_ancestor_of_a_binary_search_tree.c)|Easy|

|236|[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)| [C](./c/solution/s0236_lowest_common_ancestor_of_a_binary_tree.c)|Medium|

|237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)| [C](./c/solution/s0237_delete_node_in_a_linked_list.c)|Easy|

|284|[Peeking Iterator](https://leetcode.com/problems/peeking-iterator/)  | [C](./c/solution/s0284_peeking_iterator.c)|Medium|

|285|[Inorder Successor in BST](https://leetcode.com/problems/inorder-successor-in-bst/) | [C](./c/solution/s0285_inorder_successor_in_bst.c) |Medium|

|297|[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)  | [C](./c/solution/s0297_serialize_and_deserialize_binary_tree.c)|Medium|

### Design

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|146|[LRU Cache](https://leetcode.com/problems/lru-cache/)| [Rust](./design/src/solution/s0146_lru_cache.rs)|Hard|

|170|[Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/) | [Rust](./design/src/solution/s0170_two_sum_iii_data_structure_design.rs)|Easy|

|170|[Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/) | [Rust](./design/src/solution/s0251_flatten_2d_vector.rs)|Medium|

|281|[Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator/) | [Rust](./design/src/solution/s0251_flatten_2d_vector.rs)|Medium|

|288|[Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation/) | [~~Rust~~](./design/src/solution/s0288_unique_word_abbreviation.rs)|Medium|

|303|[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)  | [Rust](./design/src/solution/s0303_range_sum_query_immutable.rs)|Easy|

|304|[Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | [Rust](./design/src/solution/s0304_range_sum_query_2d_immutable.rs)|Medium|

|307|[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/) | [Rust](./design/src/solution/s0307_range_sum_query_mutable.rs)|Medium|

|308|[Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable/) | [Rust](./design/src/solution/s0308_range_sum_query_2d_mutable.rs)|Hard|

|346|[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/) | [Rust](./design/src/solution/s0346_moving_average_from_data_stream.rs)|Easy|

|348|[Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe/) | [Rust](./design/src/solution/s0348_design_tic_tac_toe.rs)|Medium|

|353|[Design Snake Game](https://leetcode.com/problems/design-snake-game/) | [Rust](./design/src/solution/s0353_design_snake_game.rs)|Medium|

|355|[Design Twitter](https://leetcode.com/problems/design-twitter/) | [Rust](./design/src/solution/s0355_design_twitter.rs)|Medium|

|359|[Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/) | [Rust](./design/src/solution/s0359_logger_rate_limiter.rs)|Easy|

|362|[Design Hit Counter](https://leetcode.com/problems/design-hit-counter/) | [Rust](./design/src/solution/s0362_design_hit_counter.rs)|Medium|

|379|[Design Phone Directory](https://leetcode.com/problems/design-phone-directory/) | [Rust](./design/src/solution/s0379_design_phone_directory.rs)|Medium|

|731|[My Calendar II](https://leetcode.com/problems/my-calendar-ii/) | [Rust](./design/src/solution/s0731_my_calendar_ii.rs)|Medium|

|1032|[Stream of Characters](https://leetcode.com/problems/stream-of-characters/) | [Rust](./design/src/solution/s1032_stream_of_characters.rs)|Hard|

|1206|[Design Skiplist](https://leetcode.com/problems/design-skiplist/) | [Rust](./design/src/solution/s1206_design_skiplist.rs)|Hard|

|1352|[Product of the Last K Numbers](https://leetcode.com/problems/product-of-the-last-k-numbers/) | [Rust](./design/src/solution/s1352_product_of_the_last_k_numbers.rs)|Medium|

|1429|[First Unique Number](https://leetcode.com/problems/first-unique-number/) | [Rust](./design/src/solution/s1429_first_unique_number.rs)|Medium|

|1570|[Dot Product of Two Sparse Vectors](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/) | [Rust](./design/src/solution/s1570_dot_product_of_two_sparse_vectors.rs)|Medium|

### Dynamic Programming

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|10|[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)| [Rust](./dynamic_programming/src/solution/s0010_regular_expression_matching.rs)|Hard|

|44|[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/)| [Rust](./dynamic_programming/src/solution/s0044_wildcard_matching.rs)|Hard|

|62|[Unique Paths](https://leetcode.com/problems/unique-paths/)| [Rust](./dynamic_programming/src/solution/s0062_unique_paths.rs)|Medium|

|63|[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/)| [Rust](./dynamic_programming/src/solution/s0063_unique_paths_ii.rs)|Medium|

|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)| [Rust](./dynamic_programming/src/solution/s0070_climbing_stairs.rs)|Easy|

|72|[Edit Distance](https://leetcode.com/problems/edit-distance/)| [Rust](./dynamic_programming/src/solution/s0072_edit_distance.rs)|Hard|

|85|[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/)| [Rust](.dynamic_programming/src/solution/s0085_maximal_rectangle.rs)|Hard|

|91|[Decode Ways](https://leetcode.com/problems/decode-ways/)| [Rust](./dynamic_programming/src/solution/s0091_decode_ways.rs)|Medium|

|97|[Interleaving String](https://leetcode.com/problems/interleaving-string/)| [Rust](./dynamic_programming/src/solution/s0097_interleaving_string.rs)|Hard|

|120|[Triangle](https://leetcode.com/problems/triangle/)| [Rust](./dynamic_programming/src/solution/s0120_triangle.rs)|Medium|

|128|[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)| [Rust](./dynamic_programming/src/solution/s0128_longest_consecutive_sequence.rs)|Hard|

|139|[Word Break](https://leetcode.com/problems/word-break/)| [Rust](./dynamic_programming/src/solution/s0139_word_break.rs)|Medium|

|174|[Dungeon Game](https://leetcode.com/problems/dungeon-game/) | [Rust](./dynamic_programming/src/solution/s0174_dungeon_game.rs)|Hard|

|198|[House Robber](https://leetcode.com/problems/house-robber/)| [Rust](./dynamic_programming/src/solution/s0198_house_robber.rs)|Easy|

|213|[House Robber II](https://leetcode.com/problems/house-robber-ii/)| [Rust](./dynamic_programming/src/solution/s0213_house_robber_ii.rs)|Medium|

|221|[Maximal Square](https://leetcode.com/problems/maximal-square/)| [Rust](./dynamic_programming/src/solution/s0221_maximal_square.rs)|Medium|

|256|[Paint House](https://leetcode.com/problems/paint-house/)| [Rust](./dynamic_programming/src/solution/s0256_paint_house.rs)|Medium|

|265|[Paint House II](https://leetcode.com/problems/paint-house-ii/)| [Rust](./dynamic_programming/src/solution/s0265_paint_house_ii.rs)|Hard|

|276|[Paint Fence](https://leetcode.com/problems/paint-fence/)| [Rust](./dynamic_programming/src/solution/s0276_paint_fence.rs)|Easy|

|279|[Perfect Squares](https://leetcode.com/problems/perfect-squares/) | [Rust](./dynamic_programming/src/solution/s0279_perfect_squares.rs)|Medium|

|312|[Burst Balloons](https://leetcode.com/problems/burst-balloons/) | [Rust](./dynamic_programming/src/solution/s0312_burst_balloons.rs)|Hard|

|322|[Coin Change](https://leetcode.com/problems/coin-change/) | [Rust](./dynamic_programming/src/solution/s0322_coin_change.rs)|Medium|

|363|[Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/) | [Rust](./dynamic_programming/src/solution/s0363_max_sum_of_rectangle_no_larger_than_k.rs)|Hard|

|375|[Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/) | [Rust](./dynamic_programming/src/solution/s0375_guess_number_higher_or_lower_ii.rs)|Medium|

|413|[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/) | [Rust](./dynamic_programming/src/solution/s0413_arithmetic_slices.rs)|Medium|

|1000|[Minimum Cost to Merge Stones](https://leetcode.com/problems/minimum-cost-to-merge-stones/) | [Rust](./dynamic_programming/src/solution/s1000_minimum_cost_to_merge_stones.rs)|Hard|

|1066|[Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii/) | [Rust](./dynamic_programming/src/solution/s1066_campus_bikes_ii.rs)|Medium|

|1155|[Number of Dice Rolls With Target Sum](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/) | [Rust](./dynamic_programming/src/solution/s1155_number_of_dice_rolls_with_target_sum.rs)|Medium|

|1196|[How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/) | [Rust](./dynamic_programming/src/solution/s1196_how_many_apples_can_you_put_into_the_basket.rs)|Easy|

|1335|[Minimum Difficulty of a Job Schedule](https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/) | [Rust](./dynamic_programming/src/solution/s1335_minimum_difficulty_of_a_job_schedule.rs)|Hard|

|1504|[Count Submatrices With All Ones](https://leetcode.com/problems/count-submatrices-with-all-ones/) | [Rust](./dynamic_programming/src/solution/s1504_count_submatrices_with_all_ones.rs)|Medium|

### Graph

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|51|[N-Queens](https://leetcode.com/problems/n-queens/) | [Rust](./graph/src/solution/s0051_n_queens.rs)|Hard|

|52|[N-Queens II](https://leetcode.com/problems/n-queens-ii/) | [Rust](./graph/src/solution/s0052_n_queens_ii.rs)|Hard|

|126|[Word Ladder II](https://leetcode.com/problems/word-ladder-ii/)| [Rust](./graph/src/solution/s0126_word_ladder_ii.rs)|Hard|

|127|[Word Ladder](https://leetcode.com/problems/word-ladder/)| [Rust](./graph/src/solution/s0127_word_ladder.rs)|Medium|

|130|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)| [Rust](./graph/src/solution/s0130_surrounded_regions.rs)|Medium|

|149|[Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/)| [Rust](./graph/src/solution/s0149_max_points_on_a_line.rs)|Hard|

|200|[Number of Islands](https://leetcode.com/problems/number-of-islands/)| [Rust](./graph/src/solution/s0200_number_of_islands.rs)|Medium|

|207|[Course Schedule](https://leetcode.com/problems/course-schedule/)| [Rust](./graph/src/solution/s0207_course_schedule.rs)|Medium|

|210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)| [Rust](./graph/src/solution/s0210_course_schedule_ii.rs)|Medium|

|223|[Rectangle Area](https://leetcode.com/problems/rectangle-area/)| [Rust](./graph/src/solution/s0223_rectangle_area.rs)|Easy|

|261|[Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)| [Rust](./graph/src/solution/s0261_graph_valid_tree.rs)|Medium|

|269|[Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)| [Rust](./graph/src/solution/s0269_alien_dictionary.rs)|Hard|

|286|[Walls and Gates](https://leetcode.com/problems/walls-and-gates/)| [Rust](./graph/src/solution/s0286_walls_and_gates.rs)|Medium|

|305|[Number of Islands II](https://leetcode.com/problems/number-of-islands-ii/)| [Rust](./graph/src/solution/s0305_number_of_islands_ii.rs)|Hard|

|310|[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/) | [Rust](./graph/src/solution/s0310_minimum_height_trees.rs)|Medium|

|323|[Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | [Rust](./graph/src/solution/s0323_number_of_connected_components_in_an_undirected_graph.rs)|Medium|

|335|[Self Crossing](https://leetcode.com/problems/self-crossing/) | [Rust](./graph/src/solution/s0335_self_crossing.rs)|Hard|

|339|[Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/) | [Rust](./graph/src/solution/s0339_nested_list_weight_sum.rs)|Easy|

|356|[Line Reflection](https://leetcode.com/problems/line-reflection/) | [Rust](./graph/src/solution/s0356_line_reflection.rs)|Medium|

|364|[Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii/) | [Rust](./graph/src/solution/s0364_nested_list_weight_sum_ii.rs)|Medium|

|391|[Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle/) | [Rust](./graph/src/solution/s0391_prefect_rectangle.rs)|Hard|

|399|[Evaluate Division](https://leetcode.com/problems/evaluate-division/) | [Rust](./graph/src/solution/s0399_evaluate_division.rs)|Medium|

|444|[Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction/) | [Rust](./graph/src/solution/s0444_sequence_reconstruction.rs)|Medium|

|463|[Island Perimeter](https://leetcode.com/problems/island-perimeter/) | [Rust](./graph/src/solution/s0463_island_perimeter.rs)|Easy|

|675|[Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event/) | [Rust](./graph/src/solution/s0675_cut_off_trees_for_golf_event.rs)|Hard|

|695|[Max Area of Island](https://leetcode.com/problems/max-area-of-island/) | [Rust](./graph/src/solution/s0695_max_area_of_island.rs)|Medium|

|766|[Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix/) | [Rust](./graph/src/solution/s0766_toeplitz_matrix.rs)|Easy|

|787|[Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/) | [Rust](./graph/src/solution/s0787_cheapest_flights_within_k_stops.rs)|Medium|

|841|[Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/) | [Rust](./graph/src/solution/s0841_keys_and_rooms.rs)|Medium|

|1254|[Number of Closed Islands](https://leetcode.com/problems/number-of-closed-islands/) | [Rust](./graph/src/solution/s1254_number_of_closed_islands.rs)|Medium|

### Linkedlist

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [Rust](./linkedlist/src/solution/s0002_add_two_numbers.rs)|Medium|

|19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [Rust](./linkedlist/src/solution/s0019_remove_nth_node_from_end_of_list.rs)|Easy|

|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)| [Rust](./linkedlist/src/solution/s0021_merge_two_sorted_lists.rs)|Easy|

|23|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| [Rust](./linkedlist/src/solution/s0023_merge_k_sorted_lists.rs)|Hard|

|24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)| [Rust](./linkedlist/src/solution/s0024_swap_nodes_in_pairs.rs)|Medium|

|25|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)| [Rust](./linkedlist/src/solution/s0025_reverse_nodes_in_k_group.rs)|Hard|

|61|[Rotate List](https://leetcode.com/problems/rotate-list/)| [Rust](./linkedlist/src/solution/s0061_rotate_list.rs)|Medium|

|82|[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/)| [Rust](./linkedlist/src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs)|Medium|

|83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)| [Rust](./linkedlist/src/solution/s0083_remove_duplicates_from_sorted_list.rs)|Easy|

|86|[Partition List](https://leetcode.com/problems/partition-list/)| [Rust](./linkedlist/src/solution/s0086_partition_list.rs)|Medium|

|92|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)| [Rust](./linkedlist/src/solution/s0092_reverse_linked_list_ii.rs)|Medium|

|143|[Reorder List](https://leetcode.com/problems/reorder-list/)| [Rust](./linkedlist/src/solution/s0143_reorder_list.rs)|Medium|

|147|[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Rust](./linkedlist/src/solution/s0147_insertion_sort_list.rs)|Medium|

|148|[Sort List](https://leetcode.com/problems/sort-list/)| [Rust](./linkedlist/src/solution/s0148_sort_list.rs)|Medium|

|203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)| [Rust](./linkedlist/src/solution/s0203_remove_linked_list_elements.rs)|Easy|

|206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Rust](./linkedlist/src/solution/s0206_reverse_linked_list.rs) |Easy|

|234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)| [Rust](./linkedlist/src/solution/s0234_palindrome_linked_list.rs)|Easy|

|328|[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | [Rust](./linkedlist/src/solution/s0328_odd_even_linked_list.rs)|Medium|

|369|[Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list/) | [Rust](./linkedlist/src/solution/s0369_plus_one_linked_list.rs)|Medium|

|876|[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | [Rust](./linkedlist/src/solution/s0876_middle_of_the_linked_list.rs)|Easy|

### Math

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|1|[Two Sum](https://leetcode.com/problems/two-sum/)| [Rust](./math/src/solution/s0001_two_sum.rs)|Easy|

|7|[Reverse Integer](https://leetcode.com/problems/reverse-integer/)| [Rust](./math/src/solution/s0007_reverse_integer.rs)|Easy|

|8|[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)| [Rust](./math/src/solution/s0008_string_to_integer_atoi.rs)|Easy|

|15|[3Sum](https://leetcode.com/problems/3sum/)| [Rust](./math/src/solution/s0015_3sum.rs)|Medium|

|16|[3Sum Closest](https://leetcode.com/problems/3sum-closest/)| [Rust](./math/src/solution/s0016_3sum_closest.rs)|Medium|

|18|[4Sum](https://leetcode.com/problems/4sum/)| [Rust](./math/src/solution/s0018_4sum.rs)|Medium|

|29|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)| [Rust](./math/src/solution/s0029_divide_two_integers.rs)|Medium|

|36|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)| [Rust](./math/src/solution/s0036_valid_sudoku.rs)|Easy|

|37|[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)| [Rust](./math/src/solution/s0037_sudoku_solver.rs)|Hard|

|43|[Multiply Strings](https://leetcode.com/problems/multiply-strings/)| [Rust](./math/src/solution/s0043_multiply_strings.rs)|Medium|

|48|[Rotate Image](https://leetcode.com/problems/rotate-image/)| [Rust](./math/src/solution/s0048_rotate_image.rs)|Medium|

|50|["Pow(x, n)"](https://leetcode.com/problems/powx-n/)| [Rust](./math/src/solution/s0050_powx_n.rs)|Medium|

|54|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)| [Rust](./math/src/solution/s0054_spiral_matrix.rs)|Medium|

|59|[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/)| [Rust](./math/src/solution/s0059_spiral_matrix_ii.rs)|Medium|

|66|[Plus One](https://leetcode.com/problems/plus-one/)| [Rust](./math/src/solution/s0066_plus_one.rs)|Easy|

|67|[Add Binary](https://leetcode.com/problems/add-binary/)| [Rust](./math/src/solution/s0067_add_binary.rs)|Easy|

|69|[Sqrt(x)](https://leetcode.com/problems/sqrtx/)| [Rust](./math/src/solution/s0069_sqrtx.rs)|Medium|

|73|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)| [Rust](./math/src/solution/s0073_set_matrix_zeroes.rs)|Medium|

|74|[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)| [Rust](./math/src/solution/s0074_search_a_2d_matrix.rs)|Medium|

|79|[Word Search](https://leetcode.com/problems/word-search/)| [Rust](./math/src/solution/s0079_word_search.rs)|Medium|

|165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | [Rust](./math/src/solution/s0165_compare_version_numbers.rs)|Easy|

|166|[Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/) | [Rust](./math/src/solution/s0166_fraction_to_recurring_decimal.rs)|Medium|

|167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | [Rust](./math/src/solution/s0167_two_sum_ii_input_array_is_sorted.rs)|Medium|

|172|[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) | [Rust](./math/src/solution/s0172_factorial_trailing_zeros.rs)|Easy|

|202|[Happy Number](https://leetcode.com/problems/happy-number/)| [Rust](./math/src/solution/s0202_happy_number.rs)|Easy|

|204|[Count Primes](https://leetcode.com/problems/count-primes/)| [Rust](./math/src/solution/s0204_count_primes.rs)|Easy|

|231|[Power of Two](https://leetcode.com/problems/power-of-two/)| [Rust](./math/src/solution/s0231_power_of_two.rs)|Easy|

|233|[Number of Digit One](https://leetcode.com/problems/number-of-digit-one/)| [Rust](./math/src/solution/s0233_number_of_digit_one.rs)|Medium|

|240|[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)|[Rust](./math/src/solution/s0240_search_a_2d_matrix_ii.rs)|Medium|

|258|[Add Digits](https://leetcode.com/problems/add-digits/)| [Rust](./math/src/solution/s0258_add_digits.rs)|Easy|

|259|[3Sum Smaller](https://leetcode.com/problems/3sum-smaller/)| [Rust](./math/src/solution/s0259_3sum_smaller.rs)|Medium|

|292|[Nim Game](https://leetcode.com/problems/nim-game/)  | [Rust](./math/src/solution/s0292_nim_game.rs)|Easy|

|296|[Best Meeting Point](https://leetcode.com/problems/best-meeting-point/)  | [Rust](./math/src/solution/s0296_best_meeting_point.rs)|Hard|

|302|[Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/)  | [Rust](./math/src/solution/s0302_smallest_rectangle_enclosing_black_pixels.rs)|Hard|

|306|[Additive Number](https://leetcode.com/problems/additive-number/) | [Rust](./math/src/solution/s0306_additive_number.rs)|Medium|

|311|[Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/) | [Rust](./math/src/solution/s0311_sparse_matrix_multiplication.rs)|Medium|

|317|[Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/) | [Rust](./math/src/solution/s0317_shortest_distance_from_all_buildings.rs)|Hard|

|319|[Bulb Switcher](https://leetcode.com/problems/bulb-switcher/) | [Rust](./math/src/solution/s0319_bulb_switcher.rs)|Medium|

|326|[Power of Three](https://leetcode.com/problems/power-of-three/) | [Rust](./math/src/solution/s0326_power_of_three.rs)|Easy|

|329|[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/) | [Rust](./math/src/solution/s0329_longest_increasing_path_in_a_matrix.rs)|Medium|

|342|[Power of Four](https://leetcode.com/problems/power-of-four/) | [Rust](./math/src/solution/s0342_power_of_four.rs)|Easy|

|343|[Integer Break](https://leetcode.com/problems/integer-break/) | [Rust](./math/src/solution/s0343_integer_break.rs)|Medium|

|357|[Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits/) | [Rust](./math/src/solution/s0357_count_numbers_with_unique_digits.rs)|Medium|

|360|[Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array/) | [Rust](./math/src/solution/s0360_sort_transformed_array.rs)|Medium|

|361|[Bomb Enemy](https://leetcode.com/problems/bomb-enemy/) | [Rust](./math/src/solution/s0361_bomb_enemy.rs)|Medium|

|365|[Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/) | [Rust](./math/src/solution/s0365_water_and_jug_problem.rs)|Medium|

|367|[Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/description/) | [Rust](./math/src/solution/s0367_valid_perfect_square.rs)|Easy|

|368|[Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/) | [Rust](./math/src/solution/s0368_largest_divisible_subset.rs)|Medium|

|370|[Range Addition](https://leetcode.com/problems/range-addition/) | [Rust](./math/src/solution/s0370_range_addition.rs)|Medium|

|372|[Super Pow](https://leetcode.com/problems/super-pow/) | [Rust](./math/src/solution/s0372_super_pow.rs)|Medium|

|378|[Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/) | [Rust](./math/src/solution/s0378_kth_smallest_element_in_a_sorted_matrix.rs)|Medium|

|386|[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/) | [Rust](./math/src/solution/s0386_lexicographical_numbers.rs)|Medium|

|390|[Elimination Game](https://leetcode.com/problems/elimination-game/) | [Rust](./math/src/solution/s0390_elimination_game.rs)|Medium|

|396|[Rotate Function](https://leetcode.com/problems/rotate-function/) | [Rust](./math/src/solution/s0396_rotate_function.rs)|Easy|

|397|[Integer Replacement](https://leetcode.com/problems/integer-replacement/) | [Rust](./math/src/solution/s0397_integer_replacement.rs)|Medium|

|400|[Nth Digit](https://leetcode.com/problems/nth-digit/) | [Rust](./math/src/solution/s0400_nth_digit.rs)|Medium|

|885|[Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii/) | [Rust](./math/src/solution/s0885_spiral_matrix_iii.rs)|Medium|

|1131|[Maximum of Absolute Value Expression](https://leetcode.com/problems/maximum-of-absolute-value-expression/) | [Rust](./math/src/solution/s1131_maximum_of_absolute_value_expression.rs)|Medium|

|1137|[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/) | [Rust](./math/src/solution/s1137_n_th_tribonacci_number.rs)|Easy|

|1439|[Find the Kth Smallest Sum of a Matrix With Sorted Rows](https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/) | [Rust](./math/src/solution/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows.rs)|Hard|

|1518|[Water Bottles](https://leetcode.com/problems/water-bottles/) | [Rust](./math/src/solution/s1518_water_bottles.rs)|Easy|

### Random

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|380|[Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | [Rust](./random/src/solution/s0380_insert_delete_getrandom_o1.rs)|Hard|

|381|[Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/) | [Rust](./random/src/solution/s0381_insert_delete_getrandom_o1_duplicates_allowed.rs)|Hard|

|382|[Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/) | [Rust](./random/src/solution/s0382_linked_list_random_node.rs)|Medium|

|384|[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/) | [Rust](./random/src/solution/s0384_shuffle_an_array.rs)|Medium|

|398|[Random Pick Index](https://leetcode.com/problems/random-pick-index/) | [Rust](./random/src/solution/s0398_random_pick_index.rs)|Medium|

### SqlBash

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|175|[Combine Two Tables](https://leetcode.com/problems/combine-two-tables/) | [SQL](./sqlbash/s0175_combine_two_tables.sql)|Easy|

|176|[Second Highest Salary](https://leetcode.com/problems/second-highest-salary/) | [SQL](./sqlbash/s0176_second_highest_salary.sql)|Easy|

|177|[Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary/) | [SQL](./sqlbash/s0177_nth_highest_salary.sql)|Medium|

|178|[Rank Scores](https://leetcode.com/problems/rank-scores/) | [SQL](./sqlbash/s0178_rank_scores.sql)|Medium|

|180|[Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers/) | [SQL](./sqlbash/s0180_consecutive_numbers.sql)|Medium|

|181|[Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers/) | [SQL](./sqlbash/s0181_employees_earning_more_than_their_managers.sql)|Easy|

|182|[Duplicate Emails](https://leetcode.com/problems/duplicate-emails/) | [SQL](./sqlbash/s0182_duplicate_emails.sql)|Easy|

|183|[Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order/) | [SQL](./sqlbash/s0183_customers_who_never_order.sql)|Easy|

|184|[Department Highest Salary](https://leetcode.com/problems/department-highest-salary/) | [SQL](./sqlbash/s0184_department_highest_salary.sql)|Medium|

|185|[Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries/) | [SQL](./sqlbash/s0185_department_top_three_salaries.sql)|Hard|

|192|[Word Frequency](https://leetcode.com/problems/word-frequency/) | [SHELL](./sqlbash/s0192_word_frequency.sh)|Medium|

|193|[Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers/) | [SHELL](./sqlbash/s0193_valid_phone_numbers.sh)|Easy|

|194|[Transpose File](https://leetcode.com/problems/transpose-file/) | [SHELL](./sqlbash/s0194_transpose_file.sh)|Medium|

|195|[Tenth Line](https://leetcode.com/problems/tenth-line/) | [SHELL](./sqlbash/s0195_tenth_line.sh)|Easy|

|196|[Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails/) | [SQL](./sqlbash/s0196_delete_duplicate_emails.sql)|Easy|

|197|[Rising Temperature](https://leetcode.com/problems/rising-temperature/) | [SQL](./sqlbash/s0197_rising_temperature.sql)|Easy|

|262|[Trips and Users](https://leetcode.com/problems/trips-and-users/) | [SQL](./sqlbash/s0262_trips_and_users.sql)|Hard|

|595|[Big Countries](https://leetcode.com/problems/big-countries/) | [SQL](./sqlbash/s0595_big_countries.sql)|Easy|

|627|[Swap Salary](https://leetcode.com/problems/swap-salary/) | [SQL](./sqlbash/s0627_swap_salary.sql)|Easy|

|620|[Not Boring Movies](https://leetcode.com/problems/not-boring-movies/) | [SQL](./sqlbash/s0620_not_boring_movies.sql)|Easy|

|596|[Classes More Than 5 Students](https://leetcode.com/problems/classes-more-than-5-students/) | [SQL](./sqlbash/s0596_classes_more_than_5_students.sql)|Easy|

|626|[Exchange Seats](https://leetcode.com/problems/exchange-seats/) | [SQL](./sqlbash/s0626_exchange_seats.sql)|Medium|

### Stack Priority Queue

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|71|[Simplify Path](https://leetcode.com/problems/simplify-path/)| [Rust](./stack_priority_queue/src/solution/s0071_simplify_path.rs)|Medium|

|84|[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)| [Rust](./stack_priority_queue/src/solution/s0084_largest_rectangle_in_histogram.rs)|Hard|

|150|[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)| [Rust](./stack_priority_queue/src/solution/s0150_evaluate_reverse_polish_notation.rs)|Medium|

|155|[Min Stack](https://leetcode.com/problems/min-stack/)| [Rust](./stack_priority_queue/src/solution/s0155_min_stack.rs)|Easy|

|215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)| [Rust](./stack_priority_queue/src/solution/s0215_kth_largest_element_in_an_array.rs)|Medium|

|218|[The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/)| [Rust](./stack_priority_queue/src/solution/s0218_the_skyline_problem.rs)|Hard|

|224|[Basic Calculator](https://leetcode.com/problems/basic-calculator/)| [Rust](./stack_priority_queue/src/solution/s0224_basic_calculator.rs)|Medium|

|225|[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/)| [Rust](./stack_priority_queue/src/solution/s0225_implement_stack_using_queues.rs)|Medium|

|227|[Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/)| [Rust](./stack_priority_queue/src/solution/s0227_basic_calculator_ii.rs)|Medium|

|232|[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/)| [Rust](./stack_priority_queue/src/solution/s0232_implement_queue_using_stacks.rs)|Easy|

|263|[Ugly Number](https://leetcode.com/problems/ugly-number/)| [Rust](./stack_priority_queue/src/solution/s0263_ugly_number.rs)|Easy|

|264|[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)| [Rust](./stack_priority_queue/src/solution/s0264_ugly_number_ii.rs)|Medium|

|313|[Super Ugly Number](https://leetcode.com/problems/super-ugly-number/) | [Rust](./stack_priority_queue/src/solution/s0313_super_ugly_number.rs)|Medium|

|332|[Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | [Rust](./stack_priority_queue/src/solution/s0332_reconstruct_itinerary.rs)|Medium|

|341|[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) | [Rust](./stack_priority_queue/src/solution/s0341_flatten_nested_list_iterator.rs)|Medium|

|347|[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | [Rust](./stack_priority_queue/src/solution/s0347_top_k_frequent_elements.rs)|Medium|

|373|[Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/) | [Rust](./stack_priority_queue/src/solution/s0373_find_k_pairs_with_smallest_sums.rs)|Medium|

|385|[Mini Parser](https://leetcode.com/problems/mini-parser/) | [Rust](./stack_priority_queue/src/solution/s0385_mini_parser.rs)|Medium|

|388|[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/) | [Rust](./stack_priority_queue/src/solution/s0388_longest_absolute_file_path.rs)|Medium|

|394|[Decode String](https://leetcode.com/problems/decode-string/) | [Rust](./stack_priority_queue/src/solution/s0394_decode_string.rs)|Medium|

|503|[Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii/) | [Rust](./stack_priority_queue/src/solution/s0503_next_greater_element_ii.rs)|Medium|

|857|[Minimum Cost to Hire K Workers](https://leetcode.com/problems/minimum-cost-to-hire-k-workers/) | [Rust](./stack_priority_queue/src/solution/s0857_minimum_cost_to_hire_k_workers.rs)|Hard|

|1221|[Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/) | [Rust](./stack_priority_queue/src/solution/s1221_split_a_string_in_balanced_strings.rs)|Easy|

### String

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [Rust](./string/src/solution/s0003_longest_substring_without_repeating_characters.rs)|Medium|

|5|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)| [Rust](./string/src/solution/s0005_longest_palindromic_substring.rs)|Medium|

|6|[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)| [Rust](./string/src/solution/s0006_zigzag_conversion.rs)|Easy|

|9|[Palindrome Number](https://leetcode.com/problems/palindrome-number/)| [Rust](./string/src/solution/s0009_palindrome_number.rs)|Easy|

|12|[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)| [Rust](./string/src/solution/s0012_integer_roman.rs)|Medium|

|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/)| [Rust](./string/src/solution/s0013_roman_to_integer.rs)|Easy|

|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)| [Rust](./string/src/solution/s0014_longest_common_prefix.rs)|Easy|

|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [Rust](./string/src/solution/s0020_valid_parentheses.rs)|Easy|

|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)| [Rust](./string/src/solution/s0022_generate_parentheses.rs)|Medium|

|28|[Implement strStr()](https://leetcode.com/problems/implement-strstr/)| [Rust](./string/src/solution/s0028_implement_strstr.rs)|Easy|

|30|[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)| [Rust](./string/src/solution/s0030_substring_with_concatenation_of_all_words.rs)|Hard|

|32|[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)| [Rust](./string/src/solution/s0032_longest_valid_parentheses.rs)|Hard|

|38|[Count and Say](https://leetcode.com/problems/count-and-say/)| [Rust](./string/src/solution/s0038_count_and_say.rs)|Easy|

|49|[Group Anagrams](https://leetcode.com/problems/anagrams/)| [Rust](./string/src/solution/s0049_group_anagrams.rs)|Medium|

|58|[Length of Last Word](https://leetcode.com/problems/length-of-last-word/)| [Rust](./string/src/solution/s0058_length_of_last_word.rs)|Easy|

|65|[Valid Number](https://leetcode.com/problems/valid-number/)| [Rust](./string/src/solution/s0065_valid_number.rs)|Easy|

|68|[Text Justification](https://leetcode.com/problems/text-justification/)| [Rust](./string/src/solution/s0068_text_justification.rs)|Hard|

|76|[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)| [Rust](./string/src/solution/s0076_minimum_window_substring.rs)|Hard|

|87|[Scramble String](https://leetcode.com/problems/scramble-string/)| [Rust](./string/src/solution/s0087_scramble_string.rs)|Hard|

|115|[Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/)| [Rust](./string/src/solution/s0115_distinct_subsequences.rs)|Hard|

|125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)| [Rust](./string/src/solution/s0125_valid_palindrome.rs)|Easy|

|131|[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/)| [Rust](./string/src/solution/s0131_palindrome_partitioning.rs)|Medium|

|132|[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/)| [Rust](./string/src/solution/s0132_palindrome_partitioning_ii.rs)|Hard|

|151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)| [Rust](./string/src/solution/s0151_reverse_words_in_a_string.rs)|Medium|

|159|[Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/) | [Rust](./string/src/solution/s0159_longest_substring_with_at_most_two_distinct_characters.rs)|Hard|

|161|[One Edit Distance](https://leetcode.com/problems/one-edit-distance/)| [Rust](./string/src/solution/s0161_one_edit_distance.rs)|Medium|

|168|[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/) | [Rust](./string/src/solution/s0168_excel_sheet_column_title.rs)|Easy|

|171|[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/) | [Rust](./string/src/solution/s0171_excel_sheet_column_number.rs)|Easy|

|179|[Largest Number](https://leetcode.com/problems/largest-number/) | [Rust](./string/src/solution/s0179_largest_number.rs)|Medium|

|186|[Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii/) | [Rust](./string/src/solution/s0186_reverse_words_in_a_string_ii.rs)|Medium|

|187|[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)| [Rust](./string/src/solution/s0187_repeated_dna_sequences.rs)|Medium|

|205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)| [Rust](./string/src/solution/s0205_isomorphic_strings.rs)|Easy|

|208|[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/)| [Rust](./string/src/solution/s0208_implement_trie_prefix_tree.rs)|Medium|

|211|[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/)| [Rust](./string/src/solution/s0211_design_add_search_words_data_structure.rs)|Medium|

|212|[Word Search II](https://leetcode.com/problems/word-search-ii/)| [Rust](./math/src/solution/s0212_word_search_ii.rs)|Hard|

|214|[Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/)| [Rust](./string/src/solution/s0214_shortest_palindrome.rs)|Hard|

|241|[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/)|[Rust](./string/src/solution/s0241_different_ways_to_add_parentheses.rs)|Medium|

|242|[Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Rust](./string/src/solution/s0242_valid_anagram.rs)|Easy|

|246|[Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/)| [Rust](./string/src/solution/s0246_strobogrammatic_number.rs)|Easy|

|247|[Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii/)| [Rust](./string/src/solution/s0247_strobogrammatic_number_ii.rs)|Medium|

|248|[Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii/)| [Rust](./string/src/solution/s0248_strobogrammatic_number_iii.rs)|Hard|

|249|[Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/)| [Rust](./string/src/solution/s0249_group_shifted_strings.rs)|Medium|

|266|[Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation/)| [Rust](./string/src/solution/s0266_palindrome_permutation.rs)|Easy|

|267|[Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/)| [Rust](./string/src/solution/s0267_palindrome_permutation_ii.rs)|Medium|

|271|[Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/)| [Rust](./string/src/solution/s0271_encode_and_decode_strings.rs)|Medium|

|273|[Integer to English Words](https://leetcode.com/problems/integer-to-english-words/)| [Rust](./string/src/solution/s0273_integer_to_english_words.rs)|Medium|

|290|[Word Pattern](https://leetcode.com/problems/word-pattern/) | [Rust](./string/src/solution/s0290_word_pattern.rs)|Easy|

|293|[Flip Game](https://leetcode.com/problems/flip-game/) | [Rust](./string/src/solution/s0293_flip_game.rs)|Easy|

|294|[Flip Game II](https://leetcode.com/problems/flip-game-ii/) | [Rust](./string/src/solution/s0294_flip_game_ii.rs)|Medium|

|301|[Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/) | [Rust](./string/src/solution/s0301_remove_invalid_parentheses.rs) |Hard|

|316|[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/) | [Rust](./string/src/solution/s0316_remove_duplicate_letters.rs)|Hard|

|336|[Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) | [Rust](./string/src/solution/s0336_palindrome_pairs.rs)|Hard|

|340|[Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/) | [Rust](./string/src/solution/s0340_longest_substring_with_at_most_k_distinct_characters.rs)|Hard|

|344|[Reverse String](https://leetcode.com/problems/reverse-string/) | [Rust](./string/src/solution/s0344_reverse_string.rs)|Easy|

|345|[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/) | [Rust](./string/src/solution/s0345_reverse_vowels_of_a_string.rs)|Easy|

|358|[Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart/) | [Rust](./string/src/solution/s0358_rearrange_string_k_distance_apart.rs)|Hard|

|383|[Ransom Note](https://leetcode.com/problems/ransom-note/) | [Rust](./string/src/solution/s0383_ransom_note.rs)|Easy|

|387|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | [Rust](./string/src/solution/s0387_first_unique_character_in_a_string.rs)|Easy|

|392|[Is Subsequence](https://leetcode.com/problems/is-subsequence/) | [Rust](./string/src/solution/s0392_is_subsequence.rs)|Medium|

|395|[Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/) | [Rust](./string/src/solution/s0395_longest_substring_with_at_least_k_repeating_characters.rs)|Medium|

|459|[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/) | [Rust](./string/src/solution/s0459_repeated_substring_pattern.rs)|Easy|

|557|[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | [Rust](./string/src/solution/s0557_reverse_words_in_a_string_iii.rs)|Easy|

|567|[Permutation in String](https://leetcode.com/problems/permutation-in-string/) | [Rust](./string/src/solution/s0567_permutation_in_string.rs)|Medium|

|647|[Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | [Rust](./string/src/solution/s0647_palindromic_substrings.rs)|Medium|

|680|[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/) | [Rust](./string/src/solution/s0680_valid_palindrome_ii.rs)|Easy|

|796|[Rotate String](https://leetcode.com/problems/rotate-string/) | [Rust](./string/src/solution/s0796_rotate_string.rs)|Easy|

|804|[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/) | [Rust](./string/src/solution/s0804_unique_morse_code_words.rs)|Easy|

|819|[Most Common Word](https://leetcode.com/problems/most-common-word/) | [Rust](./string/src/solution/s0819_most_common_word.rs)|Easy|

|884|[Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/) | [Rust](./string/src/solution/s0884_uncommon_words_from_two_sentences.rs)|Easy|

|929|[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/) | [Rust](./string/src/solution/s0929_unique_email_addresses.rs)|Easy|

|1002|[Find Common Characters](https://leetcode.com/problems/find-common-characters/) | [Rust](./string/src/solution/s1002_find_common_characters.rs)|Easy|

|1047|[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | [Rust](./string/src/solution/s1047_remove_all_adjacent_duplicates_in_string.rs)|Easy|

|1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/) | [Rust](./string/src/solution/s1071_greatest_common_divisor_of_strings.rs)|Easy|

|1092|[Shortest Common Supersequence](https://leetcode.com/problems/shortest-common-supersequence/) | [Rust](./string/src/solution/s1092_shortest_common_supersequence)|Hard|

|1100|[Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/) | [Rust](./string/src/solution/s1100_find_k_length_substrings_with_no_repeated_characters.rs)|Medium|

|1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/) | [Rust](./string/src/solution/s1160_find_words_that_can_be_formed_by_characters.rs)|Easy|

|1347|[Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/) | [Rust](./string/src/solution/s1347_minimum_number_of_steps_to_make_two_strings_anagram.rs)|Medium|

|1528|[Shuffle String](https://leetcode.com/problems/shuffle-string/) | [Rust](./string/src/solution/s1528_shuffle_string.rs)|Easy|

|1629|[Slowest Key](https://leetcode.com/problems/slowest-key/) | [Rust](./string/src/solution/s1629_slowest_key.rs)|Easy|

|1689|[Partitioning Into Minimum Number Of Deci-Binary Numbers](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/) | [Rust](./string/src/solution/s1689_partitioning_into_minimum_number_of_deci_binary_numbers.rs)|Medium|

### Tree

| No | Title | Solution | Difficulty |

|---| ----- | -------- | ---------- |

|94|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)| [Rust](./tree/src/solution/s0094_binary_tree_inorder_traversal.rs)|Medium|

|95|[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)| [Rust](./tree/src/solution/s0095_unique_binary_search_trees_ii.rs)|Medium|

|96|[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)| [Rust](./tree/src/solution/s0096_unique_binary_search_trees.rs)|Medium|

|98|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)| [Rust](./tree/src/solution/s0098_validate_binary_search_tree.rs)|Medium|

|99|[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/)| [Rust](./tree/src/solution/s0099_recover_binary_search_tree.rs)|Hard|

|100|[Same Tree](https://leetcode.com/problems/recover-binary-search-tree/)| [Rust](./tree/src/solution/s0100_same_tree.rs)|Easy|

|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)| [Rust](./tree/src/solution/s0101_symmetric_tree.rs)|Easy|

|102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)| [Rust](./tree/src/solution/s0102_binary_tree_level_order_traversal.rs)|Easy|

|103|[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)| [Rust](./tree/src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs)|Medium|

|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)| [Rust](./tree/src/solution/s0104_maximum_depth_of_binary_tree.rs)|Easy|

|105|[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)| [Rust](./tree/src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs)|Medium|

|106|[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)| [Rust](./tree/src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs)|Medium|

|107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)| [Rust](./tree/src/solution/s0107_binary_tree_level_order_traversal_ii.rs)|Easy|

|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)| [Rust](./tree/src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs)|Medium|

|109|[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)| [Rust](./tree/src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs)|Medium|

|110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)| [Rust](./tree/src/solution/s0110_balanced_binary_tree.rs)|Easy|

|111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)| [Rust](./tree/src/solution/s0111_minimum_depth_of_binary_tree.rs)|Easy|

|112|[Path Sum](https://leetcode.com/problems/path-sum/)| [Rust](./tree/src/solution/s0112_path_sum.rs)|Easy|

|113|[Path Sum II](https://leetcode.com/problems/path-sum-ii/)| [Rust](./tree/src/solution/s0113_path_sum_ii.rs)|Medium|

|114|[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/)| [Rust](./tree/src/solution/s0114_flatten_binary_tree_to_linked_list.rs)|Medium|

|124|[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)| [Rust](./tree/src/solution/s0124_binary_tree_maximum_path_sum.rs)|Hard|

|129|[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)| [Rust](./tree/src/solution/s0129_sum_root_to_leaf_numbers.rs)|Medium|

|144|[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)| [Rust](./tree/src/solution/s0144_binary_tree_preorder_traversal.rs)|Medium|

|145|[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)| [Rust](./tree/src/solution/s0145_binary_tree_postorder_traversal.rs)|Hard|

|156|[Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/) | [Rust](./tree/src/solution/s0156_binary_tree_upside_down.rs)|Medium|

|173|[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/) | [Rust](./tree/src/solution/s0173_binary_search_tree_iterator.rs)|Medium|

|199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)| [Rust](./tree/src/solution/s0199_binary_tree_right_side_view.rs)|Medium|

|222|[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/)| [Rust](./tree/src/solution/s0222_count_complete_tree_nodes.rs)|Medium|

|226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)| [Rust](./tree/src/solution/s0226_invert_binary_tree.rs)|Easy|

|230|[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)| [Rust](./tree/src/solution/s0230_kth_smallest_element_in_a_bst.rs)|Medium|

|250|[Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees/)| [Rust](./tree/src/solution/s0250_count_univalue_subtrees.rs)|Medium|

|255|[Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/)| [Rust](./tree/src/solution/s0255_verify_preorder_sequence_in_binary_search_tree.rs)|Medium|

|257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)| [Rust](./tree/src/solution/s0257_binary_tree_paths.rs)|Easy|

|270|[Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/)| [Rust](./tree/src/solution/s0270_closest_binary_search_tree_value.rs)|Easy|

|272|[Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/)| [Rust](./tree/src/solution/s0272_closest_binary_search_tree_value_ii.rs)|Hard|

|298|[Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/)| [Rust](./tree/src/solution/s0298_binary_tree_longest_consecutive_sequence.rs)|Medium|

|314|[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/)| [Rust](./tree/src/solution/s0314_binary_tree_vertical_order_traversal.rs)|Medium|

|331|[Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/) | [Rust](./tree/src/solution/s0331_verify_preorder_serialization_of_a_binary_tree.rs)|Medium|

|333|[Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/) | [Rust](./tree/src/solution/s0333_largest_bst_subtree.rs)|Medium|

|337|[House Robber III](https://leetcode.com/problems/house-robber-iii/) | [Rust](./tree/src/solution/s0337_house_robber_iii.rs)|Medium|

|366|[Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/) | [Rust](./tree/src/solution/s0366_find_leaves_of_binary_tree.rs)|Medium|

|437|[Path Sum III](https://leetcode.com/problems/path-sum-iii/) | [Rust](./tree/src/solution/s0437_path_sum_iii.rs)|Medium|

|617|[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | [Rust](./tree/src/solution/s0617_merge_two_binary_trees.rs)|Easy|

|654|[Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/) | [Rust](./tree/src/solution/s0653_two_sum_iv_input_is_a_bst.rs)|Easy|

|1026|[Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/) | [Rust](./tree/src/solution/s1026_maximum_difference_between_node_and_ancestor.rs)|Medium|

|1145|[Binary Tree Coloring Game]() | [Rust](./tree/src/solution/s1145_binary_tree_coloring_game.rs)|Medium|

|1305|[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/) | [Rust](./tree/src/solution/s1305_all_elements_in_two_binary_search_trees.rs)|Medium|

|1373|[Maximum Sum BST in Binary Tree](https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/) | [Rust](./tree/src/solution/s1373_maximum_sum_bst_in_binary_tree.rs)|Hard|
ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Awesome

https://github.com/straylittlepunk/leetcode

Awesome Lists containing this project

README
