René's URL Explorer Experiment

Title: GitHub - 0general/LeetCode · GitHub

Open Graph Title: GitHub - 0general/LeetCode

X Title: GitHub - 0general/LeetCode

Description: Contribute to 0general/LeetCode development by creating an account on GitHub.

Open Graph Description: Contribute to 0general/LeetCode development by creating an account on GitHub.

X Description: Contribute to 0general/LeetCode development by creating an account on GitHub.

Opengraph URL: https://github.com/0general/LeetCode

X: @github

direct link

Domain: github.com

route-pattern	/:user_id/:repository
route-controller	files
route-action	disambiguate
fetch-nonce	v2:723106ee-b626-851d-8e22-d1e1cafa0a8e
current-catalog-service-hash	f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id	D2BC:1EC03F:DCCDCA:1280ADD:6A6120B6
html-safe-nonce	db5e844c277ac6316ba5760b3723566d4ebf40a82db8ac6e029217cd3d735439
visitor-payload	eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJEMkJDOjFFQzAzRjpEQ0NEQ0E6MTI4MEFERDo2QTYxMjBCNiIsInZpc2l0b3JfaWQiOiI4MzU4MzIzMTA1MDQ4ODk1NjcwIiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmac	f8b166a370c081d0277d68f246bdc3121c4b2619554c1e95a69113b5e509d386
hovercard-subject-tag	repository:455455524
github-keyboard-shortcuts	repository,copilot
google-site-verification	Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-url	https://collector.github.com/github/collect
analytics-location	//
fb:app_id	1401488693436528
apple-itunes-app	app-id=1477376905, app-argument=https://github.com/0general/LeetCode
twitter:image	https://opengraph.githubassets.com/2e8654be441b6ed3fcfbde4c6552237406e0bf47c06b83851d6b5a58bbb581e5/0general/LeetCode
twitter:card	summary_large_image
og:image	https://opengraph.githubassets.com/2e8654be441b6ed3fcfbde4c6552237406e0bf47c06b83851d6b5a58bbb581e5/0general/LeetCode
og:image:alt	Contribute to 0general/LeetCode development by creating an account on GitHub.
og:image:width	1200
og:image:height	600
og:site_name	GitHub
og:type	object
hostname	github.com
expected-hostname	github.com
None	7d9987c85f924dc5597480f737e023a6e985b0316e672f00513eb4ba440d87ba
turbo-cache-control	no-cache
go-import	github.com/0general/LeetCode git https://github.com/0general/LeetCode.git
octolytics-dimension-user_id	56211221
octolytics-dimension-user_login	0general
octolytics-dimension-repository_id	455455524
octolytics-dimension-repository_nwo	0general/LeetCode
octolytics-dimension-repository_public	true
octolytics-dimension-repository_is_fork	false
octolytics-dimension-repository_network_root_id	455455524
octolytics-dimension-repository_network_root_nwo	0general/LeetCode
turbo-body-classes	logged-out env-production page-responsive
disable-turbo	false
browser-stats-url	https://api.github.com/_private/browser/stats
browser-errors-url	https://api.github.com/_private/browser/errors
release	d38dc1dac7b5a5d0788e068e080820de6de90a28
ui-target	full
theme-color	#1e2327
color-scheme	light dark

Links:

Skip to content	https://github.com/0general/LeetCode#start-of-content
	https://github.com/
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2F0general%2FLeetCode
GitHub CopilotWrite better code with AI	https://github.com/features/copilot
GitHub Copilot appDirect agents from issue to merge	https://github.com/features/ai/github-app
MCP RegistryNewIntegrate external tools	https://github.com/mcp
ActionsAutomate any workflow	https://github.com/features/actions
CodespacesInstant dev environments	https://github.com/features/codespaces
IssuesPlan and track work	https://github.com/features/issues
Code ReviewManage code changes	https://github.com/features/code-review
Code QualityEnforce quality at merge	https://github.com/features/code-quality
GitHub Advanced SecurityFind and fix vulnerabilities	https://github.com/security/advanced-security
Code securitySecure your code as you build	https://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they start	https://github.com/security/advanced-security/secret-protection
Why GitHub	https://github.com/why-github
Documentation	https://docs.github.com
Blog	https://github.blog
Changelog	https://github.blog/changelog
Marketplace	https://github.com/marketplace
View all features	https://github.com/features
Enterprises	https://github.com/enterprise
Small and medium teams	https://github.com/team
Startups	https://github.com/enterprise/startups
Nonprofits	https://github.com/solutions/industry/nonprofits
App Modernization	https://github.com/solutions/use-case/app-modernization
DevSecOps	https://github.com/solutions/use-case/devsecops
DevOps	https://github.com/solutions/use-case/devops
CI/CD	https://github.com/solutions/use-case/ci-cd
View all use cases	https://github.com/solutions/use-case
Healthcare	https://github.com/solutions/industry/healthcare
Financial services	https://github.com/solutions/industry/financial-services
Manufacturing	https://github.com/solutions/industry/manufacturing
Government	https://github.com/solutions/industry/government
View all industries	https://github.com/solutions/industry
View all solutions	https://github.com/solutions
AI	https://github.com/resources/articles?topic=ai
Software Development	https://github.com/resources/articles?topic=software-development
DevOps	https://github.com/resources/articles?topic=devops
Security	https://github.com/resources/articles?topic=security
View all topics	https://github.com/resources/articles
Customer stories	https://github.com/customer-stories
Events & webinars	https://github.com/resources/events
Ebooks & reports	https://github.com/resources/whitepapers
Business insights	https://github.com/solutions/executive-insights
GitHub Skills	https://skills.github.com
Documentation	https://docs.github.com
Customer support	https://support.github.com
Community forum	https://github.com/orgs/community/discussions
Trust center	https://github.com/trust-center
Partners	https://github.com/partners
View all resources	https://github.com/resources
GitHub SponsorsFund open source developers	https://github.com/open-source/sponsors
Security Lab	https://securitylab.github.com
Maintainer Community	https://maintainers.github.com
Accelerator	https://github.com/open-source/accelerator
GitHub Stars	https://stars.github.com
Archive Program	https://archiveprogram.github.com
Topics	https://github.com/topics
Trending	https://github.com/trending
Collections	https://github.com/collections
Enterprise platformAI-powered developer platform	https://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security features	https://github.com/security/advanced-security
Copilot for BusinessEnterprise-grade AI features	https://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 support	https://github.com/enterprise/premium-support
Pricing	https://github.com/pricing
Search syntax tips	https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentation	https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2F0general%2FLeetCode
Sign up	https://github.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=0general%2FLeetCode
Reload	https://github.com/0general/LeetCode
Reload	https://github.com/0general/LeetCode
Reload	https://github.com/0general/LeetCode
0general	https://github.com/0general
LeetCode	https://github.com/0general/LeetCode
Notifications	https://github.com/login?return_to=%2F0general%2FLeetCode
Fork 0	https://github.com/login?return_to=%2F0general%2FLeetCode
Star 0	https://github.com/login?return_to=%2F0general%2FLeetCode
Code	https://github.com/0general/LeetCode
Issues 0	https://github.com/0general/LeetCode/issues
Pull requests 0	https://github.com/0general/LeetCode/pulls
Actions	https://github.com/0general/LeetCode/actions
Projects	https://github.com/0general/LeetCode/projects
Security and quality 0	https://github.com/0general/LeetCode/security
Insights	https://github.com/0general/LeetCode/pulse
Code	https://github.com/0general/LeetCode
Issues	https://github.com/0general/LeetCode/issues
Pull requests	https://github.com/0general/LeetCode/pulls
Actions	https://github.com/0general/LeetCode/actions
Projects	https://github.com/0general/LeetCode/projects
Security and quality	https://github.com/0general/LeetCode/security
Insights	https://github.com/0general/LeetCode/pulse
	https://github.com/0general/LeetCode
Branches	https://github.com/0general/LeetCode/branches
Tags	https://github.com/0general/LeetCode/tags
	https://github.com/0general/LeetCode/branches
	https://github.com/0general/LeetCode/tags
1,120 Commits	https://github.com/0general/LeetCode/commits/main/
	https://github.com/0general/LeetCode/commits/main/
0001-two-sum	https://github.com/0general/LeetCode/tree/main/0001-two-sum
0001-two-sum	https://github.com/0general/LeetCode/tree/main/0001-two-sum
0002-add-two-numbers	https://github.com/0general/LeetCode/tree/main/0002-add-two-numbers
0002-add-two-numbers	https://github.com/0general/LeetCode/tree/main/0002-add-two-numbers
0012-integer-to-roman	https://github.com/0general/LeetCode/tree/main/0012-integer-to-roman
0012-integer-to-roman	https://github.com/0general/LeetCode/tree/main/0012-integer-to-roman
0013-roman-to-integer	https://github.com/0general/LeetCode/tree/main/0013-roman-to-integer
0013-roman-to-integer	https://github.com/0general/LeetCode/tree/main/0013-roman-to-integer
0014-longest-common-prefix	https://github.com/0general/LeetCode/tree/main/0014-longest-common-prefix
0014-longest-common-prefix	https://github.com/0general/LeetCode/tree/main/0014-longest-common-prefix
0019-remove-nth-node-from-end-of-list	https://github.com/0general/LeetCode/tree/main/0019-remove-nth-node-from-end-of-list
0019-remove-nth-node-from-end-of-list	https://github.com/0general/LeetCode/tree/main/0019-remove-nth-node-from-end-of-list
0020-valid-parentheses	https://github.com/0general/LeetCode/tree/main/0020-valid-parentheses
0020-valid-parentheses	https://github.com/0general/LeetCode/tree/main/0020-valid-parentheses
0021-merge-two-sorted-lists	https://github.com/0general/LeetCode/tree/main/0021-merge-two-sorted-lists
0021-merge-two-sorted-lists	https://github.com/0general/LeetCode/tree/main/0021-merge-two-sorted-lists
0022-generate-parentheses	https://github.com/0general/LeetCode/tree/main/0022-generate-parentheses
0022-generate-parentheses	https://github.com/0general/LeetCode/tree/main/0022-generate-parentheses
0024-swap-nodes-in-pairs	https://github.com/0general/LeetCode/tree/main/0024-swap-nodes-in-pairs
0024-swap-nodes-in-pairs	https://github.com/0general/LeetCode/tree/main/0024-swap-nodes-in-pairs
0025-reverse-nodes-in-k-group	https://github.com/0general/LeetCode/tree/main/0025-reverse-nodes-in-k-group
0025-reverse-nodes-in-k-group	https://github.com/0general/LeetCode/tree/main/0025-reverse-nodes-in-k-group
0034-find-first-and-last-position-of-element-in-sorted-array	https://github.com/0general/LeetCode/tree/main/0034-find-first-and-last-position-of-element-in-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array	https://github.com/0general/LeetCode/tree/main/0034-find-first-and-last-position-of-element-in-sorted-array
0037-sudoku-solver	https://github.com/0general/LeetCode/tree/main/0037-sudoku-solver
0037-sudoku-solver	https://github.com/0general/LeetCode/tree/main/0037-sudoku-solver
0048-rotate-image	https://github.com/0general/LeetCode/tree/main/0048-rotate-image
0048-rotate-image	https://github.com/0general/LeetCode/tree/main/0048-rotate-image
0051-n-queens	https://github.com/0general/LeetCode/tree/main/0051-n-queens
0051-n-queens	https://github.com/0general/LeetCode/tree/main/0051-n-queens
0052-n-queens-ii	https://github.com/0general/LeetCode/tree/main/0052-n-queens-ii
0052-n-queens-ii	https://github.com/0general/LeetCode/tree/main/0052-n-queens-ii
0054-spiral-matrix	https://github.com/0general/LeetCode/tree/main/0054-spiral-matrix
0054-spiral-matrix	https://github.com/0general/LeetCode/tree/main/0054-spiral-matrix
0057-insert-interval	https://github.com/0general/LeetCode/tree/main/0057-insert-interval
0057-insert-interval	https://github.com/0general/LeetCode/tree/main/0057-insert-interval
0062-unique-paths	https://github.com/0general/LeetCode/tree/main/0062-unique-paths
0062-unique-paths	https://github.com/0general/LeetCode/tree/main/0062-unique-paths
0064-minimum-path-sum	https://github.com/0general/LeetCode/tree/main/0064-minimum-path-sum
0064-minimum-path-sum	https://github.com/0general/LeetCode/tree/main/0064-minimum-path-sum
0077-combinations	https://github.com/0general/LeetCode/tree/main/0077-combinations
0077-combinations	https://github.com/0general/LeetCode/tree/main/0077-combinations
0083-remove-duplicates-from-sorted-list	https://github.com/0general/LeetCode/tree/main/0083-remove-duplicates-from-sorted-list
0083-remove-duplicates-from-sorted-list	https://github.com/0general/LeetCode/tree/main/0083-remove-duplicates-from-sorted-list
0092-reverse-linked-list-ii	https://github.com/0general/LeetCode/tree/main/0092-reverse-linked-list-ii
0092-reverse-linked-list-ii	https://github.com/0general/LeetCode/tree/main/0092-reverse-linked-list-ii
0096-unique-binary-search-trees	https://github.com/0general/LeetCode/tree/main/0096-unique-binary-search-trees
0096-unique-binary-search-trees	https://github.com/0general/LeetCode/tree/main/0096-unique-binary-search-trees
0098-validate-binary-search-tree	https://github.com/0general/LeetCode/tree/main/0098-validate-binary-search-tree
0098-validate-binary-search-tree	https://github.com/0general/LeetCode/tree/main/0098-validate-binary-search-tree
0103-binary-tree-zigzag-level-order-traversal	https://github.com/0general/LeetCode/tree/main/0103-binary-tree-zigzag-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal	https://github.com/0general/LeetCode/tree/main/0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree	https://github.com/0general/LeetCode/tree/main/0104-maximum-depth-of-binary-tree
0104-maximum-depth-of-binary-tree	https://github.com/0general/LeetCode/tree/main/0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii	https://github.com/0general/LeetCode/tree/main/0107-binary-tree-level-order-traversal-ii
0107-binary-tree-level-order-traversal-ii	https://github.com/0general/LeetCode/tree/main/0107-binary-tree-level-order-traversal-ii
0111-minimum-depth-of-binary-tree	https://github.com/0general/LeetCode/tree/main/0111-minimum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree	https://github.com/0general/LeetCode/tree/main/0111-minimum-depth-of-binary-tree
0127-word-ladder	https://github.com/0general/LeetCode/tree/main/0127-word-ladder
0127-word-ladder	https://github.com/0general/LeetCode/tree/main/0127-word-ladder
0137-single-number-ii	https://github.com/0general/LeetCode/tree/main/0137-single-number-ii
0137-single-number-ii	https://github.com/0general/LeetCode/tree/main/0137-single-number-ii
0148-sort-list	https://github.com/0general/LeetCode/tree/main/0148-sort-list
0148-sort-list	https://github.com/0general/LeetCode/tree/main/0148-sort-list
0150-evaluate-reverse-polish-notation	https://github.com/0general/LeetCode/tree/main/0150-evaluate-reverse-polish-notation
0150-evaluate-reverse-polish-notation	https://github.com/0general/LeetCode/tree/main/0150-evaluate-reverse-polish-notation
0153-find-minimum-in-rotated-sorted-array	https://github.com/0general/LeetCode/tree/main/0153-find-minimum-in-rotated-sorted-array
0153-find-minimum-in-rotated-sorted-array	https://github.com/0general/LeetCode/tree/main/0153-find-minimum-in-rotated-sorted-array
0167-two-sum-ii-input-array-is-sorted	https://github.com/0general/LeetCode/tree/main/0167-two-sum-ii-input-array-is-sorted
0167-two-sum-ii-input-array-is-sorted	https://github.com/0general/LeetCode/tree/main/0167-two-sum-ii-input-array-is-sorted
0168-excel-sheet-column-title	https://github.com/0general/LeetCode/tree/main/0168-excel-sheet-column-title
0168-excel-sheet-column-title	https://github.com/0general/LeetCode/tree/main/0168-excel-sheet-column-title
0169-majority-element	https://github.com/0general/LeetCode/tree/main/0169-majority-element
0169-majority-element	https://github.com/0general/LeetCode/tree/main/0169-majority-element
0199-binary-tree-right-side-view	https://github.com/0general/LeetCode/tree/main/0199-binary-tree-right-side-view
0199-binary-tree-right-side-view	https://github.com/0general/LeetCode/tree/main/0199-binary-tree-right-side-view
0206-reverse-linked-list	https://github.com/0general/LeetCode/tree/main/0206-reverse-linked-list
0206-reverse-linked-list	https://github.com/0general/LeetCode/tree/main/0206-reverse-linked-list
0211-design-add-and-search-words-data-structure	https://github.com/0general/LeetCode/tree/main/0211-design-add-and-search-words-data-structure
0211-design-add-and-search-words-data-structure	https://github.com/0general/LeetCode/tree/main/0211-design-add-and-search-words-data-structure
0215-kth-largest-element-in-an-array	https://github.com/0general/LeetCode/tree/main/0215-kth-largest-element-in-an-array
0215-kth-largest-element-in-an-array	https://github.com/0general/LeetCode/tree/main/0215-kth-largest-element-in-an-array
0217-contains-duplicate	https://github.com/0general/LeetCode/tree/main/0217-contains-duplicate
0217-contains-duplicate	https://github.com/0general/LeetCode/tree/main/0217-contains-duplicate
0222-count-complete-tree-nodes	https://github.com/0general/LeetCode/tree/main/0222-count-complete-tree-nodes
0222-count-complete-tree-nodes	https://github.com/0general/LeetCode/tree/main/0222-count-complete-tree-nodes
0228-summary-ranges	https://github.com/0general/LeetCode/tree/main/0228-summary-ranges
0228-summary-ranges	https://github.com/0general/LeetCode/tree/main/0228-summary-ranges
0238-product-of-array-except-self	https://github.com/0general/LeetCode/tree/main/0238-product-of-array-except-self
0238-product-of-array-except-self	https://github.com/0general/LeetCode/tree/main/0238-product-of-array-except-self
0240-search-a-2d-matrix-ii	https://github.com/0general/LeetCode/tree/main/0240-search-a-2d-matrix-ii
0240-search-a-2d-matrix-ii	https://github.com/0general/LeetCode/tree/main/0240-search-a-2d-matrix-ii
0242-valid-anagram	https://github.com/0general/LeetCode/tree/main/0242-valid-anagram
0242-valid-anagram	https://github.com/0general/LeetCode/tree/main/0242-valid-anagram
0268-missing-number	https://github.com/0general/LeetCode/tree/main/0268-missing-number
0268-missing-number	https://github.com/0general/LeetCode/tree/main/0268-missing-number
0283-move-zeroes	https://github.com/0general/LeetCode/tree/main/0283-move-zeroes
0283-move-zeroes	https://github.com/0general/LeetCode/tree/main/0283-move-zeroes
0300-longest-increasing-subsequence	https://github.com/0general/LeetCode/tree/main/0300-longest-increasing-subsequence
0300-longest-increasing-subsequence	https://github.com/0general/LeetCode/tree/main/0300-longest-increasing-subsequence
0304-range-sum-query-2d-immutable	https://github.com/0general/LeetCode/tree/main/0304-range-sum-query-2d-immutable
0304-range-sum-query-2d-immutable	https://github.com/0general/LeetCode/tree/main/0304-range-sum-query-2d-immutable
0309-best-time-to-buy-and-sell-stock-with-cooldown	https://github.com/0general/LeetCode/tree/main/0309-best-time-to-buy-and-sell-stock-with-cooldown
0309-best-time-to-buy-and-sell-stock-with-cooldown	https://github.com/0general/LeetCode/tree/main/0309-best-time-to-buy-and-sell-stock-with-cooldown
0313-super-ugly-number	https://github.com/0general/LeetCode/tree/main/0313-super-ugly-number
0313-super-ugly-number	https://github.com/0general/LeetCode/tree/main/0313-super-ugly-number
0319-bulb-switcher	https://github.com/0general/LeetCode/tree/main/0319-bulb-switcher
0319-bulb-switcher	https://github.com/0general/LeetCode/tree/main/0319-bulb-switcher
0322-coin-change	https://github.com/0general/LeetCode/tree/main/0322-coin-change
0322-coin-change	https://github.com/0general/LeetCode/tree/main/0322-coin-change
0328-odd-even-linked-list	https://github.com/0general/LeetCode/tree/main/0328-odd-even-linked-list
0328-odd-even-linked-list	https://github.com/0general/LeetCode/tree/main/0328-odd-even-linked-list
0338-counting-bits	https://github.com/0general/LeetCode/tree/main/0338-counting-bits
0338-counting-bits	https://github.com/0general/LeetCode/tree/main/0338-counting-bits
0344-reverse-string	https://github.com/0general/LeetCode/tree/main/0344-reverse-string
0344-reverse-string	https://github.com/0general/LeetCode/tree/main/0344-reverse-string
0347-top-k-frequent-elements	https://github.com/0general/LeetCode/tree/main/0347-top-k-frequent-elements
0347-top-k-frequent-elements	https://github.com/0general/LeetCode/tree/main/0347-top-k-frequent-elements
0355-design-twitter	https://github.com/0general/LeetCode/tree/main/0355-design-twitter
0355-design-twitter	https://github.com/0general/LeetCode/tree/main/0355-design-twitter
0376-wiggle-subsequence	https://github.com/0general/LeetCode/tree/main/0376-wiggle-subsequence
0376-wiggle-subsequence	https://github.com/0general/LeetCode/tree/main/0376-wiggle-subsequence
0414-third-maximum-number	https://github.com/0general/LeetCode/tree/main/0414-third-maximum-number
0414-third-maximum-number	https://github.com/0general/LeetCode/tree/main/0414-third-maximum-number
0416-partition-equal-subset-sum	https://github.com/0general/LeetCode/tree/main/0416-partition-equal-subset-sum
0416-partition-equal-subset-sum	https://github.com/0general/LeetCode/tree/main/0416-partition-equal-subset-sum
0424-longest-repeating-character-replacement	https://github.com/0general/LeetCode/tree/main/0424-longest-repeating-character-replacement
0424-longest-repeating-character-replacement	https://github.com/0general/LeetCode/tree/main/0424-longest-repeating-character-replacement
0430-flatten-a-multilevel-doubly-linked-list	https://github.com/0general/LeetCode/tree/main/0430-flatten-a-multilevel-doubly-linked-list
0430-flatten-a-multilevel-doubly-linked-list	https://github.com/0general/LeetCode/tree/main/0430-flatten-a-multilevel-doubly-linked-list
0435-non-overlapping-intervals	https://github.com/0general/LeetCode/tree/main/0435-non-overlapping-intervals
0435-non-overlapping-intervals	https://github.com/0general/LeetCode/tree/main/0435-non-overlapping-intervals
0436-find-right-interval	https://github.com/0general/LeetCode/tree/main/0436-find-right-interval
0436-find-right-interval	https://github.com/0general/LeetCode/tree/main/0436-find-right-interval
0450-delete-node-in-a-bst	https://github.com/0general/LeetCode/tree/main/0450-delete-node-in-a-bst
0450-delete-node-in-a-bst	https://github.com/0general/LeetCode/tree/main/0450-delete-node-in-a-bst
0452-minimum-number-of-arrows-to-burst-balloons	https://github.com/0general/LeetCode/tree/main/0452-minimum-number-of-arrows-to-burst-balloons
0452-minimum-number-of-arrows-to-burst-balloons	https://github.com/0general/LeetCode/tree/main/0452-minimum-number-of-arrows-to-burst-balloons
0456-132-pattern	https://github.com/0general/LeetCode/tree/main/0456-132-pattern
0456-132-pattern	https://github.com/0general/LeetCode/tree/main/0456-132-pattern
0473-matchsticks-to-square	https://github.com/0general/LeetCode/tree/main/0473-matchsticks-to-square
0473-matchsticks-to-square	https://github.com/0general/LeetCode/tree/main/0473-matchsticks-to-square
0480-sliding-window-median	https://github.com/0general/LeetCode/tree/main/0480-sliding-window-median
0480-sliding-window-median	https://github.com/0general/LeetCode/tree/main/0480-sliding-window-median
0485-max-consecutive-ones	https://github.com/0general/LeetCode/tree/main/0485-max-consecutive-ones
0485-max-consecutive-ones	https://github.com/0general/LeetCode/tree/main/0485-max-consecutive-ones
0486-predict-the-winner	https://github.com/0general/LeetCode/tree/main/0486-predict-the-winner
0486-predict-the-winner	https://github.com/0general/LeetCode/tree/main/0486-predict-the-winner
0494-target-sum	https://github.com/0general/LeetCode/tree/main/0494-target-sum
0494-target-sum	https://github.com/0general/LeetCode/tree/main/0494-target-sum
0513-find-bottom-left-tree-value	https://github.com/0general/LeetCode/tree/main/0513-find-bottom-left-tree-value
0513-find-bottom-left-tree-value	https://github.com/0general/LeetCode/tree/main/0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row	https://github.com/0general/LeetCode/tree/main/0515-find-largest-value-in-each-tree-row
0515-find-largest-value-in-each-tree-row	https://github.com/0general/LeetCode/tree/main/0515-find-largest-value-in-each-tree-row
0523-continuous-subarray-sum	https://github.com/0general/LeetCode/tree/main/0523-continuous-subarray-sum
0523-continuous-subarray-sum	https://github.com/0general/LeetCode/tree/main/0523-continuous-subarray-sum
0542-01-matrix	https://github.com/0general/LeetCode/tree/main/0542-01-matrix
0542-01-matrix	https://github.com/0general/LeetCode/tree/main/0542-01-matrix
0547-number-of-provinces	https://github.com/0general/LeetCode/tree/main/0547-number-of-provinces
0547-number-of-provinces	https://github.com/0general/LeetCode/tree/main/0547-number-of-provinces
0551-student-attendance-record-i	https://github.com/0general/LeetCode/tree/main/0551-student-attendance-record-i
0551-student-attendance-record-i	https://github.com/0general/LeetCode/tree/main/0551-student-attendance-record-i
0561-array-partition	https://github.com/0general/LeetCode/tree/main/0561-array-partition
0561-array-partition	https://github.com/0general/LeetCode/tree/main/0561-array-partition
0567-permutation-in-string	https://github.com/0general/LeetCode/tree/main/0567-permutation-in-string
0567-permutation-in-string	https://github.com/0general/LeetCode/tree/main/0567-permutation-in-string
0572-subtree-of-another-tree	https://github.com/0general/LeetCode/tree/main/0572-subtree-of-another-tree
0572-subtree-of-another-tree	https://github.com/0general/LeetCode/tree/main/0572-subtree-of-another-tree
0605-can-place-flowers	https://github.com/0general/LeetCode/tree/main/0605-can-place-flowers
0605-can-place-flowers	https://github.com/0general/LeetCode/tree/main/0605-can-place-flowers
0606-construct-string-from-binary-tree	https://github.com/0general/LeetCode/tree/main/0606-construct-string-from-binary-tree
0606-construct-string-from-binary-tree	https://github.com/0general/LeetCode/tree/main/0606-construct-string-from-binary-tree
0621-task-scheduler	https://github.com/0general/LeetCode/tree/main/0621-task-scheduler
0621-task-scheduler	https://github.com/0general/LeetCode/tree/main/0621-task-scheduler
0622-design-circular-queue	https://github.com/0general/LeetCode/tree/main/0622-design-circular-queue
0622-design-circular-queue	https://github.com/0general/LeetCode/tree/main/0622-design-circular-queue
0645-set-mismatch	https://github.com/0general/LeetCode/tree/main/0645-set-mismatch
0645-set-mismatch	https://github.com/0general/LeetCode/tree/main/0645-set-mismatch
0657-robot-return-to-origin	https://github.com/0general/LeetCode/tree/main/0657-robot-return-to-origin
0657-robot-return-to-origin	https://github.com/0general/LeetCode/tree/main/0657-robot-return-to-origin
0658-find-k-closest-elements	https://github.com/0general/LeetCode/tree/main/0658-find-k-closest-elements
0658-find-k-closest-elements	https://github.com/0general/LeetCode/tree/main/0658-find-k-closest-elements
0659-split-array-into-consecutive-subsequences	https://github.com/0general/LeetCode/tree/main/0659-split-array-into-consecutive-subsequences
0659-split-array-into-consecutive-subsequences	https://github.com/0general/LeetCode/tree/main/0659-split-array-into-consecutive-subsequences
0671-second-minimum-node-in-a-binary-tree	https://github.com/0general/LeetCode/tree/main/0671-second-minimum-node-in-a-binary-tree
0671-second-minimum-node-in-a-binary-tree	https://github.com/0general/LeetCode/tree/main/0671-second-minimum-node-in-a-binary-tree
0676-implement-magic-dictionary	https://github.com/0general/LeetCode/tree/main/0676-implement-magic-dictionary
0676-implement-magic-dictionary	https://github.com/0general/LeetCode/tree/main/0676-implement-magic-dictionary
0678-valid-parenthesis-string	https://github.com/0general/LeetCode/tree/main/0678-valid-parenthesis-string
0678-valid-parenthesis-string	https://github.com/0general/LeetCode/tree/main/0678-valid-parenthesis-string
0684-redundant-connection	https://github.com/0general/LeetCode/tree/main/0684-redundant-connection
0684-redundant-connection	https://github.com/0general/LeetCode/tree/main/0684-redundant-connection
0693-binary-number-with-alternating-bits	https://github.com/0general/LeetCode/tree/main/0693-binary-number-with-alternating-bits
0693-binary-number-with-alternating-bits	https://github.com/0general/LeetCode/tree/main/0693-binary-number-with-alternating-bits
0695-max-area-of-island	https://github.com/0general/LeetCode/tree/main/0695-max-area-of-island
0695-max-area-of-island	https://github.com/0general/LeetCode/tree/main/0695-max-area-of-island
0698-partition-to-k-equal-sum-subsets	https://github.com/0general/LeetCode/tree/main/0698-partition-to-k-equal-sum-subsets
0698-partition-to-k-equal-sum-subsets	https://github.com/0general/LeetCode/tree/main/0698-partition-to-k-equal-sum-subsets
0703-kth-largest-element-in-a-stream	https://github.com/0general/LeetCode/tree/main/0703-kth-largest-element-in-a-stream
0703-kth-largest-element-in-a-stream	https://github.com/0general/LeetCode/tree/main/0703-kth-largest-element-in-a-stream
README	https://github.com/0general/LeetCode
LeetHub v2	https://github.com/arunbhardwaj/LeetHub-2.0
	https://github.com/0general/LeetCode#leetcode-topics
	https://github.com/0general/LeetCode#array
0051-n-queens	https://github.com/0general/LeetCode/tree/master/0051-n-queens
0137-single-number-ii	https://github.com/0general/LeetCode/tree/master/0137-single-number-ii
0167-two-sum-ii-input-array-is-sorted	https://github.com/0general/LeetCode/tree/master/0167-two-sum-ii-input-array-is-sorted
0228-summary-ranges	https://github.com/0general/LeetCode/tree/master/0228-summary-ranges
0376-wiggle-subsequence	https://github.com/0general/LeetCode/tree/master/0376-wiggle-subsequence
0414-third-maximum-number	https://github.com/0general/LeetCode/tree/master/0414-third-maximum-number
0561-array-partition	https://github.com/0general/LeetCode/tree/master/0561-array-partition
0779-max-chunks-to-make-sorted-ii	https://github.com/0general/LeetCode/tree/master/0779-max-chunks-to-make-sorted-ii
0821-bricks-falling-when-hit	https://github.com/0general/LeetCode/tree/master/0821-bricks-falling-when-hit
0833-bus-routes	https://github.com/0general/LeetCode/tree/master/0833-bus-routes
0879-maximize-distance-to-closest-person	https://github.com/0general/LeetCode/tree/master/0879-maximize-distance-to-closest-person
0892-surface-area-of-3d-shapes	https://github.com/0general/LeetCode/tree/master/0892-surface-area-of-3d-shapes
1111-minimum-score-triangulation-of-polygon	https://github.com/0general/LeetCode/tree/master/1111-minimum-score-triangulation-of-polygon
1310-watering-plants	https://github.com/0general/LeetCode/tree/master/1310-watering-plants
1324-where-will-the-ball-fall	https://github.com/0general/LeetCode/tree/master/1324-where-will-the-ball-fall
1396-count-servers-that-communicate	https://github.com/0general/LeetCode/tree/master/1396-count-servers-that-communicate
1573-find-two-non-overlapping-sub-arrays-each-with-target-sum	https://github.com/0general/LeetCode/tree/master/1573-find-two-non-overlapping-sub-arrays-each-with-target-sum
1582-design-browser-history	https://github.com/0general/LeetCode/tree/master/1582-design-browser-history
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array	https://github.com/0general/LeetCode/tree/master/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
1679-shortest-subarray-to-be-removed-to-make-array-sorted	https://github.com/0general/LeetCode/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted
1684-count-the-number-of-consistent-strings	https://github.com/0general/LeetCode/tree/master/1684-count-the-number-of-consistent-strings
1705-maximum-number-of-eaten-apples	https://github.com/0general/LeetCode/tree/master/1705-maximum-number-of-eaten-apples
1760-minimum-limit-of-balls-in-a-bag	https://github.com/0general/LeetCode/tree/master/1760-minimum-limit-of-balls-in-a-bag
1848-sum-of-unique-elements	https://github.com/0general/LeetCode/tree/master/1848-sum-of-unique-elements
1849-maximum-absolute-sum-of-any-subarray	https://github.com/0general/LeetCode/tree/master/1849-maximum-absolute-sum-of-any-subarray
2119-minimum-number-of-operations-to-make-array-continuous	https://github.com/0general/LeetCode/tree/master/2119-minimum-number-of-operations-to-make-array-continuous
2193-count-fertile-pyramids-in-a-land	https://github.com/0general/LeetCode/tree/master/2193-count-fertile-pyramids-in-a-land
2465-shifting-letters-ii	https://github.com/0general/LeetCode/tree/master/2465-shifting-letters-ii
2480-find-subarrays-with-equal-sum	https://github.com/0general/LeetCode/tree/master/2480-find-subarrays-with-equal-sum
2846-robot-collisions	https://github.com/0general/LeetCode/tree/master/2846-robot-collisions
2854-decremental-string-concatenation	https://github.com/0general/LeetCode/tree/master/2854-decremental-string-concatenation
3225-length-of-longest-subarray-with-at-most-k-frequency	https://github.com/0general/LeetCode/tree/master/3225-length-of-longest-subarray-with-at-most-k-frequency
3241-divide-array-into-arrays-with-max-difference	https://github.com/0general/LeetCode/tree/master/3241-divide-array-into-arrays-with-max-difference
3525-maximum-energy-boost-from-two-drinks	https://github.com/0general/LeetCode/tree/master/3525-maximum-energy-boost-from-two-drinks
	https://github.com/0general/LeetCode#string
0127-word-ladder	https://github.com/0general/LeetCode/tree/master/0127-word-ladder
0168-excel-sheet-column-title	https://github.com/0general/LeetCode/tree/master/0168-excel-sheet-column-title
0211-design-add-and-search-words-data-structure	https://github.com/0general/LeetCode/tree/master/0211-design-add-and-search-words-data-structure
0657-robot-return-to-origin	https://github.com/0general/LeetCode/tree/master/0657-robot-return-to-origin
0857-positions-of-large-groups	https://github.com/0general/LeetCode/tree/master/0857-positions-of-large-groups
1250-longest-common-subsequence	https://github.com/0general/LeetCode/tree/master/1250-longest-common-subsequence
1351-replace-the-substring-for-balanced-string	https://github.com/0general/LeetCode/tree/master/1351-replace-the-substring-for-balanced-string
1430-find-the-k-beauty-of-a-number	https://github.com/0general/LeetCode/tree/master/1430-find-the-k-beauty-of-a-number
1454-remove-palindromic-subsequences	https://github.com/0general/LeetCode/tree/master/1454-remove-palindromic-subsequences
1460-number-of-substrings-containing-all-three-characters	https://github.com/0general/LeetCode/tree/master/1460-number-of-substrings-containing-all-three-characters
1532-reformat-the-string	https://github.com/0general/LeetCode/tree/master/1532-reformat-the-string
1632-number-of-good-ways-to-split-a-string	https://github.com/0general/LeetCode/tree/master/1632-number-of-good-ways-to-split-a-string
1684-count-the-number-of-consistent-strings	https://github.com/0general/LeetCode/tree/master/1684-count-the-number-of-consistent-strings
1915-check-if-one-string-swap-can-make-strings-equal	https://github.com/0general/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal
2002-maximum-product-of-the-length-of-two-palindromic-subsequences	https://github.com/0general/LeetCode/tree/master/2002-maximum-product-of-the-length-of-two-palindromic-subsequences
2032-largest-odd-number-in-string	https://github.com/0general/LeetCode/tree/master/2032-largest-odd-number-in-string
2226-rings-and-rods	https://github.com/0general/LeetCode/tree/master/2226-rings-and-rods
2465-shifting-letters-ii	https://github.com/0general/LeetCode/tree/master/2465-shifting-letters-ii
2854-decremental-string-concatenation	https://github.com/0general/LeetCode/tree/master/2854-decremental-string-concatenation
	https://github.com/0general/LeetCode#prefix-sum
2465-shifting-letters-ii	https://github.com/0general/LeetCode/tree/master/2465-shifting-letters-ii
	https://github.com/0general/LeetCode#depth-first-search
0111-minimum-depth-of-binary-tree	https://github.com/0general/LeetCode/tree/master/0111-minimum-depth-of-binary-tree
0211-design-add-and-search-words-data-structure	https://github.com/0general/LeetCode/tree/master/0211-design-add-and-search-words-data-structure
0513-find-bottom-left-tree-value	https://github.com/0general/LeetCode/tree/master/0513-find-bottom-left-tree-value
0797-all-paths-from-source-to-target	https://github.com/0general/LeetCode/tree/master/0797-all-paths-from-source-to-target
1396-count-servers-that-communicate	https://github.com/0general/LeetCode/tree/master/1396-count-servers-that-communicate
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph	https://github.com/0general/LeetCode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1442-number-of-operations-to-make-network-connected	https://github.com/0general/LeetCode/tree/master/1442-number-of-operations-to-make-network-connected
1493-frog-position-after-t-seconds	https://github.com/0general/LeetCode/tree/master/1493-frog-position-after-t-seconds
1554-minimum-time-to-collect-all-apples-in-a-tree	https://github.com/0general/LeetCode/tree/master/1554-minimum-time-to-collect-all-apples-in-a-tree
2793-count-the-number-of-complete-components	https://github.com/0general/LeetCode/tree/master/2793-count-the-number-of-complete-components
	https://github.com/0general/LeetCode#breadth-first-search
0103-binary-tree-zigzag-level-order-traversal	https://github.com/0general/LeetCode/tree/master/0103-binary-tree-zigzag-level-order-traversal
0111-minimum-depth-of-binary-tree	https://github.com/0general/LeetCode/tree/master/0111-minimum-depth-of-binary-tree
0127-word-ladder	https://github.com/0general/LeetCode/tree/master/0127-word-ladder
0513-find-bottom-left-tree-value	https://github.com/0general/LeetCode/tree/master/0513-find-bottom-left-tree-value
0797-all-paths-from-source-to-target	https://github.com/0general/LeetCode/tree/master/0797-all-paths-from-source-to-target
0833-bus-routes	https://github.com/0general/LeetCode/tree/master/0833-bus-routes
1396-count-servers-that-communicate	https://github.com/0general/LeetCode/tree/master/1396-count-servers-that-communicate
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph	https://github.com/0general/LeetCode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1442-number-of-operations-to-make-network-connected	https://github.com/0general/LeetCode/tree/master/1442-number-of-operations-to-make-network-connected
1493-frog-position-after-t-seconds	https://github.com/0general/LeetCode/tree/master/1493-frog-position-after-t-seconds
1554-minimum-time-to-collect-all-apples-in-a-tree	https://github.com/0general/LeetCode/tree/master/1554-minimum-time-to-collect-all-apples-in-a-tree
2793-count-the-number-of-complete-components	https://github.com/0general/LeetCode/tree/master/2793-count-the-number-of-complete-components
	https://github.com/0general/LeetCode#union-find
0821-bricks-falling-when-hit	https://github.com/0general/LeetCode/tree/master/0821-bricks-falling-when-hit
1396-count-servers-that-communicate	https://github.com/0general/LeetCode/tree/master/1396-count-servers-that-communicate
1442-number-of-operations-to-make-network-connected	https://github.com/0general/LeetCode/tree/master/1442-number-of-operations-to-make-network-connected
2793-count-the-number-of-complete-components	https://github.com/0general/LeetCode/tree/master/2793-count-the-number-of-complete-components
	https://github.com/0general/LeetCode#graph
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph	https://github.com/0general/LeetCode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1442-number-of-operations-to-make-network-connected	https://github.com/0general/LeetCode/tree/master/1442-number-of-operations-to-make-network-connected
1493-frog-position-after-t-seconds	https://github.com/0general/LeetCode/tree/master/1493-frog-position-after-t-seconds
2678-design-graph-with-shortest-path-calculator	https://github.com/0general/LeetCode/tree/master/2678-design-graph-with-shortest-path-calculator
2793-count-the-number-of-complete-components	https://github.com/0general/LeetCode/tree/master/2793-count-the-number-of-complete-components
	https://github.com/0general/LeetCode#dynamic-programming
0376-wiggle-subsequence	https://github.com/0general/LeetCode/tree/master/0376-wiggle-subsequence
1111-minimum-score-triangulation-of-polygon	https://github.com/0general/LeetCode/tree/master/1111-minimum-score-triangulation-of-polygon
1250-longest-common-subsequence	https://github.com/0general/LeetCode/tree/master/1250-longest-common-subsequence
1573-find-two-non-overlapping-sub-arrays-each-with-target-sum	https://github.com/0general/LeetCode/tree/master/1573-find-two-non-overlapping-sub-arrays-each-with-target-sum
1632-number-of-good-ways-to-split-a-string	https://github.com/0general/LeetCode/tree/master/1632-number-of-good-ways-to-split-a-string
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array	https://github.com/0general/LeetCode/tree/master/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
1849-maximum-absolute-sum-of-any-subarray	https://github.com/0general/LeetCode/tree/master/1849-maximum-absolute-sum-of-any-subarray
2002-maximum-product-of-the-length-of-two-palindromic-subsequences	https://github.com/0general/LeetCode/tree/master/2002-maximum-product-of-the-length-of-two-palindromic-subsequences
2193-count-fertile-pyramids-in-a-land	https://github.com/0general/LeetCode/tree/master/2193-count-fertile-pyramids-in-a-land
2854-decremental-string-concatenation	https://github.com/0general/LeetCode/tree/master/2854-decremental-string-concatenation
3525-maximum-energy-boost-from-two-drinks	https://github.com/0general/LeetCode/tree/master/3525-maximum-energy-boost-from-two-drinks
	https://github.com/0general/LeetCode#greedy
0376-wiggle-subsequence	https://github.com/0general/LeetCode/tree/master/0376-wiggle-subsequence
0561-array-partition	https://github.com/0general/LeetCode/tree/master/0561-array-partition
0779-max-chunks-to-make-sorted-ii	https://github.com/0general/LeetCode/tree/master/0779-max-chunks-to-make-sorted-ii
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array	https://github.com/0general/LeetCode/tree/master/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
1705-maximum-number-of-eaten-apples	https://github.com/0general/LeetCode/tree/master/1705-maximum-number-of-eaten-apples
2032-largest-odd-number-in-string	https://github.com/0general/LeetCode/tree/master/2032-largest-odd-number-in-string
3241-divide-array-into-arrays-with-max-difference	https://github.com/0general/LeetCode/tree/master/3241-divide-array-into-arrays-with-max-difference
	https://github.com/0general/LeetCode#simulation
0657-robot-return-to-origin	https://github.com/0general/LeetCode/tree/master/0657-robot-return-to-origin
1310-watering-plants	https://github.com/0general/LeetCode/tree/master/1310-watering-plants
1324-where-will-the-ball-fall	https://github.com/0general/LeetCode/tree/master/1324-where-will-the-ball-fall
2846-robot-collisions	https://github.com/0general/LeetCode/tree/master/2846-robot-collisions
	https://github.com/0general/LeetCode#hash-table
0127-word-ladder	https://github.com/0general/LeetCode/tree/master/0127-word-ladder
0833-bus-routes	https://github.com/0general/LeetCode/tree/master/0833-bus-routes
1064-smallest-integer-divisible-by-k	https://github.com/0general/LeetCode/tree/master/1064-smallest-integer-divisible-by-k
1460-number-of-substrings-containing-all-three-characters	https://github.com/0general/LeetCode/tree/master/1460-number-of-substrings-containing-all-three-characters
1554-minimum-time-to-collect-all-apples-in-a-tree	https://github.com/0general/LeetCode/tree/master/1554-minimum-time-to-collect-all-apples-in-a-tree
1573-find-two-non-overlapping-sub-arrays-each-with-target-sum	https://github.com/0general/LeetCode/tree/master/1573-find-two-non-overlapping-sub-arrays-each-with-target-sum
1632-number-of-good-ways-to-split-a-string	https://github.com/0general/LeetCode/tree/master/1632-number-of-good-ways-to-split-a-string
1684-count-the-number-of-consistent-strings	https://github.com/0general/LeetCode/tree/master/1684-count-the-number-of-consistent-strings
1848-sum-of-unique-elements	https://github.com/0general/LeetCode/tree/master/1848-sum-of-unique-elements
1915-check-if-one-string-swap-can-make-strings-equal	https://github.com/0general/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal
2119-minimum-number-of-operations-to-make-array-continuous	https://github.com/0general/LeetCode/tree/master/2119-minimum-number-of-operations-to-make-array-continuous
2226-rings-and-rods	https://github.com/0general/LeetCode/tree/master/2226-rings-and-rods
2480-find-subarrays-with-equal-sum	https://github.com/0general/LeetCode/tree/master/2480-find-subarrays-with-equal-sum
3225-length-of-longest-subarray-with-at-most-k-frequency	https://github.com/0general/LeetCode/tree/master/3225-length-of-longest-subarray-with-at-most-k-frequency
	https://github.com/0general/LeetCode#binary-search
0167-two-sum-ii-input-array-is-sorted	https://github.com/0general/LeetCode/tree/master/0167-two-sum-ii-input-array-is-sorted
1573-find-two-non-overlapping-sub-arrays-each-with-target-sum	https://github.com/0general/LeetCode/tree/master/1573-find-two-non-overlapping-sub-arrays-each-with-target-sum
1679-shortest-subarray-to-be-removed-to-make-array-sorted	https://github.com/0general/LeetCode/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted
1760-minimum-limit-of-balls-in-a-bag	https://github.com/0general/LeetCode/tree/master/1760-minimum-limit-of-balls-in-a-bag
2119-minimum-number-of-operations-to-make-array-continuous	https://github.com/0general/LeetCode/tree/master/2119-minimum-number-of-operations-to-make-array-continuous
	https://github.com/0general/LeetCode#sliding-window
1351-replace-the-substring-for-balanced-string	https://github.com/0general/LeetCode/tree/master/1351-replace-the-substring-for-balanced-string
1430-find-the-k-beauty-of-a-number	https://github.com/0general/LeetCode/tree/master/1430-find-the-k-beauty-of-a-number
1460-number-of-substrings-containing-all-three-characters	https://github.com/0general/LeetCode/tree/master/1460-number-of-substrings-containing-all-three-characters
1573-find-two-non-overlapping-sub-arrays-each-with-target-sum	https://github.com/0general/LeetCode/tree/master/1573-find-two-non-overlapping-sub-arrays-each-with-target-sum
2119-minimum-number-of-operations-to-make-array-continuous	https://github.com/0general/LeetCode/tree/master/2119-minimum-number-of-operations-to-make-array-continuous
3225-length-of-longest-subarray-with-at-most-k-frequency	https://github.com/0general/LeetCode/tree/master/3225-length-of-longest-subarray-with-at-most-k-frequency
	https://github.com/0general/LeetCode#tree
0103-binary-tree-zigzag-level-order-traversal	https://github.com/0general/LeetCode/tree/master/0103-binary-tree-zigzag-level-order-traversal
0111-minimum-depth-of-binary-tree	https://github.com/0general/LeetCode/tree/master/0111-minimum-depth-of-binary-tree
0450-delete-node-in-a-bst	https://github.com/0general/LeetCode/tree/master/0450-delete-node-in-a-bst
0513-find-bottom-left-tree-value	https://github.com/0general/LeetCode/tree/master/0513-find-bottom-left-tree-value
1493-frog-position-after-t-seconds	https://github.com/0general/LeetCode/tree/master/1493-frog-position-after-t-seconds
1554-minimum-time-to-collect-all-apples-in-a-tree	https://github.com/0general/LeetCode/tree/master/1554-minimum-time-to-collect-all-apples-in-a-tree
	https://github.com/0general/LeetCode#binary-tree
0103-binary-tree-zigzag-level-order-traversal	https://github.com/0general/LeetCode/tree/master/0103-binary-tree-zigzag-level-order-traversal
0111-minimum-depth-of-binary-tree	https://github.com/0general/LeetCode/tree/master/0111-minimum-depth-of-binary-tree
0450-delete-node-in-a-bst	https://github.com/0general/LeetCode/tree/master/0450-delete-node-in-a-bst
0513-find-bottom-left-tree-value	https://github.com/0general/LeetCode/tree/master/0513-find-bottom-left-tree-value
	https://github.com/0general/LeetCode#sorting
0414-third-maximum-number	https://github.com/0general/LeetCode/tree/master/0414-third-maximum-number
0561-array-partition	https://github.com/0general/LeetCode/tree/master/0561-array-partition
0779-max-chunks-to-make-sorted-ii	https://github.com/0general/LeetCode/tree/master/0779-max-chunks-to-make-sorted-ii
2846-robot-collisions	https://github.com/0general/LeetCode/tree/master/2846-robot-collisions
3241-divide-array-into-arrays-with-max-difference	https://github.com/0general/LeetCode/tree/master/3241-divide-array-into-arrays-with-max-difference
	https://github.com/0general/LeetCode#counting-sort
0561-array-partition	https://github.com/0general/LeetCode/tree/master/0561-array-partition
1396-count-servers-that-communicate	https://github.com/0general/LeetCode/tree/master/1396-count-servers-that-communicate
1684-count-the-number-of-consistent-strings	https://github.com/0general/LeetCode/tree/master/1684-count-the-number-of-consistent-strings
1848-sum-of-unique-elements	https://github.com/0general/LeetCode/tree/master/1848-sum-of-unique-elements
1915-check-if-one-string-swap-can-make-strings-equal	https://github.com/0general/LeetCode/tree/master/1915-check-if-one-string-swap-can-make-strings-equal
	https://github.com/0general/LeetCode#binary-search-tree
0450-delete-node-in-a-bst	https://github.com/0general/LeetCode/tree/master/0450-delete-node-in-a-bst
	https://github.com/0general/LeetCode#math
0168-excel-sheet-column-title	https://github.com/0general/LeetCode/tree/master/0168-excel-sheet-column-title
0319-bulb-switcher	https://github.com/0general/LeetCode/tree/master/0319-bulb-switcher
0892-surface-area-of-3d-shapes	https://github.com/0general/LeetCode/tree/master/0892-surface-area-of-3d-shapes
1064-smallest-integer-divisible-by-k	https://github.com/0general/LeetCode/tree/master/1064-smallest-integer-divisible-by-k
1430-find-the-k-beauty-of-a-number	https://github.com/0general/LeetCode/tree/master/1430-find-the-k-beauty-of-a-number
2032-largest-odd-number-in-string	https://github.com/0general/LeetCode/tree/master/2032-largest-odd-number-in-string
	https://github.com/0general/LeetCode#topological-sort
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph	https://github.com/0general/LeetCode/tree/master/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
	https://github.com/0general/LeetCode#stack
0779-max-chunks-to-make-sorted-ii	https://github.com/0general/LeetCode/tree/master/0779-max-chunks-to-make-sorted-ii
1582-design-browser-history	https://github.com/0general/LeetCode/tree/master/1582-design-browser-history
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array	https://github.com/0general/LeetCode/tree/master/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
1679-shortest-subarray-to-be-removed-to-make-array-sorted	https://github.com/0general/LeetCode/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted
2846-robot-collisions	https://github.com/0general/LeetCode/tree/master/2846-robot-collisions
	https://github.com/0general/LeetCode#two-pointers
0167-two-sum-ii-input-array-is-sorted	https://github.com/0general/LeetCode/tree/master/0167-two-sum-ii-input-array-is-sorted
1454-remove-palindromic-subsequences	https://github.com/0general/LeetCode/tree/master/1454-remove-palindromic-subsequences
1679-shortest-subarray-to-be-removed-to-make-array-sorted	https://github.com/0general/LeetCode/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted
	https://github.com/0general/LeetCode#monotonic-stack
0779-max-chunks-to-make-sorted-ii	https://github.com/0general/LeetCode/tree/master/0779-max-chunks-to-make-sorted-ii
1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array	https://github.com/0general/LeetCode/tree/master/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array
1679-shortest-subarray-to-be-removed-to-make-array-sorted	https://github.com/0general/LeetCode/tree/master/1679-shortest-subarray-to-be-removed-to-make-array-sorted
	https://github.com/0general/LeetCode#linked-list
0092-reverse-linked-list-ii	https://github.com/0general/LeetCode/tree/master/0092-reverse-linked-list-ii
1582-design-browser-history	https://github.com/0general/LeetCode/tree/master/1582-design-browser-history
2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points	https://github.com/0general/LeetCode/tree/master/2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points
	https://github.com/0general/LeetCode#design
0211-design-add-and-search-words-data-structure	https://github.com/0general/LeetCode/tree/master/0211-design-add-and-search-words-data-structure
1582-design-browser-history	https://github.com/0general/LeetCode/tree/master/1582-design-browser-history
2678-design-graph-with-shortest-path-calculator	https://github.com/0general/LeetCode/tree/master/2678-design-graph-with-shortest-path-calculator
	https://github.com/0general/LeetCode#doubly-linked-list
1582-design-browser-history	https://github.com/0general/LeetCode/tree/master/1582-design-browser-history
	https://github.com/0general/LeetCode#data-stream
1582-design-browser-history	https://github.com/0general/LeetCode/tree/master/1582-design-browser-history
	https://github.com/0general/LeetCode#matrix
0821-bricks-falling-when-hit	https://github.com/0general/LeetCode/tree/master/0821-bricks-falling-when-hit
0892-surface-area-of-3d-shapes	https://github.com/0general/LeetCode/tree/master/0892-surface-area-of-3d-shapes
1324-where-will-the-ball-fall	https://github.com/0general/LeetCode/tree/master/1324-where-will-the-ball-fall
1396-count-servers-that-communicate	https://github.com/0general/LeetCode/tree/master/1396-count-servers-that-communicate
2193-count-fertile-pyramids-in-a-land	https://github.com/0general/LeetCode/tree/master/2193-count-fertile-pyramids-in-a-land
	https://github.com/0general/LeetCode#bit-manipulation
0137-single-number-ii	https://github.com/0general/LeetCode/tree/master/0137-single-number-ii
1632-number-of-good-ways-to-split-a-string	https://github.com/0general/LeetCode/tree/master/1632-number-of-good-ways-to-split-a-string
1684-count-the-number-of-consistent-strings	https://github.com/0general/LeetCode/tree/master/1684-count-the-number-of-consistent-strings
2002-maximum-product-of-the-length-of-two-palindromic-subsequences	https://github.com/0general/LeetCode/tree/master/2002-maximum-product-of-the-length-of-two-palindromic-subsequences
	https://github.com/0general/LeetCode#heap-priority-queue
1705-maximum-number-of-eaten-apples	https://github.com/0general/LeetCode/tree/master/1705-maximum-number-of-eaten-apples
2678-design-graph-with-shortest-path-calculator	https://github.com/0general/LeetCode/tree/master/2678-design-graph-with-shortest-path-calculator
	https://github.com/0general/LeetCode#shortest-path
2678-design-graph-with-shortest-path-calculator	https://github.com/0general/LeetCode/tree/master/2678-design-graph-with-shortest-path-calculator
	https://github.com/0general/LeetCode#backtracking
0051-n-queens	https://github.com/0general/LeetCode/tree/master/0051-n-queens
0797-all-paths-from-source-to-target	https://github.com/0general/LeetCode/tree/master/0797-all-paths-from-source-to-target
2002-maximum-product-of-the-length-of-two-palindromic-subsequences	https://github.com/0general/LeetCode/tree/master/2002-maximum-product-of-the-length-of-two-palindromic-subsequences
	https://github.com/0general/LeetCode#brainteaser
0319-bulb-switcher	https://github.com/0general/LeetCode/tree/master/0319-bulb-switcher
	https://github.com/0general/LeetCode#trie
0211-design-add-and-search-words-data-structure	https://github.com/0general/LeetCode/tree/master/0211-design-add-and-search-words-data-structure
	https://github.com/0general/LeetCode#bitmask
2002-maximum-product-of-the-length-of-two-palindromic-subsequences	https://github.com/0general/LeetCode/tree/master/2002-maximum-product-of-the-length-of-two-palindromic-subsequences
	https://github.com/0general/LeetCode#graph-theory
0797-all-paths-from-source-to-target	https://github.com/0general/LeetCode/tree/master/0797-all-paths-from-source-to-target
	https://github.com/0general/LeetCode#geometry
0892-surface-area-of-3d-shapes	https://github.com/0general/LeetCode/tree/master/0892-surface-area-of-3d-shapes
Readme	https://github.com/0general/LeetCode#readme-ov-file
Please reload this page	https://github.com/0general/LeetCode
Activity	https://github.com/0general/LeetCode/activity
0 forks	https://github.com/0general/LeetCode/forks
Report repository	https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2F0general%2FLeetCode&report=0general+%28user%29
Releases	https://github.com/0general/LeetCode/releases
Packages 0	https://github.com/users/0general/packages?repo_name=LeetCode
Please reload this page	https://github.com/0general/LeetCode
Contributors	https://github.com/0general/LeetCode/graphs/contributors
Please reload this page	https://github.com/0general/LeetCode
Python 99.8%	https://github.com/0general/LeetCode/search?l=python
JavaScript 0.2%	https://github.com/0general/LeetCode/search?l=javascript
	https://github.com
Terms	https://docs.github.com/site-policy/github-terms/github-terms-of-service
Privacy	https://docs.github.com/site-policy/privacy-policies/github-privacy-statement
Security	https://github.com/security
Status	https://www.githubstatus.com/
Community	https://github.community/
Docs	https://docs.github.com/
Contact	https://support.github.com?tags=dotcom-footer

Viewport: width=device-width

URLs of crawlers that visited me.