{"docsConfig":{"theme":"mint","$schema":"https://www.mintlify.com/docs.json","name":"leetcode-py","description":"Modern Python LeetCode practice environment with automated problem generation, beautiful data structure visualizations, and comprehensive testing","colors":{"primary":"#3776AB","light":"#5A94C4","dark":"#387EB8"},"logo":{"light":"https://mintcdn.com/leetcode-py/aJKJ4BOUnXP-zM3G/img/brand/leetcode-py-lockup.svg?fit=max\u0026auto=format\u0026n=aJKJ4BOUnXP-zM3G\u0026q=85\u0026s=34c74a404ed256642a54345a92489c97","dark":"https://mintcdn.com/leetcode-py/aJKJ4BOUnXP-zM3G/img/brand/leetcode-py-lockup-dark.svg?fit=max\u0026auto=format\u0026n=aJKJ4BOUnXP-zM3G\u0026q=85\u0026s=263c5757fbf5e547de96291651e279e9"},"favicon":"https://mintcdn.com/leetcode-py/VCrzlUI648LnF7Pk/favicon.svg?fit=max\u0026auto=format\u0026n=VCrzlUI648LnF7Pk\u0026q=85\u0026s=3b1dffe162e80798a504a810fcbeba45","background":{"color":{"light":"#F8F9FB","dark":"#0D1117"}},"navbar":{"links":[{"href":"https://github.com/wislertt/leetcode-py","label":"GitHub"}]},"footer":{"socials":{"github":"https://github.com/wislertt/leetcode-py"},"links":[{"header":"Resources","items":[{"label":"PyPI","href":"https://pypi.org/project/leetcode-py-sdk"},{"label":"Why leetcode-py","href":"/getting-started/why-leetcode-py"},{"label":"Made by Wisaroot Lertthaweedech","href":"https://wisl.dev"}]}]},"seo":{"metatags":{"canonical":"https://leetcode-py.wisl.dev","og:image":"https://leetcode-py.wisl.dev/img/brand/og-card-light.png","twitter:card":"summary_large_image"},"organization":{"url":"https://leetcode-py.wisl.dev","sameAs":["https://github.com/wislertt/leetcode-py","https://pypi.org/project/leetcode-py-sdk/","https://wisl.dev"]},"indexing":"all"},"styling":{"codeblocks":{"theme":{"light":"github-light","dark":"github-dark"}},"latex":true},"metadata":{"timestamp":true},"markdown":{"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."]},"navigation":{"pages":[]}},"deployment":{"deploymentMetadataValue":{"subdomain":"leetcode-py","hasAudioNarration":false,"actualSubdomain":"leetcode-py","customDomains":["leetcode-py.wisl.dev"],"gitSource":{"type":"github","owner":"wislertt","repo":"leetcode-py","deployBranch":"main","contentDirectory":"docs","isPrivate":true,"mountPath":"","label":""},"entitlements":{},"buildId":"6aeadd835fa1f5f231996c95","clientVersion":"0.0.4094","searchFilterCounts":[{"language":"default","tag":"Catalog","count":13},{"language":"default","tag":"Practice","count":5},{"language":"default","tag":"Troubleshooting","count":5},{"language":"default","tag":"Getting Started","count":3},{"language":"default","tag":"CLI","count":2},{"language":"default","tag":"Contributing","count":2},{"language":"default","tag":"Welcome","count":1}]},"assistantConfig":{"enableAskAiButton":false,"enableStarterQuestions":false,"enableContextualStarterQuestions":false,"enableAskAiSearchBar":true},"basePath":"","hasChatPermissions":false,"hasWebMcpPermissions":false,"toggles":[{"name":"kill-isr","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"custom-rbac-roles","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"agent-mintlify-slack","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"agent-integrations-settings","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"rbac-expansion","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"automations-pr-grouping","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"custom-prefix","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"analytics-v7","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"user-flows-analytics","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"no-publish-flow","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"workos-onboarding","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"llms-txt-v2","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"snapshot-serving-live","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"stripTemperatureMiddleware","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"support-platform-pylon-zendesk","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"snapshot-serving","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"instant-rollback","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"granular-notifications-server","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"granular-notifications","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"automations-fable","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"fixed-ai-action-pricing","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"automation-resolve-merge-conflict","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"scoped-publishing","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"mintql","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"page-level-analytics","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"editor-version-history-v2","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"billing-page-v2","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"full-page-search","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"workspace-projects","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"assistant-v5","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"fork-pr-previews","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"revalidation-jwt","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"workos-sso-scim","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"hobby-abuse-scan","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"dashboard-inbox","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"workos-signup","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"turbopuffer-dual-write","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"workos-enabled","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"approve-review-flow","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"editor-metadata","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"sso-setup-deadline-banner","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"turbopuffer-serve","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"live-agents","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false},{"name":"comment-mode","enabled":true,"variant":{"name":"disabled","enabled":false,"feature_enabled":true},"impressionData":false}],"googleFontsInlined":false},"customCss":[{"filePath":"custom.css","content":".sd-catalog-table th:first-child,.sd-catalog-table td:first-child{min-width:0;width:3rem}html.dark .sd-hero-light{display:none}html:not(.dark) .sd-hero-dark{display:none}.sd-badges{display:flex;flex-wrap:wrap;gap:8px;align-items:center;justify-content:flex-start;margin:0 0 16px;padding:0}.sd-badges a,.sd-badges a:hover,.sd-badges a:visited{display:inline-flex;flex:0 0 auto;line-height:0;height:auto!important;max-height:24px;padding:0!important;margin:0!important;text-decoration:none!important;border-bottom:none!important;background:none!important;background-image:none!important}.sd-badges img{height:20px;width:auto;max-width:none;display:block;margin:0!important}.sd-preview{border:1px solid #387eb8;border-radius:10px}"}],"page":{"pagePath":"catalog/hard-2","slug":"/catalog/hard-2","pageMetadata":{"title":"Hard LeetCode Problems in Python, Part 2","sidebarTitle":"Hard (201-276)","description":"All 276 Hard LeetCode problems with tested Python solutions. Part 2 of 2: problems 201-276.","href":"/catalog/hard-2"},"description":{"compiledSource":"\"use strict\";\nconst {jsx: _jsx} = arguments[0];\nconst {useMDXComponents: _provideComponents} = arguments[0];\nfunction _createMdxContent(props) {\n const _components = {\n p: \"p\",\n ..._provideComponents(),\n ...props.components\n };\n return _jsx(_components.p, {\n children: \"All 276 Hard LeetCode problems with tested Python solutions. Part 2 of 2: problems 201-276.\"\n });\n}\nfunction MDXContent(props = {}) {\n const {wrapper: MDXLayout} = {\n ..._provideComponents(),\n ...props.components\n };\n return MDXLayout ? _jsx(MDXLayout, {\n ...props,\n children: _jsx(_createMdxContent, {\n ...props\n })\n }) : _createMdxContent(props);\n}\nreturn {\n default: MDXContent\n};\n","frontmatter":{},"scope":{}},"pageType":"default","mdx":{"mdxSource":{"compiledSource":"\"use strict\";const{Fragment:_Fragment,jsx:_jsx,jsxs:_jsxs}=arguments[0];const{useMDXComponents:_provideComponents}=arguments[0];function _createMdxContent(props){const _components={a:`a`,p:`p`,tbody:`tbody`,td:`td`,th:`th`,thead:`thead`,tr:`tr`,..._provideComponents(),...props.components},{Table}=_components;if(!Table)_missingMdxReference(`Table`,true);return _jsxs(_Fragment,{children:[_jsx(_components.p,{children:`Hard holds 276 problems.`}),`\n`,_jsx(`div`,{className:`sd-catalog-table`,children:_jsxs(Table,{children:[_jsx(_components.thead,{children:_jsxs(_components.tr,{children:[_jsx(_components.th,{children:`#`}),_jsx(_components.th,{children:`Problem`}),_jsx(_components.th,{children:`Difficulty`}),_jsx(_components.th,{children:`Solution`})]})}),_jsxs(_components.tbody,{children:[_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`996`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/number-of-squareful-arrays`,children:`Number of Squareful Arrays`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_squareful_arrays/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1000`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-cost-to-merge-stones`,children:`Minimum Cost to Merge Stones`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_cost_to_merge_stones/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1001`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/grid-illumination`,children:`Grid Illumination`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/grid_illumination/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1028`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/recover-a-tree-from-preorder-traversal`,children:`Recover a Tree From Preorder Traversal`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/recover_a_tree_from_preorder_traversal/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1074`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/number-of-submatrices-that-sum-to-target`,children:`Number of Submatrices That Sum to Target`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_submatrices_that_sum_to_target/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1088`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/confusing-number-ii`,children:`Confusing Number II`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/confusing_number_ii/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1092`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/shortest-common-supersequence`,children:`Shortest Common Supersequence`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/shortest_common_supersequence/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1095`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/find-in-mountain-array`,children:`Find in Mountain Array`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_in_mountain_array/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1106`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/parsing-a-boolean-expression`,children:`Parsing A Boolean Expression`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/parsing_a_boolean_expression/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1121`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/divide-array-into-increasing-sequences`,children:`Divide Array Into Increasing Sequences`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/divide_array_into_increasing_sequences/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1168`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/optimize-water-distribution-in-a-village`,children:`Optimize Water Distribution in a Village`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/optimize_water_distribution_in_a_village/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1183`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/maximum-number-of-ones`,children:`Maximum Number of Ones`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_number_of_ones/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1216`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/valid-palindrome-iii`,children:`Valid Palindrome III`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/valid_palindrome_iii/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1220`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/count-vowels-permutation`,children:`Count Vowels Permutation`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_vowels_permutation/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1231`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/divide-chocolate`,children:`Divide Chocolate`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/divide_chocolate/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1235`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/maximum-profit-in-job-scheduling`,children:`Maximum Profit in Job Scheduling`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_profit_in_job_scheduling/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1246`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/palindrome-removal`,children:`Palindrome Removal`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/palindrome_removal/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1255`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/maximum-score-words-formed-by-letters`,children:`Maximum Score Words Formed by Letters`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_score_words_formed_by_letters/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1259`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/handshakes-that-dont-cross`,children:`Handshakes That Don’t Cross`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/handshakes_that_dont_cross/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1269`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps`,children:`Number of Ways to Stay in the Same Place After Some Steps`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_ways_to_stay_in_the_same_place_after_some_steps/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1274`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/number-of-ships-in-a-rectangle`,children:`Number of Ships in a Rectangle`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_ships_in_a_rectangle/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1289`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-falling-path-sum-ii`,children:`Minimum Falling Path Sum II`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_falling_path_sum_ii/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1335`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-difficulty-of-a-job-schedule`,children:`Minimum Difficulty of a Job Schedule`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_difficulty_of_a_job_schedule/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1359`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/count-all-valid-pickup-and-delivery-options`,children:`Count All Valid Pickup and Delivery Options`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_all_valid_pickup_and_delivery_options/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1383`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/maximum-performance-of-a-team`,children:`Maximum Performance of a Team`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_performance_of_a_team/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1406`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/stone-game-iii`,children:`Stone Game III`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/stone_game_iii/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1425`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/constrained-subsequence-sum`,children:`Constrained Subsequence Sum`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/constrained_subsequence_sum/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1463`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/cherry-pickup-ii`,children:`Cherry Pickup II`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/cherry_pickup_ii/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1489`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree`,children:`Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1526`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array`,children:`Minimum Number of Increments on Subarrays to Form a Target Array`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_increments_on_subarrays_to_form_a_target_array/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1531`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/string-compression-ii`,children:`String Compression II`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/string_compression_ii/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1547`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-cost-to-cut-a-stick`,children:`Minimum Cost to Cut a Stick`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_cost_to_cut_a_stick/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1553`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-number-of-days-to-eat-n-oranges`,children:`Minimum Number of Days to Eat N Oranges`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_days_to_eat_n_oranges/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1568`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-number-of-days-to-disconnect-island`,children:`Minimum Number of Days to Disconnect Island`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_days_to_disconnect_island/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1579`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable`,children:`Remove Max Number of Edges to Keep Graph Fully Traversable`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/remove_max_number_of_edges_to_keep_graph_fully_traversable/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1611`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-one-bit-operations-to-make-integers-zero`,children:`Minimum One Bit Operations to Make Integers Zero`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_one_bit_operations_to_make_integers_zero/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1639`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/number-of-ways-to-form-a-target-string-given-a-dictionary`,children:`Number of Ways to Form a Target String Given a Dictionary`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_ways_to_form_a_target_string_given_a_dictionary/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1671`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-number-of-removals-to-make-mountain-array`,children:`Minimum Number of Removals to Make Mountain Array`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_removals_to_make_mountain_array/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1675`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimize-deviation-in-array`,children:`Minimize Deviation in Array`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimize_deviation_in_array/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1793`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/maximum-score-of-a-good-subarray`,children:`Maximum Score of a Good Subarray`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_score_of_a_good_subarray/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1799`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/maximize-score-after-n-operations`,children:`Maximize Score After N Operations`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximize_score_after_n_operations/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1851`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-interval-to-include-each-query`,children:`Minimum Interval to Include Each Query`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_interval_to_include_each_query/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1857`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/largest-color-value-in-a-directed-graph`,children:`Largest Color Value in a Directed Graph`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/largest_color_value_in_a_directed_graph/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1866`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/rearrange-sticks`,children:`Number of Ways to Rearrange Sticks With K Sticks Visible`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/rearrange_sticks/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1944`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/number-of-visible-people-in-a-queue`,children:`Number of Visible People in a Queue`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_visible_people_in_a_queue/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`1964`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/find-the-longest-valid-obstacle-course-at-each-position`,children:`Find the Longest Valid Obstacle Course at Each Position`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_longest_valid_obstacle_course_at_each_position/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2009`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-number-of-operations-to-make-array-continuous`,children:`Minimum Number of Operations to Make Array Continuous`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_number_of_operations_to_make_array_continuous/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2040`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/kth-smallest-product-of-two-sorted-arrays`,children:`Kth Smallest Product of Two Sorted Arrays`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/kth_smallest_product_of_two_sorted_arrays/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2045`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/second-minimum-time-to-reach-destination`,children:`Second Minimum Time to Reach Destination`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/second_minimum_time_to_reach_destination/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2050`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/parallel-courses-iii`,children:`Parallel Courses III`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/parallel_courses_iii/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2092`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/find-all-people-with-secret`,children:`Find All People With Secret`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_all_people_with_secret/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2127`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/maximum-employees-to-be-invited-to-a-meeting`,children:`Maximum Employees to Be Invited to a Meeting`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_employees_to_be_invited_to_a_meeting/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2147`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/number-of-ways-to-divide-a-long-corridor`,children:`Number of Ways to Divide a Long Corridor`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_ways_to_divide_a_long_corridor/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2218`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/maximum-value-of-k-coins-from-piles`,children:`Maximum Value of K Coins From Piles`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_value_of_k_coins_from_piles/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2251`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/number-of-flowers-in-full-bloom`,children:`Number of Flowers in Full Bloom`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_flowers_in_full_bloom/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2290`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-obstacle-removal-to-reach-corner`,children:`Minimum Obstacle Removal to Reach Corner`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_obstacle_removal_to_reach_corner/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2306`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/naming-a-company`,children:`Naming a Company`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/naming_a_company/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2392`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/build-a-matrix-with-conditions`,children:`Build a Matrix With Conditions`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/build_a_matrix_with_conditions/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2402`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/meeting-rooms-iii`,children:`Meeting Rooms III`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/meeting_rooms_iii/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2416`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/sum-of-prefix-scores-of-strings`,children:`Sum of Prefix Scores of Strings`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/sum_of_prefix_scores_of_strings/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2421`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/number-of-good-paths`,children:`Number of Good Paths`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/number_of_good_paths/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2493`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/divide-nodes-into-the-maximum-number-of-groups`,children:`Divide Nodes Into the Maximum Number of Groups`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/divide_nodes_into_the_maximum_number_of_groups/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2503`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/maximum-number-of-points-from-grid-queries`,children:`Maximum Number of Points From Grid Queries`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_number_of_points_from_grid_queries/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2534`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/time-taken-to-cross-the-door`,children:`Time Taken to Cross the Door`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/time_taken_to_cross_the_door/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2551`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/put-marbles-in-bags`,children:`Put Marbles in Bags`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/put_marbles_in_bags/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2577`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-time-to-visit-a-cell-in-a-grid`,children:`Minimum Time to Visit a Cell In a Grid`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_time_to_visit_a_cell_in_a_grid/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2709`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/greatest-common-divisor-traversal`,children:`Greatest Common Divisor Traversal`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/greatest_common_divisor_traversal/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2742`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/painting-the-walls`,children:`Painting the Walls`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/painting_the_walls/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2751`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/robot-collisions`,children:`Robot Collisions`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/robot_collisions/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2818`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/apply-operations-to-maximize-score`,children:`Apply Operations to Maximize Score`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/apply_operations_to_maximize_score/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2872`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/maximum-number-of-k-divisible-components`,children:`Maximum Number of K-Divisible Components`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/maximum_number_of_k_divisible_components/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`2940`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/find-building-where-alice-and-bob-can-meet`,children:`Find Building Where Alice and Bob Can Meet`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_building_where_alice_and_bob_can_meet/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`3045`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/count-prefix-and-suffix-pairs-ii`,children:`Count Prefix and Suffix Pairs II`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/count_prefix_and_suffix_pairs_ii/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`3068`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/find-the-maximum-sum-of-node-values`,children:`Find the Maximum Sum of Node Values`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_the_maximum_sum_of_node_values/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`3108`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/minimum-cost-walk-in-weighted-graph`,children:`Minimum Cost Walk in Weighted Graph`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/minimum_cost_walk_in_weighted_graph/solution.py`,children:`solution.py`})})]}),_jsxs(_components.tr,{children:[_jsx(_components.td,{\"data-numeric\":`true`,children:`3203`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`/problems/find-minimum-diameter-after-merging-two-trees`,children:`Find Minimum Diameter After Merging Two Trees`})}),_jsx(_components.td,{children:`Hard`}),_jsx(_components.td,{children:_jsx(_components.a,{href:`https://github.com/wislertt/leetcode-py/blob/main/leetcode/find_minimum_diameter_after_merging_two_trees/solution.py`,children:`solution.py`})})]})]})]})}),`\n`,_jsxs(_components.p,{children:[`Pages: `,_jsx(_components.a,{href:`/catalog/hard`,children:`1`}),`, 2`]})]})}function MDXContent(props={}){const{wrapper:MDXLayout}={..._provideComponents(),...props.components};return MDXLayout?_jsx(MDXLayout,{...props,children:_jsx(_createMdxContent,{...props})}):_createMdxContent(props)}return{default:MDXContent};function _missingMdxReference(id,component){throw new Error(`Expected `+(component?`component`:`object`)+\" `\"+id+\"` to be defined: you likely forgot to import, pass, or provide it.\")}","frontmatter":{},"scope":{"codeStyling":{"theme":{"light":"github-light","dark":"github-dark"}},"config":{},"pageMetadata":{"title":"Hard LeetCode Problems in Python, Part 2","sidebarTitle":"Hard (201-276)","description":"All 276 Hard LeetCode problems with tested Python solutions. Part 2 of 2: problems 201-276.","href":"/catalog/hard-2"}}},"mdxSourceWithNoJs":null},"mdxExtracts":{"tableOfContents":[],"codeExamples":{}},"jsLinks":[],"subdomain":"leetcode-py","siteName":"leetcode-py","title":"Hard LeetCode Problems in Python, Part 2 - leetcode-py","navMaps":{"firstHrefInVersion":{},"firstHrefInLanguage":{}},"lastModified":"2026-09-03T08:39:40.957Z","gitLastModified":"2026-09-03T08:38:22.000Z","originalFileLocation":"catalog/hard-2.mdx"},"headHtml":"\u003cscript data-mint-head>(function(){var d=document.documentElement,p=null;if(!p){try{p=localStorage.getItem(\"isDarkMode\")}catch(e){}if(p==='true')p='dark';else if(p==='false')p='light';if(p!=='light'\u0026\u0026p!=='dark'\u0026\u0026p!=='system')p=\"system\"}var r=p==='system'?(matchMedia(\"(prefers-color-scheme: dark)\").matches?'dark':'light'):p;d.classList.remove(r==='dark'?'light':'dark');d.classList.add(r);d.setAttribute(\"data-theme-preference\",p)})();\u003c/script>\u003cmeta data-mint-head name=\"description\" content=\"All 276 Hard LeetCode problems with tested Python solutions. Part 2 of 2: problems 201-276.\">\u003cmeta data-mint-head name=\"application-name\" content=\"leetcode-py\">\u003cmeta data-mint-head name=\"generator\" content=\"Mintlify\">\u003clink data-mint-head rel=\"icon\" type=\"image/png\" sizes=\"192x192\" href=\"/mintlify-assets/_mintlify/favicons/leetcode-py/MPF4VdYq1xxotsp3/_generated/favicon/android-chrome-192x192.png\" media=\"(prefers-color-scheme: light)\">\u003clink data-mint-head rel=\"apple-touch-icon\" type=\"image/png\" sizes=\"180x180\" href=\"/mintlify-assets/_mintlify/favicons/leetcode-py/MPF4VdYq1xxotsp3/_generated/favicon/apple-touch-icon.png\">\u003clink data-mint-head rel=\"icon\" type=\"image/png\" sizes=\"16x16\" href=\"/mintlify-assets/_mintlify/favicons/leetcode-py/MPF4VdYq1xxotsp3/_generated/favicon/favicon-16x16.png\" media=\"(prefers-color-scheme: light)\">\u003clink data-mint-head rel=\"icon\" type=\"image/png\" sizes=\"32x32\" href=\"/mintlify-assets/_mintlify/favicons/leetcode-py/MPF4VdYq1xxotsp3/_generated/favicon/favicon-32x32.png\" media=\"(prefers-color-scheme: light)\">\u003clink data-mint-head rel=\"shortcut icon\" type=\"image/x-icon\" href=\"/mintlify-assets/_mintlify/favicons/leetcode-py/MPF4VdYq1xxotsp3/_generated/favicon/favicon.ico\" media=\"(prefers-color-scheme: light)\">\u003clink data-mint-head rel=\"icon\" type=\"image/png\" sizes=\"192x192\" href=\"/mintlify-assets/_mintlify/favicons/leetcode-py/MPF4VdYq1xxotsp3/_generated/favicon-dark/android-chrome-192x192.png\" media=\"(prefers-color-scheme: dark)\">\u003clink data-mint-head rel=\"icon\" type=\"image/png\" sizes=\"16x16\" href=\"/mintlify-assets/_mintlify/favicons/leetcode-py/MPF4VdYq1xxotsp3/_generated/favicon-dark/favicon-16x16.png\" media=\"(prefers-color-scheme: dark)\">\u003clink data-mint-head rel=\"icon\" type=\"image/png\" sizes=\"32x32\" href=\"/mintlify-assets/_mintlify/favicons/leetcode-py/MPF4VdYq1xxotsp3/_generated/favicon-dark/favicon-32x32.png\" media=\"(prefers-color-scheme: dark)\">\u003clink data-mint-head rel=\"shortcut icon\" type=\"image/x-icon\" href=\"/mintlify-assets/_mintlify/favicons/leetcode-py/MPF4VdYq1xxotsp3/_generated/favicon-dark/favicon.ico\" media=\"(prefers-color-scheme: dark)\">\u003cmeta data-mint-head property=\"og:title\" content=\"Hard LeetCode Problems in Python, Part 2 - leetcode-py\">\u003cmeta data-mint-head property=\"og:description\" content=\"All 276 Hard LeetCode problems with tested Python solutions. Part 2 of 2: problems 201-276.\">\u003cmeta data-mint-head property=\"og:site_name\" content=\"leetcode-py\">\u003cmeta data-mint-head property=\"og:url\" content=\"https://leetcode-py.wisl.dev/catalog/hard-2\">\u003cmeta data-mint-head property=\"og:type\" content=\"website\">\u003cmeta data-mint-head property=\"og:image\" content=\"https://leetcode-py.wisl.dev/img/brand/og-card-light.png\">\u003cmeta data-mint-head property=\"og:image:width\" content=\"1200\">\u003cmeta data-mint-head property=\"og:image:height\" content=\"630\">\u003cmeta data-mint-head name=\"twitter:card\" content=\"summary_large_image\">\u003cmeta data-mint-head name=\"twitter:title\" content=\"Hard LeetCode Problems in Python, Part 2 - leetcode-py\">\u003cmeta data-mint-head name=\"twitter:description\" content=\"All 276 Hard LeetCode problems with tested Python solutions. Part 2 of 2: problems 201-276.\">\u003cmeta data-mint-head name=\"twitter:image\" content=\"https://leetcode-py.wisl.dev/img/brand/og-card-light.png\">\u003cmeta data-mint-head name=\"twitter:image:width\" content=\"1200\">\u003cmeta data-mint-head name=\"twitter:image:height\" content=\"630\">\u003cmeta data-mint-head name=\"msapplication-config\" content=\"/mintlify-assets/_mintlify/favicons/leetcode-py/MPF4VdYq1xxotsp3/_generated/favicon/browserconfig.xml\">\u003cmeta data-mint-head name=\"apple-mobile-web-app-title\" content=\"leetcode-py\">\u003cmeta data-mint-head name=\"msapplication-TileColor\" content=\"#3776AB\">\u003clink data-mint-head rel=\"canonical\" href=\"https://leetcode-py.wisl.dev/catalog/hard-2\">\u003clink data-mint-head rel=\"alternate\" type=\"application/xml\" href=\"/sitemap.xml\">\u003clink data-mint-head rel=\"alternate\" type=\"text/markdown\" href=\"/catalog/hard-2.md\">\u003cscript data-mint-head type=\"application/ld+json\">{\"@context\":\"https://schema.org\",\"@graph\":[{\"@type\":\"Organization\",\"@id\":\"https://leetcode-py.wisl.dev/#organization\",\"name\":\"leetcode-py\",\"url\":\"https://leetcode-py.wisl.dev\",\"logo\":{\"@type\":\"ImageObject\",\"url\":\"https://mintcdn.com/leetcode-py/aJKJ4BOUnXP-zM3G/img/brand/leetcode-py-lockup.svg?fit=max\u0026auto=format\u0026n=aJKJ4BOUnXP-zM3G\u0026q=85\u0026s=34c74a404ed256642a54345a92489c97\"},\"sameAs\":[\"https://github.com/wislertt/leetcode-py\",\"https://pypi.org/project/leetcode-py-sdk/\",\"https://wisl.dev\"]},{\"@type\":\"WebSite\",\"@id\":\"https://leetcode-py.wisl.dev#website\",\"name\":\"leetcode-py\",\"url\":\"https://leetcode-py.wisl.dev\",\"publisher\":{\"@id\":\"https://leetcode-py.wisl.dev/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https://leetcode-py.wisl.dev/catalog/hard-2#webpage\",\"url\":\"https://leetcode-py.wisl.dev/catalog/hard-2\",\"name\":\"Hard LeetCode Problems in Python, Part 2\",\"description\":\"All 276 Hard LeetCode problems with tested Python solutions. Part 2 of 2: problems 201-276.\",\"dateModified\":\"2026-09-03T08:38:22.000Z\",\"isPartOf\":{\"@id\":\"https://leetcode-py.wisl.dev#website\"}},{\"@type\":[\"Article\",\"TechArticle\"],\"@id\":\"https://leetcode-py.wisl.dev/catalog/hard-2#article\",\"headline\":\"Hard LeetCode Problems in Python, Part 2\",\"name\":\"Hard LeetCode Problems in Python, Part 2\",\"description\":\"All 276 Hard LeetCode problems with tested Python solutions. Part 2 of 2: problems 201-276.\",\"url\":\"https://leetcode-py.wisl.dev/catalog/hard-2\",\"mainEntityOfPage\":{\"@id\":\"https://leetcode-py.wisl.dev/catalog/hard-2#webpage\"},\"image\":\"https://leetcode-py.wisl.dev/img/brand/og-card-light.png\",\"dateModified\":\"2026-09-03T08:38:22.000Z\",\"publisher\":{\"@id\":\"https://leetcode-py.wisl.dev/#organization\"},\"isPartOf\":{\"@id\":\"https://leetcode-py.wisl.dev#website\"}}]}\u003c/script>\u003cscript data-mint-head type=\"application/ld+json\">{\"@context\":\"https://schema.org\",\"@type\":\"WebSite\",\"name\":\"leetcode-py\",\"creator\":{\"@type\":\"Organization\",\"name\":\"Mintlify\",\"url\":\"https://mintlify.com\"}}\u003c/script>","siteName":"leetcode-py","nav":{"global":null,"groups":[{"group":"Welcome","pages":[{"title":"LeetCode Practice Environments in Python","sidebarTitle":"leetcode-py","href":"/index"}]},{"group":"Getting Started","pages":[{"title":"Install the lcpy CLI via pip or uv","sidebarTitle":"Installation","href":"/getting-started/installation"},{"title":"lcpy Quickstart: First Problem in 5 Commands","sidebarTitle":"Quickstart","href":"/getting-started/quickstart"},{"title":"LeetCode Practice Environment vs a Bare Editor","sidebarTitle":"Why leetcode-py","href":"/getting-started/why-leetcode-py"}]},{"group":"Practice","pages":[{"title":"Anatomy of a problem","href":"/practice/problem-anatomy"},{"title":"Test LeetCode Solutions Locally with pytest","sidebarTitle":"Test locally","href":"/practice/test-locally"},{"title":"LeetCode Python Test Cases with pytest","sidebarTitle":"Testing","href":"/practice/testing"},{"title":"Visualizations","href":"/practice/visualizations"},{"title":"Notebooks","href":"/practice/notebooks"}]},{"group":"CLI","pages":[{"title":"lcpy CLI: Generate and List Problems","sidebarTitle":"lcpy","href":"/cli/lcpy"},{"title":"Blind 75, Grind 75, NeetCode and Others","sidebarTitle":"Collections","href":"/cli/collections"}]},{"group":"Catalog","pages":[{"title":"LeetCode Problem Catalog: All Collections","sidebarTitle":"Catalog","href":"/catalog/index"},{"title":"All LeetCode Problems in Python with Tests","sidebarTitle":"All Problems","href":"/catalog/all"},{"title":"Easy LeetCode Problems in Python with Tests","sidebarTitle":"Easy","href":"/catalog/easy"},{"title":"Medium LeetCode Problems in Python with Tests","sidebarTitle":"Medium","href":"/catalog/medium"},{"title":"Hard LeetCode Problems in Python with Tests","sidebarTitle":"Hard","href":"/catalog/hard"},{"title":"Topics","href":"/catalog/topics"},{"title":"Grind 75 in Python with Tested Solutions","sidebarTitle":"Grind 75","href":"/catalog/grind-75"},{"title":"Grind Collection in Python: Tested Solutions","sidebarTitle":"Grind","href":"/catalog/grind"},{"title":"Blind 75 in Python with Tested Solutions","sidebarTitle":"Blind 75","href":"/catalog/blind-75"},{"title":"NeetCode 150 in Python with Tested Solutions","sidebarTitle":"NeetCode 150","href":"/catalog/neetcode-150"},{"title":"NeetCode 250 in Python with Tested Solutions","sidebarTitle":"NeetCode 250","href":"/catalog/neetcode-250"},{"title":"NeetCode All in Python with Tested Solutions","sidebarTitle":"NeetCode All","href":"/catalog/neetcode"},{"title":"AlgoMaster 75 in Python with Tested Solutions","sidebarTitle":"AlgoMaster 75","href":"/catalog/algo-master-75"}]},{"group":"Contributing","pages":[{"title":"Add a New LeetCode Problem End to End","sidebarTitle":"Problem creation","href":"/contributing/problem-creation"},{"title":"Contributor Reference: bakefile Tasks","sidebarTitle":"bakefile","href":"/contributing/bakefile"}]},{"group":"Troubleshooting","pages":[{"title":"lcpy Errors and Troubleshooting","sidebarTitle":"Troubleshooting","href":"/troubleshooting/index"},{"title":"lcpy gen Error: Problem Not Found","sidebarTitle":"Problem not found","href":"/troubleshooting/unknown-problem"},{"title":"lcpy gen Error: Problem Already Exists","sidebarTitle":"Already exists","href":"/troubleshooting/files-already-exist"},{"title":"Visualizations Show ASCII Instead of Diagrams","sidebarTitle":"ASCII diagrams","href":"/troubleshooting/graphviz-missing"},{"title":"Playground Notebook Cells Do Not Render","sidebarTitle":"Notebook cells","href":"/troubleshooting/notebook-cells"}]}]},"basePath":"","title":"Hard LeetCode Problems in Python, Part 2 - leetcode-py","buildId":"dpl_42LwxxU1kGN114H4XzwGYXa9ZDah","deploymentId":"dpl_42LwxxU1kGN114H4XzwGYXa9ZDah","dynamics":[],"chunks":[]}