> ## 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.

# All LeetCode Problems in Python, Part 8

> Every LeetCode problem in the catalog with difficulty, collections, and tested Python solutions. Part 8 of 8: problems 1401-1405.

Every problem shipped in this repository: 1405 problems (309 Easy, 820 Medium, 276 Hard).

| # | Problem | Difficulty | Solution |
| - | - | - | - |
| 3434 | [Maximum Frequency After Subarray Operation](https://leetcode-py.wisl.dev/problems/maximum-frequency-after-subarray-operation) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_frequency_after_subarray_operation/solution.py) |
| 3442 | [Maximum Difference Between Even and Odd Frequency I](https://leetcode-py.wisl.dev/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) |
| 3481 | [Apply Substitutions](https://leetcode-py.wisl.dev/problems/apply-substitutions) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/apply_substitutions/solution.py) |
| 3572 | [Maximize Y-Sum by Picking a Triplet of Distinct X-Values](https://leetcode-py.wisl.dev/problems/maximize-ysum-by-picking-a-triplet-of-distinct-xvalues) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximize_ysum_by_picking_a_triplet_of_distinct_xvalues/solution.py) |
| 3711 | [Maximum Transactions Without Negative Balance](https://leetcode-py.wisl.dev/problems/maximum-transactions-without-negative-balance) | Medium | [solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_transactions_without_negative_balance/solution.py) |

Pages: [1](https://leetcode-py.wisl.dev/catalog/all.md), [2](https://leetcode-py.wisl.dev/catalog/all-2), [3](https://leetcode-py.wisl.dev/catalog/all-3), [4](https://leetcode-py.wisl.dev/catalog/all-4), [5](https://leetcode-py.wisl.dev/catalog/all-5), [6](https://leetcode-py.wisl.dev/catalog/all-6), [7](https://leetcode-py.wisl.dev/catalog/all-7), 8


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