René's URL Explorer Experiment


Title: GitHub - dsankov/leetcode

Open Graph Title: GitHub - dsankov/leetcode

X Title: GitHub - dsankov/leetcode

Description: Contribute to dsankov/leetcode development by creating an account on GitHub.

Open Graph Description: Contribute to dsankov/leetcode development by creating an account on GitHub.

X Description: Contribute to dsankov/leetcode development by creating an account on GitHub.

Opengraph URL: https://github.com/dsankov/leetcode

X: @github

direct link

Domain: patch-diff.githubusercontent.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:ad642fb8-162e-9e0c-f4e8-44b40d7e639a
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id9D94:1C9D2:3F2E676:52DDF67:6992E0AF
html-safe-nonceb9da0de27b9c9b1d514bbc123fa50fbcc0deeee012344cc6aaae941e48225f83
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI5RDk0OjFDOUQyOjNGMkU2NzY6NTJEREY2Nzo2OTkyRTBBRiIsInZpc2l0b3JfaWQiOiI2MzcyNjE1ODI1NTEwMjkzNjc5IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmac1e7670824ad9151c59bd9338cc788f6acfa4f7b302da0b38e5a9386da60da51a
hovercard-subject-tagrepository:658231410
github-keyboard-shortcutsrepository,copilot
google-site-verificationApib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-urlhttps://collector.github.com/github/collect
analytics-location//
fb:app_id1401488693436528
apple-itunes-appapp-id=1477376905, app-argument=https://github.com/dsankov/leetcode
twitter:imagehttps://opengraph.githubassets.com/a00ea625d33411a424867a6936e6ac1fca00dc66d68d165b0a33a6614c5a4f78/dsankov/leetcode
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/a00ea625d33411a424867a6936e6ac1fca00dc66d68d165b0a33a6614c5a4f78/dsankov/leetcode
og:image:altContribute to dsankov/leetcode development by creating an account on GitHub.
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None42c603b9d642c4a9065a51770f75e5e27132fef0e858607f5c9cb7e422831a7b
turbo-cache-controlno-preview
go-importgithub.com/dsankov/leetcode git https://github.com/dsankov/leetcode.git
octolytics-dimension-user_id71551209
octolytics-dimension-user_logindsankov
octolytics-dimension-repository_id658231410
octolytics-dimension-repository_nwodsankov/leetcode
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forkfalse
octolytics-dimension-repository_network_root_id658231410
octolytics-dimension-repository_network_root_nwodsankov/leetcode
turbo-body-classeslogged-out env-production page-responsive
disable-turbofalse
browser-stats-urlhttps://api.github.com/_private/browser/stats
browser-errors-urlhttps://api.github.com/_private/browser/errors
release84dcb133269e3cfe6e0296cc85fbacb92cae92bb
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://patch-diff.githubusercontent.com/dsankov/leetcode#start-of-content
https://patch-diff.githubusercontent.com/
Sign in https://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2Fdsankov%2Fleetcode
GitHub CopilotWrite better code with AIhttps://github.com/features/copilot
GitHub SparkBuild and deploy intelligent appshttps://github.com/features/spark
GitHub ModelsManage and compare promptshttps://github.com/features/models
MCP RegistryNewIntegrate external toolshttps://github.com/mcp
ActionsAutomate any workflowhttps://github.com/features/actions
CodespacesInstant dev environmentshttps://github.com/features/codespaces
IssuesPlan and track workhttps://github.com/features/issues
Code ReviewManage code changeshttps://github.com/features/code-review
GitHub Advanced SecurityFind and fix vulnerabilitieshttps://github.com/security/advanced-security
Code securitySecure your code as you buildhttps://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they starthttps://github.com/security/advanced-security/secret-protection
Why GitHubhttps://github.com/why-github
Documentationhttps://docs.github.com
Bloghttps://github.blog
Changeloghttps://github.blog/changelog
Marketplacehttps://github.com/marketplace
View all featureshttps://github.com/features
Enterpriseshttps://github.com/enterprise
Small and medium teamshttps://github.com/team
Startupshttps://github.com/enterprise/startups
Nonprofitshttps://github.com/solutions/industry/nonprofits
App Modernizationhttps://github.com/solutions/use-case/app-modernization
DevSecOpshttps://github.com/solutions/use-case/devsecops
DevOpshttps://github.com/solutions/use-case/devops
CI/CDhttps://github.com/solutions/use-case/ci-cd
View all use caseshttps://github.com/solutions/use-case
Healthcarehttps://github.com/solutions/industry/healthcare
Financial serviceshttps://github.com/solutions/industry/financial-services
Manufacturinghttps://github.com/solutions/industry/manufacturing
Governmenthttps://github.com/solutions/industry/government
View all industrieshttps://github.com/solutions/industry
View all solutionshttps://github.com/solutions
AIhttps://github.com/resources/articles?topic=ai
Software Developmenthttps://github.com/resources/articles?topic=software-development
DevOpshttps://github.com/resources/articles?topic=devops
Securityhttps://github.com/resources/articles?topic=security
View all topicshttps://github.com/resources/articles
Customer storieshttps://github.com/customer-stories
Events & webinarshttps://github.com/resources/events
Ebooks & reportshttps://github.com/resources/whitepapers
Business insightshttps://github.com/solutions/executive-insights
GitHub Skillshttps://skills.github.com
Documentationhttps://docs.github.com
Customer supporthttps://support.github.com
Community forumhttps://github.com/orgs/community/discussions
Trust centerhttps://github.com/trust-center
Partnershttps://github.com/partners
GitHub SponsorsFund open source developershttps://github.com/sponsors
Security Labhttps://securitylab.github.com
Maintainer Communityhttps://maintainers.github.com
Acceleratorhttps://github.com/accelerator
Archive Programhttps://archiveprogram.github.com
Topicshttps://github.com/topics
Trendinghttps://github.com/trending
Collectionshttps://github.com/collections
Enterprise platformAI-powered developer platformhttps://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security featureshttps://github.com/security/advanced-security
Copilot for BusinessEnterprise-grade AI featureshttps://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 supporthttps://github.com/premium-support
Pricinghttps://github.com/pricing
Search syntax tipshttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentationhttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
Sign in https://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2Fdsankov%2Fleetcode
Sign up https://patch-diff.githubusercontent.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=dsankov%2Fleetcode
Reloadhttps://patch-diff.githubusercontent.com/dsankov/leetcode
Reloadhttps://patch-diff.githubusercontent.com/dsankov/leetcode
Reloadhttps://patch-diff.githubusercontent.com/dsankov/leetcode
dsankov https://patch-diff.githubusercontent.com/dsankov
leetcodehttps://patch-diff.githubusercontent.com/dsankov/leetcode
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2Fdsankov%2Fleetcode
Fork 0 https://patch-diff.githubusercontent.com/login?return_to=%2Fdsankov%2Fleetcode
Star 0 https://patch-diff.githubusercontent.com/login?return_to=%2Fdsankov%2Fleetcode
leetcode.com/u/dsankov/https://leetcode.com/u/dsankov/
0 stars https://patch-diff.githubusercontent.com/dsankov/leetcode/stargazers
0 forks https://patch-diff.githubusercontent.com/dsankov/leetcode/forks
Branches https://patch-diff.githubusercontent.com/dsankov/leetcode/branches
Tags https://patch-diff.githubusercontent.com/dsankov/leetcode/tags
Activity https://patch-diff.githubusercontent.com/dsankov/leetcode/activity
Star https://patch-diff.githubusercontent.com/login?return_to=%2Fdsankov%2Fleetcode
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2Fdsankov%2Fleetcode
Code https://patch-diff.githubusercontent.com/dsankov/leetcode
Issues 0 https://patch-diff.githubusercontent.com/dsankov/leetcode/issues
Pull requests 0 https://patch-diff.githubusercontent.com/dsankov/leetcode/pulls
Actions https://patch-diff.githubusercontent.com/dsankov/leetcode/actions
Projects 0 https://patch-diff.githubusercontent.com/dsankov/leetcode/projects
Security 0 https://patch-diff.githubusercontent.com/dsankov/leetcode/security
Insights https://patch-diff.githubusercontent.com/dsankov/leetcode/pulse
Code https://patch-diff.githubusercontent.com/dsankov/leetcode
Issues https://patch-diff.githubusercontent.com/dsankov/leetcode/issues
Pull requests https://patch-diff.githubusercontent.com/dsankov/leetcode/pulls
Actions https://patch-diff.githubusercontent.com/dsankov/leetcode/actions
Projects https://patch-diff.githubusercontent.com/dsankov/leetcode/projects
Security https://patch-diff.githubusercontent.com/dsankov/leetcode/security
Insights https://patch-diff.githubusercontent.com/dsankov/leetcode/pulse
Brancheshttps://patch-diff.githubusercontent.com/dsankov/leetcode/branches
Tagshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tags
https://patch-diff.githubusercontent.com/dsankov/leetcode/branches
https://patch-diff.githubusercontent.com/dsankov/leetcode/tags
1,283 Commitshttps://patch-diff.githubusercontent.com/dsankov/leetcode/commits/main/
https://patch-diff.githubusercontent.com/dsankov/leetcode/commits/main/
0001-two-sumhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0001-two-sum
0001-two-sumhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0001-two-sum
0003-longest-substring-without-repeating-charactershttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0003-longest-substring-without-repeating-characters
0003-longest-substring-without-repeating-charactershttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0003-longest-substring-without-repeating-characters
0007-reverse-integerhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0007-reverse-integer
0007-reverse-integerhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0007-reverse-integer
0008-string-to-integer-atoihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0008-string-to-integer-atoi
0008-string-to-integer-atoihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0008-string-to-integer-atoi
0009-palindrome-numberhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0009-palindrome-number
0009-palindrome-numberhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0009-palindrome-number
0014-longest-common-prefixhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0014-longest-common-prefix
0014-longest-common-prefixhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0014-longest-common-prefix
0015-3sumhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0015-3sum
0015-3sumhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0015-3sum
0017-letter-combinations-of-a-phone-numberhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0017-letter-combinations-of-a-phone-number
0017-letter-combinations-of-a-phone-numberhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0017-letter-combinations-of-a-phone-number
0020-valid-parentheseshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0020-valid-parentheses
0020-valid-parentheseshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0020-valid-parentheses
0021-merge-two-sorted-listshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0021-merge-two-sorted-lists
0021-merge-two-sorted-listshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0021-merge-two-sorted-lists
0023-merge-k-sorted-listshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0023-merge-k-sorted-lists
0023-merge-k-sorted-listshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0023-merge-k-sorted-lists
0024-swap-nodes-in-pairshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0024-swap-nodes-in-pairs
0024-swap-nodes-in-pairshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0024-swap-nodes-in-pairs
0026-remove-duplicates-from-sorted-arrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0026-remove-duplicates-from-sorted-array
0026-remove-duplicates-from-sorted-arrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0026-remove-duplicates-from-sorted-array
0028-find-the-index-of-the-first-occurrence-in-a-stringhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0028-find-the-index-of-the-first-occurrence-in-a-string
0028-find-the-index-of-the-first-occurrence-in-a-stringhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0028-find-the-index-of-the-first-occurrence-in-a-string
0033-search-in-rotated-sorted-arrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0033-search-in-rotated-sorted-array
0033-search-in-rotated-sorted-arrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0033-search-in-rotated-sorted-array
0035-search-insert-positionhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0035-search-insert-position
0035-search-insert-positionhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0035-search-insert-position
0038-count-and-sayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0038-count-and-say
0038-count-and-sayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0038-count-and-say
0039-combination-sumhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0039-combination-sum
0039-combination-sumhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0039-combination-sum
0040-combination-sum-iihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0040-combination-sum-ii
0040-combination-sum-iihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0040-combination-sum-ii
0042-trapping-rain-waterhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0042-trapping-rain-water
0042-trapping-rain-waterhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0042-trapping-rain-water
0046-permutationshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0046-permutations
0046-permutationshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0046-permutations
0053-maximum-subarrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0053-maximum-subarray
0053-maximum-subarrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0053-maximum-subarray
0054-spiral-matrixhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0054-spiral-matrix
0054-spiral-matrixhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0054-spiral-matrix
0056-merge-intervalshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0056-merge-intervals
0056-merge-intervalshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0056-merge-intervals
0058-length-of-last-wordhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0058-length-of-last-word
0058-length-of-last-wordhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0058-length-of-last-word
0062-unique-pathshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0062-unique-paths
0062-unique-pathshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0062-unique-paths
0066-plus-onehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0066-plus-one
0066-plus-onehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0066-plus-one
0067-add-binaryhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0067-add-binary
0067-add-binaryhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0067-add-binary
0070-climbing-stairshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0070-climbing-stairs
0070-climbing-stairshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0070-climbing-stairs
0075-sort-colorshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0075-sort-colors
0075-sort-colorshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0075-sort-colors
0076-minimum-window-substringhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0076-minimum-window-substring
0076-minimum-window-substringhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0076-minimum-window-substring
0078-subsetshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0078-subsets
0078-subsetshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0078-subsets
0079-word-searchhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0079-word-search
0079-word-searchhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0079-word-search
0084-largest-rectangle-in-histogramhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0084-largest-rectangle-in-histogram
0084-largest-rectangle-in-histogramhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0084-largest-rectangle-in-histogram
0085-maximal-rectanglehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0085-maximal-rectangle
0085-maximal-rectanglehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0085-maximal-rectangle
0088-merge-sorted-arrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0088-merge-sorted-array
0088-merge-sorted-arrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0088-merge-sorted-array
0096-word-searchhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0096-word-search
0096-word-searchhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0096-word-search
0098-validate-binary-search-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0098-validate-binary-search-tree
0098-validate-binary-search-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0098-validate-binary-search-tree
0100-same-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0100-same-tree
0100-same-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0100-same-tree
0101-symmetric-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0101-symmetric-tree
0101-symmetric-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0101-symmetric-tree
0102-binary-tree-level-order-traversalhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0102-binary-tree-level-order-traversal
0102-binary-tree-level-order-traversalhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0104-maximum-depth-of-binary-tree
0104-maximum-depth-of-binary-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversalhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0105-construct-binary-tree-from-preorder-and-inorder-traversal
0105-construct-binary-tree-from-preorder-and-inorder-traversalhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0105-construct-binary-tree-from-preorder-and-inorder-traversal
0110-balanced-binary-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0110-balanced-binary-tree
0110-balanced-binary-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0110-balanced-binary-tree
0121-best-time-to-buy-and-sell-stockhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0121-best-time-to-buy-and-sell-stock
0121-best-time-to-buy-and-sell-stockhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0121-best-time-to-buy-and-sell-stock
0125-valid-palindromehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0125-valid-palindrome
0125-valid-palindromehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0125-valid-palindrome
0133-clone-graphhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0133-clone-graph
0133-clone-graphhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0133-clone-graph
0139-word-breakhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0139-word-break
0139-word-breakhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0139-word-break
0141-linked-list-cyclehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0141-linked-list-cycle
0141-linked-list-cyclehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0141-linked-list-cycle
0145-binary-tree-postorder-traversalhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0145-binary-tree-postorder-traversal
0145-binary-tree-postorder-traversalhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0145-binary-tree-postorder-traversal
0146-lru-cachehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0146-lru-cache
0146-lru-cachehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0146-lru-cache
0150-evaluate-reverse-polish-notationhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0150-evaluate-reverse-polish-notation
0150-evaluate-reverse-polish-notationhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0150-evaluate-reverse-polish-notation
0155-min-stackhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0155-min-stack
0155-min-stackhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0155-min-stack
0160-intersection-of-two-linked-listshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0160-intersection-of-two-linked-lists
0160-intersection-of-two-linked-listshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0160-intersection-of-two-linked-lists
0162-find-peak-elementhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0162-find-peak-element
0162-find-peak-elementhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0162-find-peak-element
0169-majority-elementhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0169-majority-element
0169-majority-elementhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0169-majority-element
0179-largest-numberhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0179-largest-number
0179-largest-numberhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0179-largest-number
0189-rotate-arrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0189-rotate-array
0189-rotate-arrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0189-rotate-array
0198-house-robberhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0198-house-robber
0198-house-robberhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0198-house-robber
0199-binary-tree-right-side-viewhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0199-binary-tree-right-side-view
0199-binary-tree-right-side-viewhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0199-binary-tree-right-side-view
0200-number-of-islandshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0200-number-of-islands
0200-number-of-islandshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0200-number-of-islands
0206-reverse-linked-listhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0206-reverse-linked-list
0206-reverse-linked-listhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0206-reverse-linked-list
0207-course-schedulehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0207-course-schedule
0207-course-schedulehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0207-course-schedule
0208-implement-trie-prefix-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0208-implement-trie-prefix-tree
0208-implement-trie-prefix-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0208-implement-trie-prefix-tree
0209-minimum-size-subarray-sumhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0209-minimum-size-subarray-sum
0209-minimum-size-subarray-sumhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0209-minimum-size-subarray-sum
0214-shortest-palindromehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0214-shortest-palindrome
0214-shortest-palindromehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0214-shortest-palindrome
0215-kth-largest-element-in-an-arrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0215-kth-largest-element-in-an-array
0215-kth-largest-element-in-an-arrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0215-kth-largest-element-in-an-array
0216-combination-sum-iiihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0216-combination-sum-iii
0216-combination-sum-iiihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0216-combination-sum-iii
0217-contains-duplicatehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0217-contains-duplicate
0217-contains-duplicatehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0217-contains-duplicate
0218-the-skyline-problemhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0218-the-skyline-problem
0218-the-skyline-problemhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0218-the-skyline-problem
0224-basic-calculatorhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0224-basic-calculator
0224-basic-calculatorhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0224-basic-calculator
0226-invert-binary-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0226-invert-binary-tree
0226-invert-binary-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0226-invert-binary-tree
0232-implement-queue-using-stackshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0232-implement-queue-using-stacks
0232-implement-queue-using-stackshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0232-implement-queue-using-stacks
0235-lowest-common-ancestor-of-a-binary-search-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0235-lowest-common-ancestor-of-a-binary-search-tree
0235-lowest-common-ancestor-of-a-binary-search-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0236-lowest-common-ancestor-of-a-binary-tree
0236-lowest-common-ancestor-of-a-binary-treehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0236-lowest-common-ancestor-of-a-binary-tree
0241-different-ways-to-add-parentheseshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0241-different-ways-to-add-parentheses
0241-different-ways-to-add-parentheseshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0241-different-ways-to-add-parentheses
0242-valid-anagramhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0242-valid-anagram
0242-valid-anagramhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0242-valid-anagram
0260-single-number-iiihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0260-single-number-iii
0260-single-number-iiihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0260-single-number-iii
0264-ugly-number-iihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0264-ugly-number-ii
0264-ugly-number-iihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0264-ugly-number-ii
0278-first-bad-versionhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0278-first-bad-version
0278-first-bad-versionhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0278-first-bad-version
0295-find-median-from-data-streamhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0295-find-median-from-data-stream
0295-find-median-from-data-streamhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0295-find-median-from-data-stream
0310-minimum-height-treeshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0310-minimum-height-trees
0310-minimum-height-treeshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0310-minimum-height-trees
0322-coin-changehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0322-coin-change
0322-coin-changehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0322-coin-change
0330-patching-arrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0330-patching-array
0330-patching-arrayhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0330-patching-array
0344-reverse-stringhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0344-reverse-string
0344-reverse-stringhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0344-reverse-string
0350-intersection-of-two-arrays-iihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0350-intersection-of-two-arrays-ii
0350-intersection-of-two-arrays-iihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0350-intersection-of-two-arrays-ii
0367-valid-perfect-squarehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0367-valid-perfect-square
0367-valid-perfect-squarehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0367-valid-perfect-square
0368-largest-divisible-subsethttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0368-largest-divisible-subset
0368-largest-divisible-subsethttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0368-largest-divisible-subset
0373-find-k-pairs-with-smallest-sumshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0373-find-k-pairs-with-smallest-sums
0373-find-k-pairs-with-smallest-sumshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0373-find-k-pairs-with-smallest-sums
0383-ransom-notehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0383-ransom-note
0383-ransom-notehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0383-ransom-note
0386-lexicographical-numbershttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0386-lexicographical-numbers
0386-lexicographical-numbershttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0386-lexicographical-numbers
0399-evaluate-divisionhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0399-evaluate-division
0399-evaluate-divisionhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0399-evaluate-division
0407-trapping-rain-water-iihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0407-trapping-rain-water-ii
0407-trapping-rain-water-iihttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0407-trapping-rain-water-ii
0409-longest-palindromehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0409-longest-palindrome
0409-longest-palindromehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0409-longest-palindrome
0416-partition-equal-subset-sumhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0416-partition-equal-subset-sum
0416-partition-equal-subset-sumhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0416-partition-equal-subset-sum
0432-all-oone-data-structurehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0432-all-oone-data-structure
0432-all-oone-data-structurehttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0432-all-oone-data-structure
0435-non-overlapping-intervalshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0435-non-overlapping-intervals
0435-non-overlapping-intervalshttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0435-non-overlapping-intervals
0438-find-all-anagrams-in-a-stringhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0438-find-all-anagrams-in-a-string
0438-find-all-anagrams-in-a-stringhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0438-find-all-anagrams-in-a-string
0440-k-th-smallest-in-lexicographical-orderhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0440-k-th-smallest-in-lexicographical-order
0440-k-th-smallest-in-lexicographical-orderhttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0440-k-th-smallest-in-lexicographical-order
0450-delete-node-in-a-bsthttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0450-delete-node-in-a-bst
0450-delete-node-in-a-bsthttps://patch-diff.githubusercontent.com/dsankov/leetcode/tree/main/0450-delete-node-in-a-bst
READMEhttps://patch-diff.githubusercontent.com/dsankov/leetcode
https://patch-diff.githubusercontent.com/dsankov/leetcode#leetcode
LeetHubhttps://github.com/QasimWani/LeetHub
https://patch-diff.githubusercontent.com/dsankov/leetcode#math
0007-reverse-integerhttps://github.com/dsankov/leetcode/tree/master/0007-reverse-integer
0523-continuous-subarray-sumhttps://github.com/dsankov/leetcode/tree/master/0523-continuous-subarray-sum
https://patch-diff.githubusercontent.com/dsankov/leetcode#array
0330-patching-arrayhttps://github.com/dsankov/leetcode/tree/master/0330-patching-array
0502-ipohttps://github.com/dsankov/leetcode/tree/master/0502-ipo
0523-continuous-subarray-sumhttps://github.com/dsankov/leetcode/tree/master/0523-continuous-subarray-sum
0853-most-profit-assigning-workhttps://github.com/dsankov/leetcode/tree/master/0853-most-profit-assigning-work
0876-hand-of-straightshttps://github.com/dsankov/leetcode/tree/master/0876-hand-of-straights
0982-minimum-increment-to-make-array-uniquehttps://github.com/dsankov/leetcode/tree/master/0982-minimum-increment-to-make-array-unique
1044-find-common-charactershttps://github.com/dsankov/leetcode/tree/master/1044-find-common-characters
1138-grumpy-bookstore-ownerhttps://github.com/dsankov/leetcode/tree/master/1138-grumpy-bookstore-owner
1217-relative-sort-arrayhttps://github.com/dsankov/leetcode/tree/master/1217-relative-sort-array
1605-minimum-number-of-days-to-make-m-bouquetshttps://github.com/dsankov/leetcode/tree/master/1605-minimum-number-of-days-to-make-m-bouquets
1730-special-array-with-x-elements-greater-than-or-equal-xhttps://github.com/dsankov/leetcode/tree/master/1730-special-array-with-x-elements-greater-than-or-equal-x
https://patch-diff.githubusercontent.com/dsankov/leetcode#hash-table
0017-letter-combinations-of-a-phone-numberhttps://github.com/dsankov/leetcode/tree/master/0017-letter-combinations-of-a-phone-number
0523-continuous-subarray-sumhttps://github.com/dsankov/leetcode/tree/master/0523-continuous-subarray-sum
0876-hand-of-straightshttps://github.com/dsankov/leetcode/tree/master/0876-hand-of-straights
1044-find-common-charactershttps://github.com/dsankov/leetcode/tree/master/1044-find-common-characters
1217-relative-sort-arrayhttps://github.com/dsankov/leetcode/tree/master/1217-relative-sort-array
https://patch-diff.githubusercontent.com/dsankov/leetcode#string
0017-letter-combinations-of-a-phone-numberhttps://github.com/dsankov/leetcode/tree/master/0017-letter-combinations-of-a-phone-number
1044-find-common-charactershttps://github.com/dsankov/leetcode/tree/master/1044-find-common-characters
1321-get-equal-substrings-within-budgethttps://github.com/dsankov/leetcode/tree/master/1321-get-equal-substrings-within-budget
https://patch-diff.githubusercontent.com/dsankov/leetcode#greedy
0330-patching-arrayhttps://github.com/dsankov/leetcode/tree/master/0330-patching-array
0502-ipohttps://github.com/dsankov/leetcode/tree/master/0502-ipo
0853-most-profit-assigning-workhttps://github.com/dsankov/leetcode/tree/master/0853-most-profit-assigning-work
0876-hand-of-straightshttps://github.com/dsankov/leetcode/tree/master/0876-hand-of-straights
0982-minimum-increment-to-make-array-uniquehttps://github.com/dsankov/leetcode/tree/master/0982-minimum-increment-to-make-array-unique
https://patch-diff.githubusercontent.com/dsankov/leetcode#sorting
0502-ipohttps://github.com/dsankov/leetcode/tree/master/0502-ipo
0853-most-profit-assigning-workhttps://github.com/dsankov/leetcode/tree/master/0853-most-profit-assigning-work
0876-hand-of-straightshttps://github.com/dsankov/leetcode/tree/master/0876-hand-of-straights
0982-minimum-increment-to-make-array-uniquehttps://github.com/dsankov/leetcode/tree/master/0982-minimum-increment-to-make-array-unique
1217-relative-sort-arrayhttps://github.com/dsankov/leetcode/tree/master/1217-relative-sort-array
1730-special-array-with-x-elements-greater-than-or-equal-xhttps://github.com/dsankov/leetcode/tree/master/1730-special-array-with-x-elements-greater-than-or-equal-x
https://patch-diff.githubusercontent.com/dsankov/leetcode#prefix-sum
0523-continuous-subarray-sumhttps://github.com/dsankov/leetcode/tree/master/0523-continuous-subarray-sum
1321-get-equal-substrings-within-budgethttps://github.com/dsankov/leetcode/tree/master/1321-get-equal-substrings-within-budget
https://patch-diff.githubusercontent.com/dsankov/leetcode#binary-search
0853-most-profit-assigning-workhttps://github.com/dsankov/leetcode/tree/master/0853-most-profit-assigning-work
1321-get-equal-substrings-within-budgethttps://github.com/dsankov/leetcode/tree/master/1321-get-equal-substrings-within-budget
1605-minimum-number-of-days-to-make-m-bouquetshttps://github.com/dsankov/leetcode/tree/master/1605-minimum-number-of-days-to-make-m-bouquets
1730-special-array-with-x-elements-greater-than-or-equal-xhttps://github.com/dsankov/leetcode/tree/master/1730-special-array-with-x-elements-greater-than-or-equal-x
https://patch-diff.githubusercontent.com/dsankov/leetcode#sliding-window
1138-grumpy-bookstore-ownerhttps://github.com/dsankov/leetcode/tree/master/1138-grumpy-bookstore-owner
1321-get-equal-substrings-within-budgethttps://github.com/dsankov/leetcode/tree/master/1321-get-equal-substrings-within-budget
https://patch-diff.githubusercontent.com/dsankov/leetcode#counting-sort
0982-minimum-increment-to-make-array-uniquehttps://github.com/dsankov/leetcode/tree/master/0982-minimum-increment-to-make-array-unique
1217-relative-sort-arrayhttps://github.com/dsankov/leetcode/tree/master/1217-relative-sort-array
https://patch-diff.githubusercontent.com/dsankov/leetcode#linked-list
0024-swap-nodes-in-pairshttps://github.com/dsankov/leetcode/tree/master/0024-swap-nodes-in-pairs
https://patch-diff.githubusercontent.com/dsankov/leetcode#recursion
0024-swap-nodes-in-pairshttps://github.com/dsankov/leetcode/tree/master/0024-swap-nodes-in-pairs
https://patch-diff.githubusercontent.com/dsankov/leetcode#heap-priority-queue
0502-ipohttps://github.com/dsankov/leetcode/tree/master/0502-ipo
https://patch-diff.githubusercontent.com/dsankov/leetcode#two-pointers
0853-most-profit-assigning-workhttps://github.com/dsankov/leetcode/tree/master/0853-most-profit-assigning-work
https://patch-diff.githubusercontent.com/dsankov/leetcode#backtracking
0017-letter-combinations-of-a-phone-numberhttps://github.com/dsankov/leetcode/tree/master/0017-letter-combinations-of-a-phone-number
https://patch-diff.githubusercontent.com/dsankov/leetcode#tree
1114-binary-search-tree-to-greater-sum-treehttps://github.com/dsankov/leetcode/tree/master/1114-binary-search-tree-to-greater-sum-tree
https://patch-diff.githubusercontent.com/dsankov/leetcode#depth-first-search
1114-binary-search-tree-to-greater-sum-treehttps://github.com/dsankov/leetcode/tree/master/1114-binary-search-tree-to-greater-sum-tree
https://patch-diff.githubusercontent.com/dsankov/leetcode#binary-search-tree
1114-binary-search-tree-to-greater-sum-treehttps://github.com/dsankov/leetcode/tree/master/1114-binary-search-tree-to-greater-sum-tree
https://patch-diff.githubusercontent.com/dsankov/leetcode#binary-tree
1114-binary-search-tree-to-greater-sum-treehttps://github.com/dsankov/leetcode/tree/master/1114-binary-search-tree-to-greater-sum-tree
https://patch-diff.githubusercontent.com/dsankov/leetcode#leetcode-topics
https://patch-diff.githubusercontent.com/dsankov/leetcode#math-1
0368-largest-divisible-subsethttps://github.com/dsankov/leetcode/tree/master/0368-largest-divisible-subset
0797-rabbits-in-foresthttps://github.com/dsankov/leetcode/tree/master/0797-rabbits-in-forest
1477-product-of-the-last-k-numbershttps://github.com/dsankov/leetcode/tree/master/1477-product-of-the-last-k-numbers
1500-count-largest-grouphttps://github.com/dsankov/leetcode/tree/master/1500-count-largest-group
1631-number-of-sub-arrays-with-odd-sumhttps://github.com/dsankov/leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum
1889-check-if-number-is-a-sum-of-powers-of-threehttps://github.com/dsankov/leetcode/tree/master/1889-check-if-number-is-a-sum-of-powers-of-three
1993-sum-of-all-subset-xor-totalshttps://github.com/dsankov/leetcode/tree/master/1993-sum-of-all-subset-xor-totals
2160-minimum-operations-to-make-a-uni-value-gridhttps://github.com/dsankov/leetcode/tree/master/2160-minimum-operations-to-make-a-uni-value-grid
2415-count-the-number-of-ideal-arrayshttps://github.com/dsankov/leetcode/tree/master/2415-count-the-number-of-ideal-arrays
2610-closest-prime-numbers-in-rangehttps://github.com/dsankov/leetcode/tree/master/2610-closest-prime-numbers-in-range
2645-pass-the-pillowhttps://github.com/dsankov/leetcode/tree/master/2645-pass-the-pillow
2649-count-total-number-of-colored-cellshttps://github.com/dsankov/leetcode/tree/master/2649-count-total-number-of-colored-cells
2802-find-the-punishment-number-of-an-integerhttps://github.com/dsankov/leetcode/tree/master/2802-find-the-punishment-number-of-an-integer
2998-count-symmetric-integershttps://github.com/dsankov/leetcode/tree/master/2998-count-symmetric-integers
3001-apply-operations-to-maximize-scorehttps://github.com/dsankov/leetcode/tree/master/3001-apply-operations-to-maximize-score
3227-find-missing-and-repeated-valueshttps://github.com/dsankov/leetcode/tree/master/3227-find-missing-and-repeated-values
3243-count-the-number-of-powerful-integershttps://github.com/dsankov/leetcode/tree/master/3243-count-the-number-of-powerful-integers
3630-total-characters-in-string-after-transformations-iihttps://github.com/dsankov/leetcode/tree/master/3630-total-characters-in-string-after-transformations-ii
3637-count-number-of-balanced-permutationshttps://github.com/dsankov/leetcode/tree/master/3637-count-number-of-balanced-permutations
https://patch-diff.githubusercontent.com/dsankov/leetcode#simulation
2048-build-array-from-permutationhttps://github.com/dsankov/leetcode/tree/master/2048-build-array-from-permutation
2265-partition-array-according-to-given-pivothttps://github.com/dsankov/leetcode/tree/master/2265-partition-array-according-to-given-pivot
2551-apply-operations-to-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2551-apply-operations-to-an-array
2645-pass-the-pillowhttps://github.com/dsankov/leetcode/tree/master/2645-pass-the-pillow
3434-find-the-number-of-distinct-colors-among-the-ballshttps://github.com/dsankov/leetcode/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls
https://patch-diff.githubusercontent.com/dsankov/leetcode#array-1
0075-sort-colorshttps://github.com/dsankov/leetcode/tree/master/0075-sort-colors
0088-merge-sorted-arrayhttps://github.com/dsankov/leetcode/tree/master/0088-merge-sorted-array
0368-largest-divisible-subsethttps://github.com/dsankov/leetcode/tree/master/0368-largest-divisible-subset
0416-partition-equal-subset-sumhttps://github.com/dsankov/leetcode/tree/master/0416-partition-equal-subset-sum
0797-rabbits-in-foresthttps://github.com/dsankov/leetcode/tree/master/0797-rabbits-in-forest
0905-length-of-longest-fibonacci-subsequencehttps://github.com/dsankov/leetcode/tree/master/0905-length-of-longest-fibonacci-subsequence
1025-minimum-cost-for-ticketshttps://github.com/dsankov/leetcode/tree/master/1025-minimum-cost-for-tickets
1049-minimum-domino-rotations-for-equal-rowhttps://github.com/dsankov/leetcode/tree/master/1049-minimum-domino-rotations-for-equal-row
1227-number-of-equivalent-domino-pairshttps://github.com/dsankov/leetcode/tree/master/1227-number-of-equivalent-domino-pairs
1293-three-consecutive-oddshttps://github.com/dsankov/leetcode/tree/master/1293-three-consecutive-odds
1335-maximum-candies-allocated-to-k-childrenhttps://github.com/dsankov/leetcode/tree/master/1335-maximum-candies-allocated-to-k-children
1477-product-of-the-last-k-numbershttps://github.com/dsankov/leetcode/tree/master/1477-product-of-the-last-k-numbers
1631-number-of-sub-arrays-with-odd-sumhttps://github.com/dsankov/leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum
1656-count-good-tripletshttps://github.com/dsankov/leetcode/tree/master/1656-count-good-triplets
1819-construct-the-lexicographically-largest-valid-sequencehttps://github.com/dsankov/leetcode/tree/master/1819-construct-the-lexicographically-largest-valid-sequence
1849-maximum-absolute-sum-of-any-subarrayhttps://github.com/dsankov/leetcode/tree/master/1849-maximum-absolute-sum-of-any-subarray
1993-sum-of-all-subset-xor-totalshttps://github.com/dsankov/leetcode/tree/master/1993-sum-of-all-subset-xor-totals
2048-build-array-from-permutationhttps://github.com/dsankov/leetcode/tree/master/2048-build-array-from-permutation
2160-minimum-operations-to-make-a-uni-value-gridhttps://github.com/dsankov/leetcode/tree/master/2160-minimum-operations-to-make-a-uni-value-grid
2180-maximum-number-of-tasks-you-can-assignhttps://github.com/dsankov/leetcode/tree/master/2180-maximum-number-of-tasks-you-can-assign
2215-finding-3-digit-even-numbershttps://github.com/dsankov/leetcode/tree/master/2215-finding-3-digit-even-numbers
2220-find-all-possible-recipes-from-given-supplieshttps://github.com/dsankov/leetcode/tree/master/2220-find-all-possible-recipes-from-given-supplies
2237-longest-palindrome-by-concatenating-two-letter-wordshttps://github.com/dsankov/leetcode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words
2249-count-the-hidden-sequenceshttps://github.com/dsankov/leetcode/tree/master/2249-count-the-hidden-sequences
2262-solving-questions-with-brainpowerhttps://github.com/dsankov/leetcode/tree/master/2262-solving-questions-with-brainpower
2265-partition-array-according-to-given-pivothttps://github.com/dsankov/leetcode/tree/master/2265-partition-array-according-to-given-pivot
2277-count-equal-and-divisible-pairs-in-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2277-count-equal-and-divisible-pairs-in-an-array
2280-count-good-triplets-in-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2280-count-good-triplets-in-an-array
2308-divide-array-into-equal-pairshttps://github.com/dsankov/leetcode/tree/master/2308-divide-array-into-equal-pairs
2394-count-subarrays-with-score-less-than-khttps://github.com/dsankov/leetcode/tree/master/2394-count-subarrays-with-score-less-than-k
2478-longest-nice-subarrayhttps://github.com/dsankov/leetcode/tree/master/2478-longest-nice-subarray
2527-count-subarrays-with-fixed-boundshttps://github.com/dsankov/leetcode/tree/master/2527-count-subarrays-with-fixed-bounds
2551-apply-operations-to-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2551-apply-operations-to-an-array
2564-most-profitable-path-in-a-treehttps://github.com/dsankov/leetcode/tree/master/2564-most-profitable-path-in-a-tree
2588-maximum-number-of-points-from-grid-querieshttps://github.com/dsankov/leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries
2614-maximum-count-of-positive-integer-and-negative-integerhttps://github.com/dsankov/leetcode/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer
2626-count-the-number-of-good-subarrayshttps://github.com/dsankov/leetcode/tree/master/2626-count-the-number-of-good-subarrays
2665-minimum-time-to-repair-carshttps://github.com/dsankov/leetcode/tree/master/2665-minimum-time-to-repair-cars
2681-put-marbles-in-bagshttps://github.com/dsankov/leetcode/tree/master/2681-put-marbles-in-bags
2690-house-robber-ivhttps://github.com/dsankov/leetcode/tree/master/2690-house-robber-iv
2699-count-the-number-of-fair-pairshttps://github.com/dsankov/leetcode/tree/master/2699-count-the-number-of-fair-pairs
2707-merge-two-2d-arrays-by-summing-valueshttps://github.com/dsankov/leetcode/tree/master/2707-merge-two-2d-arrays-by-summing-values
2856-count-complete-subarrays-in-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2856-count-complete-subarrays-in-an-array
2888-minimum-index-of-a-valid-splithttps://github.com/dsankov/leetcode/tree/master/2888-minimum-index-of-a-valid-split
2915-count-of-interesting-subarrayshttps://github.com/dsankov/leetcode/tree/master/2915-count-of-interesting-subarrays
3001-apply-operations-to-maximize-scorehttps://github.com/dsankov/leetcode/tree/master/3001-apply-operations-to-maximize-score
3142-longest-unequal-adjacent-groups-subsequence-iihttps://github.com/dsankov/leetcode/tree/master/3142-longest-unequal-adjacent-groups-subsequence-ii
3143-longest-unequal-adjacent-groups-subsequence-ihttps://github.com/dsankov/leetcode/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i
3152-maximum-value-of-an-ordered-triplet-iihttps://github.com/dsankov/leetcode/tree/master/3152-maximum-value-of-an-ordered-triplet-ii
3154-maximum-value-of-an-ordered-triplet-ihttps://github.com/dsankov/leetcode/tree/master/3154-maximum-value-of-an-ordered-triplet-i
3171-minimum-equal-sum-of-two-arrays-after-replacing-zeroshttps://github.com/dsankov/leetcode/tree/master/3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros
3213-count-subarrays-where-max-element-appears-at-least-k-timeshttps://github.com/dsankov/leetcode/tree/master/3213-count-subarrays-where-max-element-appears-at-least-k-times
3227-find-missing-and-repeated-valueshttps://github.com/dsankov/leetcode/tree/master/3227-find-missing-and-repeated-values
3348-minimum-cost-walk-in-weighted-graphhttps://github.com/dsankov/leetcode/tree/master/3348-minimum-cost-walk-in-weighted-graph
3430-count-days-without-meetingshttps://github.com/dsankov/leetcode/tree/master/3430-count-days-without-meetings
3434-find-the-number-of-distinct-colors-among-the-ballshttps://github.com/dsankov/leetcode/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-ihttps://github.com/dsankov/leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i
3483-alternating-groups-iihttps://github.com/dsankov/leetcode/tree/master/3483-alternating-groups-ii
3621-minimum-operations-to-make-array-values-equal-to-khttps://github.com/dsankov/leetcode/tree/master/3621-minimum-operations-to-make-array-values-equal-to-k
3627-find-minimum-time-to-reach-last-room-ihttps://github.com/dsankov/leetcode/tree/master/3627-find-minimum-time-to-reach-last-room-i
3643-zero-array-transformation-iihttps://github.com/dsankov/leetcode/tree/master/3643-zero-array-transformation-ii
3656-minimum-number-of-operations-to-make-elements-in-array-distincthttps://github.com/dsankov/leetcode/tree/master/3656-minimum-number-of-operations-to-make-elements-in-array-distinct
3657-check-if-grid-can-be-cut-into-sectionshttps://github.com/dsankov/leetcode/tree/master/3657-check-if-grid-can-be-cut-into-sections
3685-count-subarrays-of-length-three-with-a-conditionhttps://github.com/dsankov/leetcode/tree/master/3685-count-subarrays-of-length-three-with-a-condition
https://patch-diff.githubusercontent.com/dsankov/leetcode#dynamic-programming
0368-largest-divisible-subsethttps://github.com/dsankov/leetcode/tree/master/0368-largest-divisible-subset
0416-partition-equal-subset-sumhttps://github.com/dsankov/leetcode/tree/master/0416-partition-equal-subset-sum
0806-domino-and-tromino-tilinghttps://github.com/dsankov/leetcode/tree/master/0806-domino-and-tromino-tiling
0868-push-dominoeshttps://github.com/dsankov/leetcode/tree/master/0868-push-dominoes
0905-length-of-longest-fibonacci-subsequencehttps://github.com/dsankov/leetcode/tree/master/0905-length-of-longest-fibonacci-subsequence
1025-minimum-cost-for-ticketshttps://github.com/dsankov/leetcode/tree/master/1025-minimum-cost-for-tickets
1170-shortest-common-supersequencehttps://github.com/dsankov/leetcode/tree/master/1170-shortest-common-supersequence
1631-number-of-sub-arrays-with-odd-sumhttps://github.com/dsankov/leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum
1849-maximum-absolute-sum-of-any-subarrayhttps://github.com/dsankov/leetcode/tree/master/1849-maximum-absolute-sum-of-any-subarray
2090-number-of-ways-to-arrive-at-destinationhttps://github.com/dsankov/leetcode/tree/master/2090-number-of-ways-to-arrive-at-destination
2262-solving-questions-with-brainpowerhttps://github.com/dsankov/leetcode/tree/master/2262-solving-questions-with-brainpower
2415-count-the-number-of-ideal-arrayshttps://github.com/dsankov/leetcode/tree/master/2415-count-the-number-of-ideal-arrays
3142-longest-unequal-adjacent-groups-subsequence-iihttps://github.com/dsankov/leetcode/tree/master/3142-longest-unequal-adjacent-groups-subsequence-ii
3143-longest-unequal-adjacent-groups-subsequence-ihttps://github.com/dsankov/leetcode/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i
3243-count-the-number-of-powerful-integershttps://github.com/dsankov/leetcode/tree/master/3243-count-the-number-of-powerful-integers
3630-total-characters-in-string-after-transformations-iihttps://github.com/dsankov/leetcode/tree/master/3630-total-characters-in-string-after-transformations-ii
3637-count-number-of-balanced-permutationshttps://github.com/dsankov/leetcode/tree/master/3637-count-number-of-balanced-permutations
https://patch-diff.githubusercontent.com/dsankov/leetcode#hash-table-1
0768-partition-labelshttps://github.com/dsankov/leetcode/tree/master/0768-partition-labels
0797-rabbits-in-foresthttps://github.com/dsankov/leetcode/tree/master/0797-rabbits-in-forest
0905-length-of-longest-fibonacci-subsequencehttps://github.com/dsankov/leetcode/tree/master/0905-length-of-longest-fibonacci-subsequence
1160-letter-tile-possibilitieshttps://github.com/dsankov/leetcode/tree/master/1160-letter-tile-possibilities
1218-lowest-common-ancestor-of-deepest-leaveshttps://github.com/dsankov/leetcode/tree/master/1218-lowest-common-ancestor-of-deepest-leaves
1227-number-of-equivalent-domino-pairshttps://github.com/dsankov/leetcode/tree/master/1227-number-of-equivalent-domino-pairs
1387-find-elements-in-a-contaminated-binary-treehttps://github.com/dsankov/leetcode/tree/master/1387-find-elements-in-a-contaminated-binary-tree
1460-number-of-substrings-containing-all-three-charactershttps://github.com/dsankov/leetcode/tree/master/1460-number-of-substrings-containing-all-three-characters
1500-count-largest-grouphttps://github.com/dsankov/leetcode/tree/master/1500-count-largest-group
2215-finding-3-digit-even-numbershttps://github.com/dsankov/leetcode/tree/master/2215-finding-3-digit-even-numbers
2220-find-all-possible-recipes-from-given-supplieshttps://github.com/dsankov/leetcode/tree/master/2220-find-all-possible-recipes-from-given-supplies
2237-longest-palindrome-by-concatenating-two-letter-wordshttps://github.com/dsankov/leetcode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words
2308-divide-array-into-equal-pairshttps://github.com/dsankov/leetcode/tree/master/2308-divide-array-into-equal-pairs
2626-count-the-number-of-good-subarrayshttps://github.com/dsankov/leetcode/tree/master/2626-count-the-number-of-good-subarrays
2707-merge-two-2d-arrays-by-summing-valueshttps://github.com/dsankov/leetcode/tree/master/2707-merge-two-2d-arrays-by-summing-values
2856-count-complete-subarrays-in-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2856-count-complete-subarrays-in-an-array
2888-minimum-index-of-a-valid-splithttps://github.com/dsankov/leetcode/tree/master/2888-minimum-index-of-a-valid-split
2915-count-of-interesting-subarrayshttps://github.com/dsankov/leetcode/tree/master/2915-count-of-interesting-subarrays
3227-find-missing-and-repeated-valueshttps://github.com/dsankov/leetcode/tree/master/3227-find-missing-and-repeated-values
3434-find-the-number-of-distinct-colors-among-the-ballshttps://github.com/dsankov/leetcode/tree/master/3434-find-the-number-of-distinct-colors-among-the-balls
3569-count-of-substrings-containing-every-vowel-and-k-consonants-iihttps://github.com/dsankov/leetcode/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii
3621-minimum-operations-to-make-array-values-equal-to-khttps://github.com/dsankov/leetcode/tree/master/3621-minimum-operations-to-make-array-values-equal-to-k
3630-total-characters-in-string-after-transformations-iihttps://github.com/dsankov/leetcode/tree/master/3630-total-characters-in-string-after-transformations-ii
3656-minimum-number-of-operations-to-make-elements-in-array-distincthttps://github.com/dsankov/leetcode/tree/master/3656-minimum-number-of-operations-to-make-elements-in-array-distinct
https://patch-diff.githubusercontent.com/dsankov/leetcode#design
1387-find-elements-in-a-contaminated-binary-treehttps://github.com/dsankov/leetcode/tree/master/1387-find-elements-in-a-contaminated-binary-tree
1477-product-of-the-last-k-numbershttps://github.com/dsankov/leetcode/tree/master/1477-product-of-the-last-k-numbers
https://patch-diff.githubusercontent.com/dsankov/leetcode#data-stream
1477-product-of-the-last-k-numbershttps://github.com/dsankov/leetcode/tree/master/1477-product-of-the-last-k-numbers
https://patch-diff.githubusercontent.com/dsankov/leetcode#prefix-sum-1
1477-product-of-the-last-k-numbershttps://github.com/dsankov/leetcode/tree/master/1477-product-of-the-last-k-numbers
1631-number-of-sub-arrays-with-odd-sumhttps://github.com/dsankov/leetcode/tree/master/1631-number-of-sub-arrays-with-odd-sum
2249-count-the-hidden-sequenceshttps://github.com/dsankov/leetcode/tree/master/2249-count-the-hidden-sequences
2394-count-subarrays-with-score-less-than-khttps://github.com/dsankov/leetcode/tree/master/2394-count-subarrays-with-score-less-than-k
2915-count-of-interesting-subarrayshttps://github.com/dsankov/leetcode/tree/master/2915-count-of-interesting-subarrays
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-ihttps://github.com/dsankov/leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i
3643-zero-array-transformation-iihttps://github.com/dsankov/leetcode/tree/master/3643-zero-array-transformation-ii
https://patch-diff.githubusercontent.com/dsankov/leetcode#backtracking-1
1160-letter-tile-possibilitieshttps://github.com/dsankov/leetcode/tree/master/1160-letter-tile-possibilities
1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-nhttps://github.com/dsankov/leetcode/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n
1819-construct-the-lexicographically-largest-valid-sequencehttps://github.com/dsankov/leetcode/tree/master/1819-construct-the-lexicographically-largest-valid-sequence
1993-sum-of-all-subset-xor-totalshttps://github.com/dsankov/leetcode/tree/master/1993-sum-of-all-subset-xor-totals
2456-construct-smallest-number-from-di-stringhttps://github.com/dsankov/leetcode/tree/master/2456-construct-smallest-number-from-di-string
2802-find-the-punishment-number-of-an-integerhttps://github.com/dsankov/leetcode/tree/master/2802-find-the-punishment-number-of-an-integer
https://patch-diff.githubusercontent.com/dsankov/leetcode#string-1
0038-count-and-sayhttps://github.com/dsankov/leetcode/tree/master/0038-count-and-say
0768-partition-labelshttps://github.com/dsankov/leetcode/tree/master/0768-partition-labels
0868-push-dominoeshttps://github.com/dsankov/leetcode/tree/master/0868-push-dominoes
1093-recover-a-tree-from-preorder-traversalhttps://github.com/dsankov/leetcode/tree/master/1093-recover-a-tree-from-preorder-traversal
1160-letter-tile-possibilitieshttps://github.com/dsankov/leetcode/tree/master/1160-letter-tile-possibilities
1170-shortest-common-supersequencehttps://github.com/dsankov/leetcode/tree/master/1170-shortest-common-supersequence
1460-number-of-substrings-containing-all-three-charactershttps://github.com/dsankov/leetcode/tree/master/1460-number-of-substrings-containing-all-three-characters
1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-nhttps://github.com/dsankov/leetcode/tree/master/1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n
2220-find-all-possible-recipes-from-given-supplieshttps://github.com/dsankov/leetcode/tree/master/2220-find-all-possible-recipes-from-given-supplies
2237-longest-palindrome-by-concatenating-two-letter-wordshttps://github.com/dsankov/leetcode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words
2456-construct-smallest-number-from-di-stringhttps://github.com/dsankov/leetcode/tree/master/2456-construct-smallest-number-from-di-string
3142-longest-unequal-adjacent-groups-subsequence-iihttps://github.com/dsankov/leetcode/tree/master/3142-longest-unequal-adjacent-groups-subsequence-ii
3143-longest-unequal-adjacent-groups-subsequence-ihttps://github.com/dsankov/leetcode/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i
3243-count-the-number-of-powerful-integershttps://github.com/dsankov/leetcode/tree/master/3243-count-the-number-of-powerful-integers
3569-count-of-substrings-containing-every-vowel-and-k-consonants-iihttps://github.com/dsankov/leetcode/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii
3630-total-characters-in-string-after-transformations-iihttps://github.com/dsankov/leetcode/tree/master/3630-total-characters-in-string-after-transformations-ii
3637-count-number-of-balanced-permutationshttps://github.com/dsankov/leetcode/tree/master/3637-count-number-of-balanced-permutations
https://patch-diff.githubusercontent.com/dsankov/leetcode#counting
1160-letter-tile-possibilitieshttps://github.com/dsankov/leetcode/tree/master/1160-letter-tile-possibilities
1227-number-of-equivalent-domino-pairshttps://github.com/dsankov/leetcode/tree/master/1227-number-of-equivalent-domino-pairs
2237-longest-palindrome-by-concatenating-two-letter-wordshttps://github.com/dsankov/leetcode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words
2308-divide-array-into-equal-pairshttps://github.com/dsankov/leetcode/tree/master/2308-divide-array-into-equal-pairs
2614-maximum-count-of-positive-integer-and-negative-integerhttps://github.com/dsankov/leetcode/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer
3630-total-characters-in-string-after-transformations-iihttps://github.com/dsankov/leetcode/tree/master/3630-total-characters-in-string-after-transformations-ii
https://patch-diff.githubusercontent.com/dsankov/leetcode#stack
2456-construct-smallest-number-from-di-stringhttps://github.com/dsankov/leetcode/tree/master/2456-construct-smallest-number-from-di-string
3001-apply-operations-to-maximize-scorehttps://github.com/dsankov/leetcode/tree/master/3001-apply-operations-to-maximize-score
https://patch-diff.githubusercontent.com/dsankov/leetcode#greedy-1
0768-partition-labelshttps://github.com/dsankov/leetcode/tree/master/0768-partition-labels
0797-rabbits-in-foresthttps://github.com/dsankov/leetcode/tree/master/0797-rabbits-in-forest
1049-minimum-domino-rotations-for-equal-rowhttps://github.com/dsankov/leetcode/tree/master/1049-minimum-domino-rotations-for-equal-row
2180-maximum-number-of-tasks-you-can-assignhttps://github.com/dsankov/leetcode/tree/master/2180-maximum-number-of-tasks-you-can-assign
2237-longest-palindrome-by-concatenating-two-letter-wordshttps://github.com/dsankov/leetcode/tree/master/2237-longest-palindrome-by-concatenating-two-letter-words
2456-construct-smallest-number-from-di-stringhttps://github.com/dsankov/leetcode/tree/master/2456-construct-smallest-number-from-di-string
2681-put-marbles-in-bagshttps://github.com/dsankov/leetcode/tree/master/2681-put-marbles-in-bags
3001-apply-operations-to-maximize-scorehttps://github.com/dsankov/leetcode/tree/master/3001-apply-operations-to-maximize-score
3143-longest-unequal-adjacent-groups-subsequence-ihttps://github.com/dsankov/leetcode/tree/master/3143-longest-unequal-adjacent-groups-subsequence-i
3171-minimum-equal-sum-of-two-arrays-after-replacing-zeroshttps://github.com/dsankov/leetcode/tree/master/3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros
https://patch-diff.githubusercontent.com/dsankov/leetcode#tree-1
1093-recover-a-tree-from-preorder-traversalhttps://github.com/dsankov/leetcode/tree/master/1093-recover-a-tree-from-preorder-traversal
1218-lowest-common-ancestor-of-deepest-leaveshttps://github.com/dsankov/leetcode/tree/master/1218-lowest-common-ancestor-of-deepest-leaves
1387-find-elements-in-a-contaminated-binary-treehttps://github.com/dsankov/leetcode/tree/master/1387-find-elements-in-a-contaminated-binary-tree
2564-most-profitable-path-in-a-treehttps://github.com/dsankov/leetcode/tree/master/2564-most-profitable-path-in-a-tree
3633-maximize-the-number-of-target-nodes-after-connecting-trees-ihttps://github.com/dsankov/leetcode/tree/master/3633-maximize-the-number-of-target-nodes-after-connecting-trees-i
https://patch-diff.githubusercontent.com/dsankov/leetcode#depth-first-search-1
1093-recover-a-tree-from-preorder-traversalhttps://github.com/dsankov/leetcode/tree/master/1093-recover-a-tree-from-preorder-traversal
1218-lowest-common-ancestor-of-deepest-leaveshttps://github.com/dsankov/leetcode/tree/master/1218-lowest-common-ancestor-of-deepest-leaves
1387-find-elements-in-a-contaminated-binary-treehttps://github.com/dsankov/leetcode/tree/master/1387-find-elements-in-a-contaminated-binary-tree
2564-most-profitable-path-in-a-treehttps://github.com/dsankov/leetcode/tree/master/2564-most-profitable-path-in-a-tree
2793-count-the-number-of-complete-componentshttps://github.com/dsankov/leetcode/tree/master/2793-count-the-number-of-complete-components
3633-maximize-the-number-of-target-nodes-after-connecting-trees-ihttps://github.com/dsankov/leetcode/tree/master/3633-maximize-the-number-of-target-nodes-after-connecting-trees-i
https://patch-diff.githubusercontent.com/dsankov/leetcode#breadth-first-search
1218-lowest-common-ancestor-of-deepest-leaveshttps://github.com/dsankov/leetcode/tree/master/1218-lowest-common-ancestor-of-deepest-leaves
1387-find-elements-in-a-contaminated-binary-treehttps://github.com/dsankov/leetcode/tree/master/1387-find-elements-in-a-contaminated-binary-tree
2564-most-profitable-path-in-a-treehttps://github.com/dsankov/leetcode/tree/master/2564-most-profitable-path-in-a-tree
2588-maximum-number-of-points-from-grid-querieshttps://github.com/dsankov/leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries
2793-count-the-number-of-complete-componentshttps://github.com/dsankov/leetcode/tree/master/2793-count-the-number-of-complete-components
3633-maximize-the-number-of-target-nodes-after-connecting-trees-ihttps://github.com/dsankov/leetcode/tree/master/3633-maximize-the-number-of-target-nodes-after-connecting-trees-i
https://patch-diff.githubusercontent.com/dsankov/leetcode#binary-tree-1
1093-recover-a-tree-from-preorder-traversalhttps://github.com/dsankov/leetcode/tree/master/1093-recover-a-tree-from-preorder-traversal
1218-lowest-common-ancestor-of-deepest-leaveshttps://github.com/dsankov/leetcode/tree/master/1218-lowest-common-ancestor-of-deepest-leaves
1387-find-elements-in-a-contaminated-binary-treehttps://github.com/dsankov/leetcode/tree/master/1387-find-elements-in-a-contaminated-binary-tree
https://patch-diff.githubusercontent.com/dsankov/leetcode#two-pointers-1
0075-sort-colorshttps://github.com/dsankov/leetcode/tree/master/0075-sort-colors
0088-merge-sorted-arrayhttps://github.com/dsankov/leetcode/tree/master/0088-merge-sorted-array
0768-partition-labelshttps://github.com/dsankov/leetcode/tree/master/0768-partition-labels
0868-push-dominoeshttps://github.com/dsankov/leetcode/tree/master/0868-push-dominoes
2265-partition-array-according-to-given-pivothttps://github.com/dsankov/leetcode/tree/master/2265-partition-array-according-to-given-pivot
2551-apply-operations-to-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2551-apply-operations-to-an-array
2588-maximum-number-of-points-from-grid-querieshttps://github.com/dsankov/leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries
2699-count-the-number-of-fair-pairshttps://github.com/dsankov/leetcode/tree/master/2699-count-the-number-of-fair-pairs
2707-merge-two-2d-arrays-by-summing-valueshttps://github.com/dsankov/leetcode/tree/master/2707-merge-two-2d-arrays-by-summing-values
https://patch-diff.githubusercontent.com/dsankov/leetcode#sorting-1
0075-sort-colorshttps://github.com/dsankov/leetcode/tree/master/0075-sort-colors
0088-merge-sorted-arrayhttps://github.com/dsankov/leetcode/tree/master/0088-merge-sorted-array
0368-largest-divisible-subsethttps://github.com/dsankov/leetcode/tree/master/0368-largest-divisible-subset
2160-minimum-operations-to-make-a-uni-value-gridhttps://github.com/dsankov/leetcode/tree/master/2160-minimum-operations-to-make-a-uni-value-grid
2180-maximum-number-of-tasks-you-can-assignhttps://github.com/dsankov/leetcode/tree/master/2180-maximum-number-of-tasks-you-can-assign
2215-finding-3-digit-even-numbershttps://github.com/dsankov/leetcode/tree/master/2215-finding-3-digit-even-numbers
2588-maximum-number-of-points-from-grid-querieshttps://github.com/dsankov/leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries
2681-put-marbles-in-bagshttps://github.com/dsankov/leetcode/tree/master/2681-put-marbles-in-bags
2699-count-the-number-of-fair-pairshttps://github.com/dsankov/leetcode/tree/master/2699-count-the-number-of-fair-pairs
2888-minimum-index-of-a-valid-splithttps://github.com/dsankov/leetcode/tree/master/2888-minimum-index-of-a-valid-split
3001-apply-operations-to-maximize-scorehttps://github.com/dsankov/leetcode/tree/master/3001-apply-operations-to-maximize-score
3430-count-days-without-meetingshttps://github.com/dsankov/leetcode/tree/master/3430-count-days-without-meetings
3657-check-if-grid-can-be-cut-into-sectionshttps://github.com/dsankov/leetcode/tree/master/3657-check-if-grid-can-be-cut-into-sections
https://patch-diff.githubusercontent.com/dsankov/leetcode#graph
2090-number-of-ways-to-arrive-at-destinationhttps://github.com/dsankov/leetcode/tree/master/2090-number-of-ways-to-arrive-at-destination
2220-find-all-possible-recipes-from-given-supplieshttps://github.com/dsankov/leetcode/tree/master/2220-find-all-possible-recipes-from-given-supplies
2564-most-profitable-path-in-a-treehttps://github.com/dsankov/leetcode/tree/master/2564-most-profitable-path-in-a-tree
2793-count-the-number-of-complete-componentshttps://github.com/dsankov/leetcode/tree/master/2793-count-the-number-of-complete-components
3348-minimum-cost-walk-in-weighted-graphhttps://github.com/dsankov/leetcode/tree/master/3348-minimum-cost-walk-in-weighted-graph
3627-find-minimum-time-to-reach-last-room-ihttps://github.com/dsankov/leetcode/tree/master/3627-find-minimum-time-to-reach-last-room-i
https://patch-diff.githubusercontent.com/dsankov/leetcode#matrix
2160-minimum-operations-to-make-a-uni-value-gridhttps://github.com/dsankov/leetcode/tree/master/2160-minimum-operations-to-make-a-uni-value-grid
2588-maximum-number-of-points-from-grid-querieshttps://github.com/dsankov/leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries
3227-find-missing-and-repeated-valueshttps://github.com/dsankov/leetcode/tree/master/3227-find-missing-and-repeated-values
3627-find-minimum-time-to-reach-last-room-ihttps://github.com/dsankov/leetcode/tree/master/3627-find-minimum-time-to-reach-last-room-i
https://patch-diff.githubusercontent.com/dsankov/leetcode#number-theory
2415-count-the-number-of-ideal-arrayshttps://github.com/dsankov/leetcode/tree/master/2415-count-the-number-of-ideal-arrays
2610-closest-prime-numbers-in-rangehttps://github.com/dsankov/leetcode/tree/master/2610-closest-prime-numbers-in-range
3001-apply-operations-to-maximize-scorehttps://github.com/dsankov/leetcode/tree/master/3001-apply-operations-to-maximize-score
https://patch-diff.githubusercontent.com/dsankov/leetcode#sliding-window-1
1460-number-of-substrings-containing-all-three-charactershttps://github.com/dsankov/leetcode/tree/master/1460-number-of-substrings-containing-all-three-characters
2394-count-subarrays-with-score-less-than-khttps://github.com/dsankov/leetcode/tree/master/2394-count-subarrays-with-score-less-than-k
2478-longest-nice-subarrayhttps://github.com/dsankov/leetcode/tree/master/2478-longest-nice-subarray
2527-count-subarrays-with-fixed-boundshttps://github.com/dsankov/leetcode/tree/master/2527-count-subarrays-with-fixed-bounds
2626-count-the-number-of-good-subarrayshttps://github.com/dsankov/leetcode/tree/master/2626-count-the-number-of-good-subarrays
2856-count-complete-subarrays-in-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2856-count-complete-subarrays-in-an-array
3213-count-subarrays-where-max-element-appears-at-least-k-timeshttps://github.com/dsankov/leetcode/tree/master/3213-count-subarrays-where-max-element-appears-at-least-k-times
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-ihttps://github.com/dsankov/leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i
3483-alternating-groups-iihttps://github.com/dsankov/leetcode/tree/master/3483-alternating-groups-ii
3569-count-of-substrings-containing-every-vowel-and-k-consonants-iihttps://github.com/dsankov/leetcode/tree/master/3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii
https://patch-diff.githubusercontent.com/dsankov/leetcode#binary-search-1
1335-maximum-candies-allocated-to-k-childrenhttps://github.com/dsankov/leetcode/tree/master/1335-maximum-candies-allocated-to-k-children
2180-maximum-number-of-tasks-you-can-assignhttps://github.com/dsankov/leetcode/tree/master/2180-maximum-number-of-tasks-you-can-assign
2280-count-good-triplets-in-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2280-count-good-triplets-in-an-array
2394-count-subarrays-with-score-less-than-khttps://github.com/dsankov/leetcode/tree/master/2394-count-subarrays-with-score-less-than-k
2614-maximum-count-of-positive-integer-and-negative-integerhttps://github.com/dsankov/leetcode/tree/master/2614-maximum-count-of-positive-integer-and-negative-integer
2665-minimum-time-to-repair-carshttps://github.com/dsankov/leetcode/tree/master/2665-minimum-time-to-repair-cars
2690-house-robber-ivhttps://github.com/dsankov/leetcode/tree/master/2690-house-robber-iv
2699-count-the-number-of-fair-pairshttps://github.com/dsankov/leetcode/tree/master/2699-count-the-number-of-fair-pairs
3643-zero-array-transformation-iihttps://github.com/dsankov/leetcode/tree/master/3643-zero-array-transformation-ii
https://patch-diff.githubusercontent.com/dsankov/leetcode#bit-manipulation
1993-sum-of-all-subset-xor-totalshttps://github.com/dsankov/leetcode/tree/master/1993-sum-of-all-subset-xor-totals
2308-divide-array-into-equal-pairshttps://github.com/dsankov/leetcode/tree/master/2308-divide-array-into-equal-pairs
2478-longest-nice-subarrayhttps://github.com/dsankov/leetcode/tree/master/2478-longest-nice-subarray
3348-minimum-cost-walk-in-weighted-graphhttps://github.com/dsankov/leetcode/tree/master/3348-minimum-cost-walk-in-weighted-graph
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-ihttps://github.com/dsankov/leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i
https://patch-diff.githubusercontent.com/dsankov/leetcode#queue
2180-maximum-number-of-tasks-you-can-assignhttps://github.com/dsankov/leetcode/tree/master/2180-maximum-number-of-tasks-you-can-assign
2527-count-subarrays-with-fixed-boundshttps://github.com/dsankov/leetcode/tree/master/2527-count-subarrays-with-fixed-bounds
3475-minimum-operations-to-make-binary-array-elements-equal-to-one-ihttps://github.com/dsankov/leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i
https://patch-diff.githubusercontent.com/dsankov/leetcode#union-find
2588-maximum-number-of-points-from-grid-querieshttps://github.com/dsankov/leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries
2793-count-the-number-of-complete-componentshttps://github.com/dsankov/leetcode/tree/master/2793-count-the-number-of-complete-components
3348-minimum-cost-walk-in-weighted-graphhttps://github.com/dsankov/leetcode/tree/master/3348-minimum-cost-walk-in-weighted-graph
https://patch-diff.githubusercontent.com/dsankov/leetcode#topological-sort
2090-number-of-ways-to-arrive-at-destinationhttps://github.com/dsankov/leetcode/tree/master/2090-number-of-ways-to-arrive-at-destination
2220-find-all-possible-recipes-from-given-supplieshttps://github.com/dsankov/leetcode/tree/master/2220-find-all-possible-recipes-from-given-supplies
https://patch-diff.githubusercontent.com/dsankov/leetcode#shortest-path
2090-number-of-ways-to-arrive-at-destinationhttps://github.com/dsankov/leetcode/tree/master/2090-number-of-ways-to-arrive-at-destination
3627-find-minimum-time-to-reach-last-room-ihttps://github.com/dsankov/leetcode/tree/master/3627-find-minimum-time-to-reach-last-room-i
https://patch-diff.githubusercontent.com/dsankov/leetcode#heap-priority-queue-1
2588-maximum-number-of-points-from-grid-querieshttps://github.com/dsankov/leetcode/tree/master/2588-maximum-number-of-points-from-grid-queries
2681-put-marbles-in-bagshttps://github.com/dsankov/leetcode/tree/master/2681-put-marbles-in-bags
3627-find-minimum-time-to-reach-last-room-ihttps://github.com/dsankov/leetcode/tree/master/3627-find-minimum-time-to-reach-last-room-i
https://patch-diff.githubusercontent.com/dsankov/leetcode#monotonic-stack
3001-apply-operations-to-maximize-scorehttps://github.com/dsankov/leetcode/tree/master/3001-apply-operations-to-maximize-score
https://patch-diff.githubusercontent.com/dsankov/leetcode#combinatorics
1993-sum-of-all-subset-xor-totalshttps://github.com/dsankov/leetcode/tree/master/1993-sum-of-all-subset-xor-totals
2415-count-the-number-of-ideal-arrayshttps://github.com/dsankov/leetcode/tree/master/2415-count-the-number-of-ideal-arrays
3637-count-number-of-balanced-permutationshttps://github.com/dsankov/leetcode/tree/master/3637-count-number-of-balanced-permutations
https://patch-diff.githubusercontent.com/dsankov/leetcode#enumeration
1656-count-good-tripletshttps://github.com/dsankov/leetcode/tree/master/1656-count-good-triplets
1993-sum-of-all-subset-xor-totalshttps://github.com/dsankov/leetcode/tree/master/1993-sum-of-all-subset-xor-totals
2215-finding-3-digit-even-numbershttps://github.com/dsankov/leetcode/tree/master/2215-finding-3-digit-even-numbers
2998-count-symmetric-integershttps://github.com/dsankov/leetcode/tree/master/2998-count-symmetric-integers
https://patch-diff.githubusercontent.com/dsankov/leetcode#divide-and-conquer
2280-count-good-triplets-in-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2280-count-good-triplets-in-an-array
https://patch-diff.githubusercontent.com/dsankov/leetcode#binary-indexed-tree
2280-count-good-triplets-in-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2280-count-good-triplets-in-an-array
https://patch-diff.githubusercontent.com/dsankov/leetcode#segment-tree
2280-count-good-triplets-in-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2280-count-good-triplets-in-an-array
https://patch-diff.githubusercontent.com/dsankov/leetcode#merge-sort
2280-count-good-triplets-in-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2280-count-good-triplets-in-an-array
https://patch-diff.githubusercontent.com/dsankov/leetcode#ordered-set
2280-count-good-triplets-in-an-arrayhttps://github.com/dsankov/leetcode/tree/master/2280-count-good-triplets-in-an-array
https://patch-diff.githubusercontent.com/dsankov/leetcode#monotonic-queue
2180-maximum-number-of-tasks-you-can-assignhttps://github.com/dsankov/leetcode/tree/master/2180-maximum-number-of-tasks-you-can-assign
2527-count-subarrays-with-fixed-boundshttps://github.com/dsankov/leetcode/tree/master/2527-count-subarrays-with-fixed-bounds
leetcode.com/u/dsankov/https://leetcode.com/u/dsankov/
Readme https://patch-diff.githubusercontent.com/dsankov/leetcode#readme-ov-file
Please reload this pagehttps://patch-diff.githubusercontent.com/dsankov/leetcode
Activityhttps://patch-diff.githubusercontent.com/dsankov/leetcode/activity
0 starshttps://patch-diff.githubusercontent.com/dsankov/leetcode/stargazers
1 watchinghttps://patch-diff.githubusercontent.com/dsankov/leetcode/watchers
0 forkshttps://patch-diff.githubusercontent.com/dsankov/leetcode/forks
Report repository https://patch-diff.githubusercontent.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fdsankov%2Fleetcode&report=dsankov+%28user%29
Releaseshttps://patch-diff.githubusercontent.com/dsankov/leetcode/releases
Packages 0https://patch-diff.githubusercontent.com/users/dsankov/packages?repo_name=leetcode
Python 100.0% https://patch-diff.githubusercontent.com/dsankov/leetcode/search?l=python
https://github.com
Termshttps://docs.github.com/site-policy/github-terms/github-terms-of-service
Privacyhttps://docs.github.com/site-policy/privacy-policies/github-privacy-statement
Securityhttps://github.com/security
Statushttps://www.githubstatus.com/
Communityhttps://github.community/
Docshttps://docs.github.com/
Contacthttps://support.github.com?tags=dotcom-footer

Viewport: width=device-width

URLs of crawlers that visited me.