https://github.com/eteplus/leetcode
The solutions for Leetcode's problem
https://github.com/eteplus/leetcode
Last synced: over 1 year ago
JSON representation
The solutions for Leetcode's problem
- Host: GitHub
- URL: https://github.com/eteplus/leetcode
- Owner: eteplus
- License: mit
- Created: 2022-01-25T07:57:48.000Z (over 4 years ago)
- Default Branch: main
- Last Pushed: 2022-07-09T13:27:01.000Z (about 4 years ago)
- Last Synced: 2025-02-01T02:26:19.302Z (over 1 year ago)
- Language: Rust
- Homepage:
- Size: 433 KB
- Stars: 2
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Leetcode
The solutions for Leetcode's problem
| # | Ttitle | Solution | Diffculty |
|---| ----- | -------- | ---------- |
| 1 | [Two Sum](https://leetcode.com/problems/two-sum/) | [Rust](./rust/src/problems/s1_two_sum.rs), [TypeScript](./typescript/src/problems/s1_two_sum.ts) | Easy |
| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [Rust](./rust/src/problems/s5_longest_palindromic_substring.rs), [TypeScript](./typescript/src/problems/s5_longest_palindromic_substring.ts) | Medium |
| 9 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [Rust](./rust/src/problems/s9_palindrome_number.rs), [TypeScript](./typescript/src/problems/s9_palindrome_number.ts) | Easy |
| 11 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | [Rust](./rust/src/problems/s11_container_with_most_water.rs), [TypeScript](./typescript/src/problems/s11_container_with_most_water.ts) | Medium |
| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | [Rust](./rust/src/problems/s14_longest_common_prefix.rs), [TypeScript](./typescript/src/problems/s14_longest_common_prefix.ts) | Easy |
| 20 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [Rust](./rust/src/problems/s20_valid_parentheses.rs), [TypeScript](./typescript/src/problems/s20_valid_parentheses.ts) | Easy |
| 21 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [Rust](./rust/src/problems/s21_merge_two_sorted_lists.rs), [TypeScript](./typescript/src/problems/s21_merge_two_sorted_lists.ts) | Easy |
| 26 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [Rust](./rust/src/problems/s26_remove_duplicates_from_sorted_array.rs), [TypeScript](./typescript/src/problems/s26_remove_duplicates_from_sorted_array.ts) | Easy |
| 27 | [Remove Element](https://leetcode.com/problems/remove-element/) | [Rust](./rust/src/problems/s27_remove_element.rs), [TypeScript](./typescript/src/problems/s27_remove_element.ts) | Easy |
| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Rust](./rust/src/problems/s33_search_in_rotated_sorted_array.rs), [TypeScript](./typescript/src/problems/s33_search_in_rotated_sorted_array.ts) | Medium |
| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [Rust](./rust/src/problems/s35_search_insert_position.rs), [TypeScript](./typescript/src/problems/s35_search_insert_position.ts) | Easy |
| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [Rust](./rust/src/problems/s53_maximum_subarray.rs), [TypeScript](./typescript/src/problems/s53_maximum_subarray.ts) | Easy |
| 55 | [Jump Game](https://leetcode.com/problems/jump-game/) | [Rust](./rust/src/problems/s55_jump_game.rs), [TypeScript](./typescript/src/problems/s55_jump_game.ts) | Medium |
| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | [Rust](./rust/src/problems/s56_merge_intervals.rs), [TypeScript](./typescript/src/problems/s56_merge_intervals.ts) | Medium |
| 57 | [Insert Interval](https://leetcode.com/problems/insert-interval/) | [Rust](./rust/src/problems/s57_insert_interval.rs), [TypeScript](./typescript/src/problems/s57_insert_interval.ts) | Medium |
| 58 | [Length of Last Word](https://leetcode.com/problems/length-of-last-word/) | [Rust](./rust/src/problems/s58_length_of_last_word.rs), [TypeScript](./typescript/src/problems/s58_length_of_last_word.ts) | Easy |
| 62 | [Unique Paths](https://leetcode.com/problems/unique-paths/) | [Rust](./rust/src/problems/s62_unique_paths.rs), [TypeScript](./typescript/src/problems/s62_unique_paths.ts) | Medium |
| 66 | [Plus One](https://leetcode.com/problems/plus-one/) | [Rust](./rust/src/problems/s66_plus_one.rs), [TypeScript](./typescript/src/problems/s66_plus_one.ts) | Easy |
| 70 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | [Rust](./rust/src/problems/s70_climbing_stairs.rs), [TypeScript](./typescript/src/problems/s70_climbing_stairs.ts) | Easy |
| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | [Rust](./rust/src/problems/s83_remove_duplicates_from_sorted_list.rs), [TypeScript](./typescript/src/problems/s83_remove_duplicates_from_sorted_list.ts) | Easy |
| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | [Rust](./rust/src/problems/s88_merge_sorted_array.rs), [TypeScript](./typescript/src/problems/s88_merge_sorted_array.ts) | Easy |
| 90 | [Subsets II](https://leetcode.com/problems/subsets-ii/) | [Rust](./rust/src/problems/s90_subsets_ii.rs), [TypeScript](./typescript/src/problems/s90_subsets_ii.ts) | Medium |
| 91 | [Decode Ways](https://leetcode.com/problems/decode-ways/) | [Rust](./rust/src/problems/s91_decode_ways.rs), [TypeScript](./typescript/src/problems/s91_decode_ways.ts) | Medium |
| 92 | [Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/) | [Rust](./rust/src/problems/s92_reverse_linked_list_ii.rs), [TypeScript](./typescript/src/problems/s92_reverse_linked_list_ii.ts) | Medium |
| 94 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/reverse-linked-list-ii/) | [Rust](./rust/src/problems/s94_binary_tree_inorder_traversal.rs), [TypeScript](./typescript/src/problems/s94_binary_tree_inorder_traversal.ts) | Easy |
| 98 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | [Rust](./rust/src/problems/s98_validate_binary_search_tree.rs), [TypeScript](./typescript/src/problems/s98_validate_binary_search_tree.ts) | Medium |
| 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | [Rust](./rust/src/problems/s100_same_tree.rs), [TypeScript](./typescript/src/problems/s100_same_tree.ts) | Easy |
| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [Rust](./rust/src/problems/s102_binary_tree_level_order_traversal.rs), [TypeScript](./typescript/src/problems/s102_binary_tree_level_order_traversal.ts) | Medium |
| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/binary-tree-inorder-traversal/) | [Rust](./rust/src/problems/s104_maximum_depth_of_binary_tree.rs), [TypeScript](./typescript/src/problems/s104_maximum_depth_of_binary_tree.ts) | Easy |
| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [Rust](./rust/src/problems/s105_construct_binary_tree_from_preorder_and_inorder_traversal.rs), [TypeScript](./typescript/src/problems/s105_construct_binary_tree_from_preorder_and_inorder_traversal.ts) | Medium |
| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [Rust](./rust/src/problems/s121_best_time_to_buy_and_sell_stock.rs), [TypeScript](./typescript/src/problems/s121_best_time_to_buy_and_sell_stock.ts) | Easy |
| 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | [Rust](./rust/src/problems/s125_valid_palindrome.rs), [TypeScript](./typescript/src/problems/s125_valid_palindrome.ts) | Easy |
| 136 | [Single Number](https://leetcode.com/problems/single-number/) | [Rust](./rust/src/problems/s36_single_number.rs), [TypeScript](./typescript/src/problems/s36_single_number.ts) | Easy |
| 139 | [Word Break](https://leetcode.com/problems/word-break/) | [Rust](./rust/src/problems/s139_word_break.rs), [TypeScript](./typescript/src/problems/s139_word_break.ts) | Medium |
| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | [TypeScript](./typescript/src/problems/s141_linked_list_cycle.ts) | Easy |
| 143 | [Reorder List](https://leetcode.com/problems/reorder-list/) | [Rust](./rust/src/problems/s143_reorder_list.rs), [TypeScript](./typescript/src/problems/s143_reorder_list.ts) | Medium |
| 144 | [Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) | [Rust](./rust/src/problems/s144_binary_tree_preorder_traversal.rs), [TypeScript](./typescript/src/problems/s144_binary_tree_preorder_traversal.ts) | Easy |
| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | [Rust](./rust/src/problems/s152_maximum_product_subarray.rs), [TypeScript](./typescript/src/problems/s152_maximum_product_subarray.ts) | Medium |
| 153 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [Rust](./rust/src/problems/s153_find_minimum_in_rotated_sorted_array.rs), [TypeScript](./typescript/src/problems/s153_find_minimum_in_rotated_sorted_array.ts) | Medium |
| 167 | [Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | [Rust](./rust/src/problems/s167_two_sum_ii_input_array_is_sorted.rs), [TypeScript](./typescript/src/problems/s167_two_sum_ii_input_array_is_sorted.ts) | Medium |
| 169 | [Majority Element](https://leetcode.com/problems/majority-element/) | [Rust](./rust/src/problems/s169_majority_element.rs), [TypeScript](./typescript/src/problems/s169_majority_element.ts) | Easy |
| 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/) | [Rust](./rust/src/problems/s190_reverse_bits.rs), [TypeScript](./typescript/src/problems/s190_reverse_bits.ts) | Easy |
| 191 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [Rust](./rust/src/problems/s191_number_of_1_bits.rs), [TypeScript](./typescript/src/problems/s191_number_of_1_bits.ts) | Easy |
| 198 | [House Robber](https://leetcode.com/problems/house-robber/) | [Rust](./rust/src/problems/s198_house_robber.rs), [TypeScript](./typescript/src/problems/s198_house_robber.ts) | Medium |
| 205 | [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) | [Rust](./rust/src/problems/s205_isomorphic_strings.rs), [TypeScript](./typescript/src/problems/s205_isomorphic_strings.ts) | Easy |
| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [Rust](./rust/src/problems/s206_reverse_linked_list.rs), [TypeScript](./typescript/src/problems/s206_reverse_linked_list.ts) | Easy |
| 213 | [House Robber II](https://leetcode.com/problems/house-robber-ii/) | [Rust](./rust/src/problems/s213_house_robber_ii.rs), [TypeScript](./typescript/src/problems/s213_house_robber_ii.ts) | Medium |
| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [Rust](./rust/src/problems/s217_contains_duplicate.rs), [TypeScript](./typescript/src/problems/s217_contains_duplicate.ts) | Easy |
| 219 | [Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | [Rust](./rust/src/problems/s219_contains_duplicate_ii.rs), [TypeScript](./typescript/src/problems/s219_contains_duplicate_ii.ts) | Easy |
| 220 | [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/) | [Rust](./rust/src/problems/s220_contains_duplicate_iii.rs), [TypeScript](./typescript/src/problems/s220_contains_duplicate_iii.ts) | Medium |
| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [Rust](./rust/src/problems/s226_invert_binary_tree.rs), [TypeScript](./typescript/src/problems/s226_invert_binary_tree.ts) | Easy |
| 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii/) | [Rust](./rust/src/problems/s229_majority_element_ii.rs), [TypeScript](./typescript/src/problems/s229_majority_element_ii.ts) | Easy |
| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | [Rust](./rust/src/problems/s230_kth_smallest_element_in_a_bst.rs), [TypeScript](./typescript/src/problems/s230_kth_smallest_element_in_a_bst.ts) | Medium |
| 235 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [Rust](./rust/src/problems/s235_lowest_common_ancestor_of_a_binary_search_tree.rs), [TypeScript](./typescript/src/problems/s235_lowest_common_ancestor_of_a_binary_search_tree.ts) | Easy |
| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | [Rust](./rust/src/problems/s238_product_of_array_except_self.rs), [TypeScript](./typescript/src/problems/s238_product_of_array_except_self.ts) | Medium |
| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [Rust](./rust/src/problems/s242_valid_anagram.rs), [TypeScript](./typescript/src/problems/s242_valid_anagram.ts) | Easy |
| 257 | [Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/) | [Rust](./rust/src/problems/s257_binary_tree_paths.rs), [TypeScript](./typescript/src/problems/s257_binary_tree_paths.ts) | Easy |
| 268 | [Missing Number](https://leetcode.com/problems/missing-number/) | [Rust](./rust/src/problems/s268_missing_number.rs), [TypeScript](./typescript/src/problems/s268_missing_number.ts) | Easy |
| 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | [Rust](./rust/src/problems/s300_longest_increasing_subsequence.rs), [TypeScript](./typescript/src/problems/s300_longest_increasing_subsequence.ts) | Medium |
| 322 | [Coin Change](https://leetcode.com/problems/coin-change/) | [Rust](./rust/src/problems/s322_coin_change.rs), [TypeScript](./typescript/src/problems/s322_coin_change.ts) | Medium |
| 344 | [Reverse String](https://leetcode.com/problems/reverse-string/) | [Rust](./rust/src/problems/s344_reverse_string.rs), [TypeScript](./typescript/src/problems/s344_reverse_string.ts) | Easy |
| 338 | [Counting Bits](https://leetcode.com/problems/counting-bits/) | [Rust](./rust/src/problems/s338_counting_bits.rs), [TypeScript](./typescript/src/problems/s338_counting_bits.ts) | Easy |
| 349 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | [Rust](./rust/src/problems/s349_intersection_of_two_arrays.rs), [TypeScript](./typescript/src/problems/s349_intersection_of_two_arrays.ts) | Easy |
| 350 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | [Rust](./rust/src/problems/s350_intersection_of_two_arrays_ii.rs), [TypeScript](./typescript/src/problems/s350_intersection_of_two_arrays_ii.ts) | Easy |
| 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | [Rust](./rust/src/problems/s371_sum_of_two_integers.rs), [TypeScript](./typescript/src/problems/s371_sum_of_two_integers.ts) | Medium |
| 377 | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/) | [Rust](./rust/src/problems/s377_combination_sum_iv.rs), [TypeScript](./typescript/src/problems/s377_combination_sum_iv.ts) | Medium |
| 435 | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) | [Rust](./rust/src/problems/s435_non_overlapping_intervals.rs), [TypeScript](./typescript/src/problems/s435_non_overlapping_intervals.ts) | Medium |
| 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/) | [Rust](./rust/src/problems/s448_find_all_numbers_disappeared_in_an_array.rs), [TypeScript](./typescript/src/problems/s448_find_all_numbers_disappeared_in_an_array.ts) | Easy |
| 455 | [Assign Cookies](https://leetcode.com/problems/assign-cookies/) | [Rust](./rust/src/problems/s455_assign_cookies.rs), [TypeScript](./typescript/src/problems/s455_assign_cookies.ts) | Easy |
| 541 | [Reverse String II](https://leetcode.com/problems/reverse-string-ii/) | [Rust](./rust/src/problems/s541_reverse_string_ii.rs), [TypeScript](./typescript/src/problems/s541_reverse_string_ii.ts) | Easy |
| 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | [Rust](./rust/src/problems/s543_diameter_of_binary_tree.rs), [TypeScript](./typescript/src/problems/s543_diameter_of_binary_tree.ts) | Easy |
| 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | [Rust](./rust/src/problems/s557_reverse_words_in_a_string_iii.rs), [TypeScript](./typescript/src/problems/s557_reverse_words_in_a_string_iii.ts) | Easy |
| 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i/) | [Rust](./rust/src/problems/s561_array_partition_i.rs), [TypeScript](./typescript/src/problems/s561_array_partition_i.ts) | Easy |
| 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) | [Rust](./rust/src/problems/s572_subtree_of_another_tree.rs), [TypeScript](./typescript/src/problems/s572_subtree_of_another_tree.ts) | Easy |
| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers/) | [Rust](./rust/src/problems/s605_can_place_flowers.rs), [TypeScript](./typescript/src/problems/s605_can_place_flowers.ts) | Easy |
| 647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | [Rust](./rust/src/problems/s647_palindromic_substrings.rs), [TypeScript](./typescript/src/problems/s647_palindromic_substrings.ts) | Medium |
| 670 | [Maximum Swap](https://leetcode.com/problems/maximum-swap/) | [Rust](./rust/src/problems/s670_maximum_swap.rs), [TypeScript](./typescript/src/problems/s670_maximum_swap.ts) | Medium |
| 680 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/) | [Rust](./rust/src/problems/s680_valid_palindrome_ii.rs), [TypeScript](./typescript/src/problems/s680_valid_palindrome_ii.ts) | Easy |
| 692 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | [Rust](./rust/src/problems/s692_top_k_frequent_words.rs), [TypeScript](./typescript/src/problems/s692_top_k_frequent_words.ts) | Medium |
| 704 | [Binary Search](https://leetcode.com/problems/binary-search/) | [Rust](./rust/src/problems/s704_binary_search.rs), [TypeScript](./typescript/src/problems/s704_binary_search.ts) | Easy |
| 781 | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/) | [Rust](./rust/src/problems/s781_rabbits_in_forest.rs), [TypeScript](./typescript/src/problems/s781_rabbits_in_forest.ts) | Medium |
| 844 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/) | [Rust](./rust/src/problems/s844_backspace_string_compare.rs), [TypeScript](./typescript/src/problems/s844_backspace_string_compare.ts) | Easy |
| 852 | [Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/) | [Rust](./rust/src/problems/s852_peak_index_in_a_mountain_array.rs), [TypeScript](./typescript/src/problems/s852_peak_index_in_a_mountain_array.ts) | Easy |
| 917 | [Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/) | [Rust](./rust/src/problems/s917_reverse_only_letters.rs), [TypeScript](./typescript/src/problems/s917_reverse_only_letters.ts) | Easy |
| 977 | [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | [Rust](./rust/src/problems/s977_squares_of_a_sorted_array.rs), [TypeScript](./typescript/src/problems/s977_squares_of_a_sorted_array.ts) | Easy |
| 1013 | [Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/) | [Rust](./rust/src/problems/s1013_partition_array_into_three_parts_with_equal_sum.rs), [TypeScript](./typescript/src/problems/s1013_partition_array_into_three_parts_with_equal_sum.ts) | Easy |
| 1122 | [Relative Sort Array](https://leetcode.com/problems/relative-sort-array/) | [Rust](./rust/src/problems/s1122_relative_sort_array.rs), [TypeScript](./typescript/src/problems/s1122_relative_sort_array.ts) | Easy |
| 1143 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | [Rust](./rust/src/problems/s1143_longest_common_subsequence.rs), [TypeScript](./typescript/src/problems/s1143_longest_common_subsequence.ts) | Medium |
| 1189 | [Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/) | [Rust](./rust/src/problems/s1189_maximum_number_of_balloons.rs), [TypeScript](./typescript/src/problems/s1189_maximum_number_of_balloons.ts) | Easy |
| 1200 | [Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/) | [Rust](./rust/src/problems/s1200_minimum_absolute_difference.rs), [TypeScript](./typescript/src/problems/s1200_minimum_absolute_difference.ts) | Easy |
| 1394 | [Find Lucky Integer in an Array](https://leetcode.com/problems/find-lucky-integer-in-an-array/) | [Rust](./rust/src/problems/s1394_find_lucky_integer_in_an_array.rs), [TypeScript](./typescript/src/problems/s1394_find_lucky_integer_in_an_array.ts) | Easy |
| 1450 | [Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/) | [Rust](./rust/src/problems/s1450_number_of_students_doing_homework_at_a_given_time.rs), [TypeScript](./typescript/src/problems/s1450_number_of_students_doing_homework_at_a_given_time.ts) | Easy |
| 1588 | [Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/) | [Rust](./rust/src/problems/s1588_sum_of_all_odd_length_subarrays.rs), [TypeScript](./typescript/src/problems/s1588_sum_of_all_odd_length_subarrays.ts) | Easy |
| 1629 | [Slowest Key](https://leetcode.com/problems/slowest-key/) | [Rust](./rust/src/problems/s1629_slowest_key.rs), [TypeScript](./typescript/src/problems/s1629_slowest_key.ts) | Easy |
| 1636 | [Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/) | [Rust](./rust/src/problems/s1636_sort_array_by_increasing_frequency.rs), [TypeScript](./typescript/src/problems/s1636_sort_array_by_increasing_frequency.ts) | Easy |
| 1700 | [Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/) | [Rust](./rust/src/problems/s1700_number_of_students_unable_to_eat_lunch.rs), [TypeScript](./typescript/src/problems/s1700_number_of_students_unable_to_eat_lunch.ts) | Easy |
| 1800 | [Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/) | [Rust](./rust/src/problems/s1800_maximum_ascending_subarray_sum.rs), [TypeScript](./typescript/src/problems/s1800_maximum_ascending_subarray_sum.ts) | Easy |
| 1909 | [Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/) | [Rust](./rust/src/problems/s1909_remove_one_element_to_make_the_array_strictly_increasing.rs), [TypeScript](./typescript/src/problems/s1909_remove_one_element_to_make_the_array_strictly_increasing.ts) | Easy |
| 1921 | [Eliminate Maximum Number of Monsters](https://leetcode.com/problems/eliminate-maximum-number-of-monsters/) | [Rust](./rust/src/problems/s1921_eliminate_maximum_number_of_monsters.rs), [TypeScript](./typescript/src/problems/s1921_eliminate_maximum_number_of_monsters.ts) | Medium |
| 1984 | [Minimum Difference Between Highest and Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/) | [Rust](./rust/src/problems/s1984_minimum_difference_between_highest_and_lowest_of_k_scores.rs), [TypeScript](./typescript/src/problems/s1984_minimum_difference_between_highest_and_lowest_of_k_scores.ts) | Easy |
| 2016 | [Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/) | [Rust](./rust/src/problems/s2016_maximum_difference_between_increasing_elements.rs), [TypeScript](./typescript/src/problems/s2016_maximum_difference_between_increasing_elements.ts) | Easy |
| 2022 | [Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/) | [Rust](./rust/src/problems/s2022_convert_1d_array_into_2d_array.rs), [TypeScript](./typescript/src/problems/s2022_convert_1d_array_into_2d_array.ts) | Easy |
| 2037 | [Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/) | [Rust](./rust/src/problems/s2037_minimum_number_of_moves_to_seat_everyone.rs), [TypeScript](./typescript/src/problems/s2037_minimum_number_of_moves_to_seat_everyone.ts) | Easy |
| 2144 | [Minimum Cost of Buying Candies With Discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/) | [Rust](./rust/src/problems/s2144_minimum_cost_of_buying_candies_with_discount.rs), [TypeScript](./typescript/src/problems/s2144_minimum_cost_of_buying_candies_with_discount.ts) | Easy |
| 2150 | [Find All Lonely Numbers in the Array](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/) | [Rust](./rust/src/problems/s2150_find_all_lonely_numbers_in_the_array.rs), [TypeScript](./typescript/src/problems/s2150_find_all_lonely_numbers_in_the_array.ts) | Medium |
| 2190 | [Most Frequent Number Following Key In an Array](https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/) | [Rust](./rust/src/problems/s2190_most_frequent_number_following_key_in_an_array.rs), [TypeScript](./typescript/src/problems/s2190_most_frequent_number_following_key_in_an_array.ts) | Medium |
| 2206 | [Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs/) | [Rust](./rust/src/problems/s2206_divide_array_into_equal_pairs.rs), [TypeScript](./typescript/src/problems/s2206_divide_array_into_equal_pairs.ts) | Easy |