> ## Documentation Index
> Fetch the complete documentation index at: https://leetcode-py.wisl.dev/llms.txt
> Use this file to discover all available pages before exploring further.

> ## Agent Instructions
> leetcode-py is a Python LeetCode practice environment generator with one CLI: lcpy. It is not a service or platform.
> Each problem is a directory under leetcode/ with README.md, solution.py, test_solution.py, helpers.py, and playground.ipynb. lcpy gen creates them from JSON templates bundled with the package.
> Examples are backed by tests; copy them verbatim.

# Easy LeetCode Problems in Python, Part 2

> All 309 Easy LeetCode problems with tested Python solutions. Part 2 of 2: problems 201-309.

Easy holds 309 problems.

<div className="sd-catalog-table">
  | # | Problem | Difficulty | Solution |
  | - | - | - | - |
  | 938 | [Range Sum of BST](/problems/range-sum-of-bst) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/range_sum_of_bst/solution.py) |
  | 941 | [Valid Mountain Array](/problems/valid-mountain-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_mountain_array/solution.py) |
  | 942 | [DI String Match](/problems/di-string-match) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/di_string_match/solution.py) |
  | 944 | [Delete Columns to Make Sorted](/problems/delete-columns-to-make-sorted) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/delete_columns_to_make_sorted/solution.py) |
  | 953 | [Verifying an Alien Dictionary](/problems/verifying-an-alien-dictionary) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/verifying_an_alien_dictionary/solution.py) |
  | 961 | [N-Repeated Element in Size 2N Array](/problems/n-repeated-element-in-size-2n-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/n_repeated_element_in_size_2n_array/solution.py) |
  | 965 | [Univalued Binary Tree](/problems/univalued-binary-tree) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/univalued_binary_tree/solution.py) |
  | 976 | [Largest Perimeter Triangle](/problems/largest-perimeter-triangle) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_perimeter_triangle/solution.py) |
  | 977 | [Squares of a Sorted Array](/problems/squares-of-a-sorted-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/squares_of_a_sorted_array/solution.py) |
  | 989 | [Add to Array-Form of Integer](/problems/add-to-array-form-of-integer) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/add_to_array_form_of_integer/solution.py) |
  | 993 | [Cousins in Binary Tree](/problems/cousins-in-binary-tree) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/cousins_in_binary_tree/solution.py) |
  | 997 | [Find the Town Judge](/problems/find-the-town-judge) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_town_judge/solution.py) |
  | 999 | [Available Captures for Rook](/problems/available-captures-for-rook) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/available_captures_for_rook/solution.py) |
  | 1002 | [Find Common Characters](/problems/find-common-characters) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_common_characters/solution.py) |
  | 1046 | [Last Stone Weight](/problems/last-stone-weight) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/last_stone_weight/solution.py) |
  | 1051 | [Height Checker](/problems/height-checker) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/height_checker/solution.py) |
  | 1056 | [Confusing Number](/problems/confusing-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/confusing_number/solution.py) |
  | 1071 | [Greatest Common Divisor of Strings](/problems/gcd-of-strings) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/gcd_of_strings/solution.py) |
  | 1086 | [High Five](/problems/high-five) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/high_five/solution.py) |
  | 1099 | [Two Sum Less Than K](/problems/two-sum-less-than-k) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/two_sum_less_than_k/solution.py) |
  | 1122 | [Relative Sort Array](/problems/relative-sort-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/relative_sort_array/solution.py) |
  | 1133 | [Largest Unique Number](/problems/largest-unique-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_unique_number/solution.py) |
  | 1134 | [Armstrong Number](/problems/armstrong-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/armstrong_number/solution.py) |
  | 1137 | [N-th Tribonacci Number](/problems/n-th-tribonacci-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/n_th_tribonacci_number/solution.py) |
  | 1150 | [Check If a Number Is Majority Element in a Sorted Array](/problems/check-if-a-number-is-majority-element-in-a-sorted-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/check_if_a_number_is_majority_element_in_a_sorted_array/solution.py) |
  | 1160 | [Find Words That Can Be Formed by Characters](/problems/find-words-that-can-be-formed-by-characters) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_words_that_can_be_formed_by_characters/solution.py) |
  | 1165 | [Single-Row Keyboard](/problems/single-row-keyboard) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/single_row_keyboard/solution.py) |
  | 1167 | [Minimum Cost to Connect Sticks](/problems/minimum-cost-to-connect-sticks) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_cost_to_connect_sticks/solution.py) |
  | 1180 | [Count Substrings with Only One Distinct Letter](/problems/count-substrings-with-only-one-distinct-letter) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_substrings_with_only_one_distinct_letter/solution.py) |
  | 1189 | [Maximum Number of Balloons](/problems/maximum-number-of-balloons) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_number_of_balloons/solution.py) |
  | 1196 | [How Many Apples Can You Put into the Basket](/problems/how-many-apples-can-you-put-into-the-basket) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/how_many_apples_can_you_put_into_the_basket/solution.py) |
  | 1228 | [Missing Number In Arithmetic Progression](/problems/missing-number-in-arithmetic-progression) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/missing_number_in_arithmetic_progression/solution.py) |
  | 1243 | [Array Transformation](/problems/array-transformation) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/array_transformation/solution.py) |
  | 1260 | [Shift 2D Grid](/problems/shift-2d-grid) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shift_2d_grid/solution.py) |
  | 1279 | [Traffic Light Controlled Intersection](/problems/traffic-light-controlled-intersection) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/traffic_light_controlled_intersection/solution.py) |
  | 1299 | [Replace Elements with Greatest Element on Right Side](/problems/replace-elements-with-greatest-element-on-right-side) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/replace_elements_with_greatest_element_on_right_side/solution.py) |
  | 1380 | [Lucky Numbers in a Matrix](/problems/lucky-numbers-in-a-matrix) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/lucky_numbers_in_a_matrix/solution.py) |
  | 1394 | [Find Lucky Integer in an Array](/problems/find-lucky-integer-in-an-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_lucky_integer_in_an_array/solution.py) |
  | 1408 | [String Matching in an Array](/problems/string-matching-in-an-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/string_matching_in_an_array/solution.py) |
  | 1422 | [Maximum Score After Splitting a String](/problems/maximum-score-after-splitting-a-string) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_score_after_splitting_a_string/solution.py) |
  | 1426 | [Counting Elements](/problems/counting-elements) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/counting_elements/solution.py) |
  | 1427 | [Perform String Shifts](/problems/perform-string-shifts) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/perform_string_shifts/solution.py) |
  | 1436 | [Destination City](/problems/destination-city) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/destination_city/solution.py) |
  | 1460 | [Make Two Arrays Equal by Reversing Subarrays](/problems/make-two-arrays-equal-by-reversing-subarrays) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/make_two_arrays_equal_by_reversing_subarrays/solution.py) |
  | 1470 | [Shuffle the Array](/problems/shuffle-the-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/shuffle_the_array/solution.py) |
  | 1474 | [Delete N Nodes After M Nodes of a Linked List](/problems/delete-n-nodes-after-m-nodes-of-a-linked-list) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/delete_n_nodes_after_m_nodes_of_a_linked_list/solution.py) |
  | 1475 | [Final Prices With a Special Discount in a Shop](/problems/final-prices-with-a-special-discount-in-a-shop) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/final_prices_with_a_special_discount_in_a_shop/solution.py) |
  | 1496 | [Path Crossing](/problems/path-crossing) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/path_crossing/solution.py) |
  | 1512 | [Number of Good Pairs](/problems/number-of-good-pairs) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_good_pairs/solution.py) |
  | 1518 | [Water Bottles](/problems/water-bottles) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/water_bottles/solution.py) |
  | 1523 | [Count Odd Numbers in an Interval Range](/problems/count-odd-numbers-in-an-interval-range) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_odd_numbers_in_an_interval_range/solution.py) |
  | 1544 | [Make The String Great](/problems/make-the-string-great) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/make_the_string_great/solution.py) |
  | 1572 | [Matrix Diagonal Sum](/problems/matrix-diagonal-sum) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/matrix_diagonal_sum/solution.py) |
  | 1598 | [Crawler Log Folder](/problems/crawler-log-folder) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/crawler_log_folder/solution.py) |
  | 1603 | [Design Parking System](/problems/design-parking-system) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_parking_system/solution.py) |
  | 1608 | [Special Array With X Elements Greater Than or Equal X](/problems/special-array-with-x-elements-greater-than-or-equal-x) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/special_array_with_x_elements_greater_than_or_equal_x/solution.py) |
  | 1614 | [Maximum Nesting Depth of the Parentheses](/problems/maximum-nesting-depth-of-the-parentheses) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_nesting_depth_of_the_parentheses/solution.py) |
  | 1624 | [Largest Substring Between Two Equal Characters](/problems/largest-substring-between-two-equal-characters) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_substring_between_two_equal_characters/solution.py) |
  | 1636 | [Sort Array by Increasing Frequency](/problems/sort-array-by-increasing-frequency) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sort_array_by_increasing_frequency/solution.py) |
  | 1637 | [Widest Vertical Area Between Two Points Containing No Points](/problems/widest-vertical-area-between-two-points-containing-no-points) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/widest_vertical_area_between_two_points_containing_no_points/solution.py) |
  | 1652 | [Defuse the Bomb](/problems/defuse-the-bomb) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/defuse_the_bomb/solution.py) |
  | 1662 | [Check If Two String Arrays are Equivalent](/problems/array-strings-are-equal) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/array_strings_are_equal/solution.py) |
  | 1684 | [Count the Number of Consistent Strings](/problems/count-the-number-of-consistent-strings) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_the_number_of_consistent_strings/solution.py) |
  | 1688 | [Count of Matches in Tournament](/problems/count-of-matches-in-tournament) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_of_matches_in_tournament/solution.py) |
  | 1700 | [Number of Students Unable to Eat Lunch](/problems/number-of-students-unable-to-eat-lunch) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_students_unable_to_eat_lunch/solution.py) |
  | 1716 | [Calculate Money in Leetcode Bank](/problems/calculate-money-in-leetcode-bank) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/calculate_money_in_leetcode_bank/solution.py) |
  | 1752 | [Check if Array Is Sorted and Rotated](/problems/check-if-array-is-sorted-and-rotated) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/check_if_array_is_sorted_and_rotated/solution.py) |
  | 1758 | [Minimum Changes To Make Alternating Binary String](/problems/minimum-changes-to-make-alternating-binary-string) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_changes_to_make_alternating_binary_string/solution.py) |
  | 1768 | [Merge Strings Alternately](/problems/merge-strings-alternately) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/merge_strings_alternately/solution.py) |
  | 1790 | [Check if One String Swap Can Make Strings Equal](/problems/check-if-one-string-swap-can-make-strings-equal) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/check_if_one_string_swap_can_make_strings_equal/solution.py) |
  | 1800 | [Maximum Ascending Subarray Sum](/problems/maximum-ascending-subarray-sum) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_ascending_subarray_sum/solution.py) |
  | 1822 | [Sign of the Product of an Array](/problems/sign-of-the-product-of-an-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sign_of_the_product_of_an_array/solution.py) |
  | 1863 | [Sum of All Subset XOR Totals](/problems/sum-of-all-subset-xor-totals) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sum_of_all_subset_xor_totals/solution.py) |
  | 1897 | [Redistribute Characters to Make All Strings Equal](/problems/redistribute-characters-to-make-all-strings-equal) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/redistribute_characters_to_make_all_strings_equal/solution.py) |
  | 1903 | [Largest Odd Number in String](/problems/largest-odd-number-in-string) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_odd_number_in_string/solution.py) |
  | 1913 | [Maximum Product Difference Between Two Pairs](/problems/maximum-product-difference-between-two-pairs) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_product_difference_between_two_pairs/solution.py) |
  | 1929 | [Concatenation of Array](/problems/concatenation-of-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/concatenation_of_array/solution.py) |
  | 1984 | [Minimum Difference Between Highest and Lowest of K Scores](/problems/minimum-difference-between-highest-and-lowest-of-k-scores) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_difference_between_highest_and_lowest_of_k_scores/solution.py) |
  | 2022 | [Convert 1D Array Into 2D Array](/problems/convert-1d-array-into-2d-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/convert_1d_array_into_2d_array/solution.py) |
  | 2037 | [Minimum Number of Moves to Seat Everyone](/problems/minimum-number-of-moves-to-seat-everyone) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_moves_to_seat_everyone/solution.py) |
  | 2053 | [Kth Distinct String in an Array](/problems/kth-distinct-string-in-an-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/kth_distinct_string_in_an_array/solution.py) |
  | 2073 | [Time Needed to Buy Tickets](/problems/time-needed-to-buy-tickets) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/time_needed_to_buy_tickets/solution.py) |
  | 2108 | [Find First Palindromic String in the Array](/problems/find-first-palindromic-string-in-the-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_first_palindromic_string_in_the_array/solution.py) |
  | 2185 | [Counting Words With a Given Prefix](/problems/counting-words-with-a-given-prefix) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/counting_words_with_a_given_prefix/solution.py) |
  | 2206 | [Divide Array Into Equal Pairs](/problems/divide-array-into-equal-pairs) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/divide_array_into_equal_pairs/solution.py) |
  | 2215 | [Find the Difference of Two Arrays](/problems/find-the-difference-of-two-arrays) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_difference_of_two_arrays/solution.py) |
  | 2220 | [Minimum Bit Flips to Convert Number](/problems/minimum-bit-flips-to-convert-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_bit_flips_to_convert_number/solution.py) |
  | 2264 | [Largest 3-Same-Digit Number in String](/problems/largest-3-same-digit-number-in-string) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_3_same_digit_number_in_string/solution.py) |
  | 2331 | [Evaluate Boolean Binary Tree](/problems/evaluate-boolean-binary-tree) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/evaluate_boolean_binary_tree/solution.py) |
  | 2373 | [Largest Local Values in a Matrix](/problems/largest-local-values-in-a-matrix) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_local_values_in_a_matrix/solution.py) |
  | 2379 | [Minimum Recolors to Get K Consecutive Black Blocks](/problems/minimum-recolors-to-get-k-consecutive-black-blocks) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_recolors_to_get_k_consecutive_black_blocks/solution.py) |
  | 2418 | [Sort the People](/problems/sort-the-people) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/sort_the_people/solution.py) |
  | 2460 | [Apply Operations to an Array](/problems/apply-operations-to-an-array) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/apply_operations_to_an_array/solution.py) |
  | 2490 | [Circular Sentence](/problems/circular-sentence) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/circular_sentence/solution.py) |
  | 2558 | [Take Gifts From the Richest Pile](/problems/take-gifts-from-the-richest-pile) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/take_gifts_from_the_richest_pile/solution.py) |
  | 2570 | [Merge Two 2D Arrays by Summing Values](/problems/merge-two-2d-arrays-by-summing-values) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/merge_two_2d_arrays_by_summing_values/solution.py) |
  | 2678 | [Number of Senior Citizens](/problems/number-of-senior-citizens) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_senior_citizens/solution.py) |
  | 2696 | [Minimum String Length After Removing Substrings](/problems/minimum-string-length-after-removing-substrings) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_string_length_after_removing_substrings/solution.py) |
  | 2706 | [Buy Two Chocolates](/problems/buy-two-chocolates) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/buy_two_chocolates/solution.py) |
  | 2864 | [Maximum Odd Binary Number](/problems/maximum-odd-binary-number) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_odd_binary_number/solution.py) |
  | 2965 | [Find Missing and Repeated Values](/problems/find-missing-and-repeated-values) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_missing_and_repeated_values/solution.py) |
  | 3042 | [Count Prefix and Suffix Pairs I](/problems/count-prefix-and-suffix-pairs-i) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_prefix_and_suffix_pairs_i/solution.py) |
  | 3105 | [Longest Strictly Increasing or Strictly Decreasing Subarray](/problems/longest-monotonic-subarray) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/longest_monotonic_subarray/solution.py) |
  | 3110 | [Score of a String](/problems/score-of-a-string) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/score_of_a_string/solution.py) |
  | 3151 | [Special Array I](/problems/special-array-i) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/special_array_i/solution.py) |
  | 3174 | [Clear Digits](/problems/clear-digits) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/clear_digits/solution.py) |
  | 3199 | [Count Triplets with Even XOR Set Bits I](/problems/count-triplets-with-even-xor-set-bits-i) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_triplets_with_even_xor_set_bits_i/solution.py) |
  | 3264 | [Final Array State After K Multiplication Operations I](/problems/final-array-state-after-k-multiplication-operations-i) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/final_array_state_after_k_multiplication_operations_i/solution.py) |
  | 3442 | [Maximum Difference Between Even and Odd Frequency I](/problems/maximum-difference-between-even-and-odd-frequency-i) | Easy | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_difference_between_even_and_odd_frequency_i/solution.py) |
</div>

Pages: [1](/catalog/easy), 2


This documentation is built and hosted on [Mintlify](https://mintlify.com), a developer documentation platform.