René's URL Explorer Experiment

Title: GitHub - browsnet/leetcode · GitHub

Open Graph Title: GitHub - browsnet/leetcode

X Title: GitHub - browsnet/leetcode

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

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

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

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

X: @github

direct link

Domain: github.com

route-pattern	/:user_id/:repository
route-controller	files
route-action	disambiguate
fetch-nonce	v2:8d702ec6-0e1f-6c3d-2e58-1d84e3e95a73
current-catalog-service-hash	f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id	B814:1CCFD6:D37D96:12E94C7:6A5A0512
html-safe-nonce	3618ed2cc521f028c884a28c008ceb1a8ef5564b546eea5aca9d0806dbdc003c
visitor-payload	eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJCODE0OjFDQ0ZENjpEMzdEOTY6MTJFOTRDNzo2QTVBMDUxMiIsInZpc2l0b3JfaWQiOiI2NDUxMjg5OTU0MTE5NzE0MDY3IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmac	db51b0ebbe47a6aa44c5e19ec78381db38ca98b9bcfdd632d94930e6317720de
hovercard-subject-tag	repository:443494236
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/browsnet/leetcode
twitter:image	https://opengraph.githubassets.com/1b1aa0688cee439108e07a0121c924477da943250604f300074e4722ded06c22/browsnet/leetcode
twitter:card	summary_large_image
og:image	https://opengraph.githubassets.com/1b1aa0688cee439108e07a0121c924477da943250604f300074e4722ded06c22/browsnet/leetcode
og:image:alt	Contribute to browsnet/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	8c2fe7351e4e987cb8f75e2425a0b895d807779bc4c2d3c312be0a54082219f7
turbo-cache-control	no-cache
go-import	github.com/browsnet/leetcode git https://github.com/browsnet/leetcode.git
octolytics-dimension-user_id	3074608
octolytics-dimension-user_login	browsnet
octolytics-dimension-repository_id	443494236
octolytics-dimension-repository_nwo	browsnet/leetcode
octolytics-dimension-repository_public	true
octolytics-dimension-repository_is_fork	false
octolytics-dimension-repository_network_root_id	443494236
octolytics-dimension-repository_network_root_nwo	browsnet/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	491710c7a8eecca9d0a06bd157646f2685d8c87b
ui-target	full
theme-color	#1e2327
color-scheme	light dark

Links:

Skip to content	https://github.com/browsnet/leetcode#start-of-content
	https://github.com/
Sign in	https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fbrowsnet%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
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%2Fbrowsnet%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=browsnet%2Fleetcode
Reload	https://github.com/browsnet/leetcode
Reload	https://github.com/browsnet/leetcode
Reload	https://github.com/browsnet/leetcode
browsnet	https://github.com/browsnet
leetcode	https://github.com/browsnet/leetcode
Notifications	https://github.com/login?return_to=%2Fbrowsnet%2Fleetcode
Fork 0	https://github.com/login?return_to=%2Fbrowsnet%2Fleetcode
Star 3	https://github.com/login?return_to=%2Fbrowsnet%2Fleetcode
Code	https://github.com/browsnet/leetcode
Issues 0	https://github.com/browsnet/leetcode/issues
Pull requests 0	https://github.com/browsnet/leetcode/pulls
Actions	https://github.com/browsnet/leetcode/actions
Projects	https://github.com/browsnet/leetcode/projects
Security and quality 0	https://github.com/browsnet/leetcode/security
Insights	https://github.com/browsnet/leetcode/pulse
Code	https://github.com/browsnet/leetcode
Issues	https://github.com/browsnet/leetcode/issues
Pull requests	https://github.com/browsnet/leetcode/pulls
Actions	https://github.com/browsnet/leetcode/actions
Projects	https://github.com/browsnet/leetcode/projects
Security and quality	https://github.com/browsnet/leetcode/security
Insights	https://github.com/browsnet/leetcode/pulse
	https://github.com/browsnet/leetcode
Branches	https://github.com/browsnet/leetcode/branches
Tags	https://github.com/browsnet/leetcode/tags
	https://github.com/browsnet/leetcode/branches
	https://github.com/browsnet/leetcode/tags
126 Commits	https://github.com/browsnet/leetcode/commits/main/
	https://github.com/browsnet/leetcode/commits/main/
6003.	https://github.com/browsnet/leetcode/tree/main/6003.
6003.	https://github.com/browsnet/leetcode/tree/main/6003.
1001.grid-illumination.kt	https://github.com/browsnet/leetcode/blob/main/1001.grid-illumination.kt
1001.grid-illumination.kt	https://github.com/browsnet/leetcode/blob/main/1001.grid-illumination.kt
1036.escape-a-large-maze.kt	https://github.com/browsnet/leetcode/blob/main/1036.escape-a-large-maze.kt
1036.escape-a-large-maze.kt	https://github.com/browsnet/leetcode/blob/main/1036.escape-a-large-maze.kt
1047.number-of-submatrices-that-sum-to-target.kt	https://github.com/browsnet/leetcode/blob/main/1047.number-of-submatrices-that-sum-to-target.kt
1047.number-of-submatrices-that-sum-to-target.kt	https://github.com/browsnet/leetcode/blob/main/1047.number-of-submatrices-that-sum-to-target.kt
1063.number-of-valid-subarrays.kt	https://github.com/browsnet/leetcode/blob/main/1063.number-of-valid-subarrays.kt
1063.number-of-valid-subarrays.kt	https://github.com/browsnet/leetcode/blob/main/1063.number-of-valid-subarrays.kt
1091.shortest-path-in-binary-matrix.kt	https://github.com/browsnet/leetcode/blob/main/1091.shortest-path-in-binary-matrix.kt
1091.shortest-path-in-binary-matrix.kt	https://github.com/browsnet/leetcode/blob/main/1091.shortest-path-in-binary-matrix.kt
1145.binary-tree-coloring-game.kt	https://github.com/browsnet/leetcode/blob/main/1145.binary-tree-coloring-game.kt
1145.binary-tree-coloring-game.kt	https://github.com/browsnet/leetcode/blob/main/1145.binary-tree-coloring-game.kt
1146.snapshot-array.kt	https://github.com/browsnet/leetcode/blob/main/1146.snapshot-array.kt
1146.snapshot-array.kt	https://github.com/browsnet/leetcode/blob/main/1146.snapshot-array.kt
1147.longest-chunked-palindrome-decomposition.kt	https://github.com/browsnet/leetcode/blob/main/1147.longest-chunked-palindrome-decomposition.kt
1147.longest-chunked-palindrome-decomposition.kt	https://github.com/browsnet/leetcode/blob/main/1147.longest-chunked-palindrome-decomposition.kt
1162.as-far-from-land-as-possible.kt	https://github.com/browsnet/leetcode/blob/main/1162.as-far-from-land-as-possible.kt
1162.as-far-from-land-as-possible.kt	https://github.com/browsnet/leetcode/blob/main/1162.as-far-from-land-as-possible.kt
1219.path-with-maximum-gold.kt	https://github.com/browsnet/leetcode/blob/main/1219.path-with-maximum-gold.kt
1219.path-with-maximum-gold.kt	https://github.com/browsnet/leetcode/blob/main/1219.path-with-maximum-gold.kt
1220.count-vowels-permutation.kt	https://github.com/browsnet/leetcode/blob/main/1220.count-vowels-permutation.kt
1220.count-vowels-permutation.kt	https://github.com/browsnet/leetcode/blob/main/1220.count-vowels-permutation.kt
1235.maximum-profit-in-job-scheduling.kt	https://github.com/browsnet/leetcode/blob/main/1235.maximum-profit-in-job-scheduling.kt
1235.maximum-profit-in-job-scheduling.kt	https://github.com/browsnet/leetcode/blob/main/1235.maximum-profit-in-job-scheduling.kt
1246.palindrome-removal.kt	https://github.com/browsnet/leetcode/blob/main/1246.palindrome-removal.kt
1246.palindrome-removal.kt	https://github.com/browsnet/leetcode/blob/main/1246.palindrome-removal.kt
1255.maximum-score-words-formed-by-letters.kt	https://github.com/browsnet/leetcode/blob/main/1255.maximum-score-words-formed-by-letters.kt
1255.maximum-score-words-formed-by-letters.kt	https://github.com/browsnet/leetcode/blob/main/1255.maximum-score-words-formed-by-letters.kt
1259.handshakes-that-dont-cross.kt	https://github.com/browsnet/leetcode/blob/main/1259.handshakes-that-dont-cross.kt
1259.handshakes-that-dont-cross.kt	https://github.com/browsnet/leetcode/blob/main/1259.handshakes-that-dont-cross.kt
1274.number-of-ships-in-a-rectangle.kt	https://github.com/browsnet/leetcode/blob/main/1274.number-of-ships-in-a-rectangle.kt
1274.number-of-ships-in-a-rectangle.kt	https://github.com/browsnet/leetcode/blob/main/1274.number-of-ships-in-a-rectangle.kt
1289.minimum-falling-path-sum-ii.kt	https://github.com/browsnet/leetcode/blob/main/1289.minimum-falling-path-sum-ii.kt
1289.minimum-falling-path-sum-ii.kt	https://github.com/browsnet/leetcode/blob/main/1289.minimum-falling-path-sum-ii.kt
1314.matrix-block-sum.kt	https://github.com/browsnet/leetcode/blob/main/1314.matrix-block-sum.kt
1314.matrix-block-sum.kt	https://github.com/browsnet/leetcode/blob/main/1314.matrix-block-sum.kt
1335.minimum-difficulty-of-a-job-schedule.kt	https://github.com/browsnet/leetcode/blob/main/1335.minimum-difficulty-of-a-job-schedule.kt
1335.minimum-difficulty-of-a-job-schedule.kt	https://github.com/browsnet/leetcode/blob/main/1335.minimum-difficulty-of-a-job-schedule.kt
1345.jump-game-iv.kt	https://github.com/browsnet/leetcode/blob/main/1345.jump-game-iv.kt
1345.jump-game-iv.kt	https://github.com/browsnet/leetcode/blob/main/1345.jump-game-iv.kt
1388.pizza-with-3n-slices.kt	https://github.com/browsnet/leetcode/blob/main/1388.pizza-with-3n-slices.kt
1388.pizza-with-3n-slices.kt	https://github.com/browsnet/leetcode/blob/main/1388.pizza-with-3n-slices.kt
1414.find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k.kt	https://github.com/browsnet/leetcode/blob/main/1414.find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k.kt
1414.find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k.kt	https://github.com/browsnet/leetcode/blob/main/1414.find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k.kt
1425.constrained-subsequence-sum.kt	https://github.com/browsnet/leetcode/blob/main/1425.constrained-subsequence-sum.kt
1425.constrained-subsequence-sum.kt	https://github.com/browsnet/leetcode/blob/main/1425.constrained-subsequence-sum.kt
1463.cherry-pickup-ii.kt	https://github.com/browsnet/leetcode/blob/main/1463.cherry-pickup-ii.kt
1463.cherry-pickup-ii.kt	https://github.com/browsnet/leetcode/blob/main/1463.cherry-pickup-ii.kt
148.sort-list.kt	https://github.com/browsnet/leetcode/blob/main/148.sort-list.kt
148.sort-list.kt	https://github.com/browsnet/leetcode/blob/main/148.sort-list.kt
1537.get-the-maximum-score.kt	https://github.com/browsnet/leetcode/blob/main/1537.get-the-maximum-score.kt
1537.get-the-maximum-score.kt	https://github.com/browsnet/leetcode/blob/main/1537.get-the-maximum-score.kt
156.binary-tree-upside-down.kt	https://github.com/browsnet/leetcode/blob/main/156.binary-tree-upside-down.kt
156.binary-tree-upside-down.kt	https://github.com/browsnet/leetcode/blob/main/156.binary-tree-upside-down.kt
1594.maximum-non-negative-product-in-a-matrix.kt	https://github.com/browsnet/leetcode/blob/main/1594.maximum-non-negative-product-in-a-matrix.kt
1594.maximum-non-negative-product-in-a-matrix.kt	https://github.com/browsnet/leetcode/blob/main/1594.maximum-non-negative-product-in-a-matrix.kt
1604.alert-using-same-key-card-three-or-more-times-in-a-one-hour-period.kt	https://github.com/browsnet/leetcode/blob/main/1604.alert-using-same-key-card-three-or-more-times-in-a-one-hour-period.kt
1604.alert-using-same-key-card-three-or-more-times-in-a-one-hour-period.kt	https://github.com/browsnet/leetcode/blob/main/1604.alert-using-same-key-card-three-or-more-times-in-a-one-hour-period.kt
1649.create-sorted-array-through-instructions.kt	https://github.com/browsnet/leetcode/blob/main/1649.create-sorted-array-through-instructions.kt
1649.create-sorted-array-through-instructions.kt	https://github.com/browsnet/leetcode/blob/main/1649.create-sorted-array-through-instructions.kt
1688.count-of-matches-in-tournament.kt	https://github.com/browsnet/leetcode/blob/main/1688.count-of-matches-in-tournament.kt
1688.count-of-matches-in-tournament.kt	https://github.com/browsnet/leetcode/blob/main/1688.count-of-matches-in-tournament.kt
1689.partitioning-into-minimum-number-of-deci-binary-numbers.kt	https://github.com/browsnet/leetcode/blob/main/1689.partitioning-into-minimum-number-of-deci-binary-numbers.kt
1689.partitioning-into-minimum-number-of-deci-binary-numbers.kt	https://github.com/browsnet/leetcode/blob/main/1689.partitioning-into-minimum-number-of-deci-binary-numbers.kt
1690.stone-game-vii.kt	https://github.com/browsnet/leetcode/blob/main/1690.stone-game-vii.kt
1690.stone-game-vii.kt	https://github.com/browsnet/leetcode/blob/main/1690.stone-game-vii.kt
1691.maximum-height-by-stacking-cuboids.kt	https://github.com/browsnet/leetcode/blob/main/1691.maximum-height-by-stacking-cuboids.kt
1691.maximum-height-by-stacking-cuboids.kt	https://github.com/browsnet/leetcode/blob/main/1691.maximum-height-by-stacking-cuboids.kt
1703.minimum-adjacent-swaps-for-k-consecutive-ones.kt	https://github.com/browsnet/leetcode/blob/main/1703.minimum-adjacent-swaps-for-k-consecutive-ones.kt
1703.minimum-adjacent-swaps-for-k-consecutive-ones.kt	https://github.com/browsnet/leetcode/blob/main/1703.minimum-adjacent-swaps-for-k-consecutive-ones.kt
1706.where-will-the-ball-fall.kt	https://github.com/browsnet/leetcode/blob/main/1706.where-will-the-ball-fall.kt
1706.where-will-the-ball-fall.kt	https://github.com/browsnet/leetcode/blob/main/1706.where-will-the-ball-fall.kt
1719.number-of-ways-to-reconstruct-a-tree.kt	https://github.com/browsnet/leetcode/blob/main/1719.number-of-ways-to-reconstruct-a-tree.kt
1719.number-of-ways-to-reconstruct-a-tree.kt	https://github.com/browsnet/leetcode/blob/main/1719.number-of-ways-to-reconstruct-a-tree.kt
1754.largest-merge-of-two-strings.kt	https://github.com/browsnet/leetcode/blob/main/1754.largest-merge-of-two-strings.kt
1754.largest-merge-of-two-strings.kt	https://github.com/browsnet/leetcode/blob/main/1754.largest-merge-of-two-strings.kt
1759.count-number-of-homogenous-substrings.kt	https://github.com/browsnet/leetcode/blob/main/1759.count-number-of-homogenous-substrings.kt
1759.count-number-of-homogenous-substrings.kt	https://github.com/browsnet/leetcode/blob/main/1759.count-number-of-homogenous-substrings.kt
1761.minimum-degree-of-a-connected-trio-in-a-graph.kt	https://github.com/browsnet/leetcode/blob/main/1761.minimum-degree-of-a-connected-trio-in-a-graph.kt
1761.minimum-degree-of-a-connected-trio-in-a-graph.kt	https://github.com/browsnet/leetcode/blob/main/1761.minimum-degree-of-a-connected-trio-in-a-graph.kt
1764.form-array-by-concatenating-subarrays-of-another-array.kt	https://github.com/browsnet/leetcode/blob/main/1764.form-array-by-concatenating-subarrays-of-another-array.kt
1764.form-array-by-concatenating-subarrays-of-another-array.kt	https://github.com/browsnet/leetcode/blob/main/1764.form-array-by-concatenating-subarrays-of-another-array.kt
1765.map-of-highest-peak.kt	https://github.com/browsnet/leetcode/blob/main/1765.map-of-highest-peak.kt
1765.map-of-highest-peak.kt	https://github.com/browsnet/leetcode/blob/main/1765.map-of-highest-peak.kt
1766.tree-of-coprimes.kt	https://github.com/browsnet/leetcode/blob/main/1766.tree-of-coprimes.kt
1766.tree-of-coprimes.kt	https://github.com/browsnet/leetcode/blob/main/1766.tree-of-coprimes.kt
1902.depth-of-bst-given-insertion-order.kt	https://github.com/browsnet/leetcode/blob/main/1902.depth-of-bst-given-insertion-order.kt
1902.depth-of-bst-given-insertion-order.kt	https://github.com/browsnet/leetcode/blob/main/1902.depth-of-bst-given-insertion-order.kt
1983.widest-pair-of-indices-with-equal-range-sum.kt	https://github.com/browsnet/leetcode/blob/main/1983.widest-pair-of-indices-with-equal-range-sum.kt
1983.widest-pair-of-indices-with-equal-range-sum.kt	https://github.com/browsnet/leetcode/blob/main/1983.widest-pair-of-indices-with-equal-range-sum.kt
1999.smallest-greater-multiple-made-of-two-digits.kt	https://github.com/browsnet/leetcode/blob/main/1999.smallest-greater-multiple-made-of-two-digits.kt
1999.smallest-greater-multiple-made-of-two-digits.kt	https://github.com/browsnet/leetcode/blob/main/1999.smallest-greater-multiple-made-of-two-digits.kt
2008.maximum-earnings-from-taxi.kt	https://github.com/browsnet/leetcode/blob/main/2008.maximum-earnings-from-taxi.kt
2008.maximum-earnings-from-taxi.kt	https://github.com/browsnet/leetcode/blob/main/2008.maximum-earnings-from-taxi.kt
2013.detect-squares.kt	https://github.com/browsnet/leetcode/blob/main/2013.detect-squares.kt
2013.detect-squares.kt	https://github.com/browsnet/leetcode/blob/main/2013.detect-squares.kt
2018.check-if-word-can-be-placed-in-crossword.kt	https://github.com/browsnet/leetcode/blob/main/2018.check-if-word-can-be-placed-in-crossword.kt
2018.check-if-word-can-be-placed-in-crossword.kt	https://github.com/browsnet/leetcode/blob/main/2018.check-if-word-can-be-placed-in-crossword.kt
2024.maximize-the-confusion-of-an-exam.kt	https://github.com/browsnet/leetcode/blob/main/2024.maximize-the-confusion-of-an-exam.kt
2024.maximize-the-confusion-of-an-exam.kt	https://github.com/browsnet/leetcode/blob/main/2024.maximize-the-confusion-of-an-exam.kt
2028.find-missing-observations.kt	https://github.com/browsnet/leetcode/blob/main/2028.find-missing-observations.kt
2028.find-missing-observations.kt	https://github.com/browsnet/leetcode/blob/main/2028.find-missing-observations.kt
2029.stone-game-ix.kt	https://github.com/browsnet/leetcode/blob/main/2029.stone-game-ix.kt
2029.stone-game-ix.kt	https://github.com/browsnet/leetcode/blob/main/2029.stone-game-ix.kt
2045.second-minimum-time-to-reach-destination.kt	https://github.com/browsnet/leetcode/blob/main/2045.second-minimum-time-to-reach-destination.kt
2045.second-minimum-time-to-reach-destination.kt	https://github.com/browsnet/leetcode/blob/main/2045.second-minimum-time-to-reach-destination.kt
2047.number-of-valid-words-in-a-sentence.kt	https://github.com/browsnet/leetcode/blob/main/2047.number-of-valid-words-in-a-sentence.kt
2047.number-of-valid-words-in-a-sentence.kt	https://github.com/browsnet/leetcode/blob/main/2047.number-of-valid-words-in-a-sentence.kt
2077.paths-in-maze-that-lead-to-same-room.kt	https://github.com/browsnet/leetcode/blob/main/2077.paths-in-maze-that-lead-to-same-room.kt
2077.paths-in-maze-that-lead-to-same-room.kt	https://github.com/browsnet/leetcode/blob/main/2077.paths-in-maze-that-lead-to-same-room.kt
2098.subsequence-of-size-k-with-the-largest-even-sum.kt	https://github.com/browsnet/leetcode/blob/main/2098.subsequence-of-size-k-with-the-largest-even-sum.kt
2098.subsequence-of-size-k-with-the-largest-even-sum.kt	https://github.com/browsnet/leetcode/blob/main/2098.subsequence-of-size-k-with-the-largest-even-sum.kt
2102.sequentially-ordinal-rank-tracker.kt	https://github.com/browsnet/leetcode/blob/main/2102.sequentially-ordinal-rank-tracker.kt
2102.sequentially-ordinal-rank-tracker.kt	https://github.com/browsnet/leetcode/blob/main/2102.sequentially-ordinal-rank-tracker.kt
2107.number-of-unique-flavors-after-sharing-k-candies.kt	https://github.com/browsnet/leetcode/blob/main/2107.number-of-unique-flavors-after-sharing-k-candies.kt
2107.number-of-unique-flavors-after-sharing-k-candies.kt	https://github.com/browsnet/leetcode/blob/main/2107.number-of-unique-flavors-after-sharing-k-candies.kt
2113.elements-in-array-after-removing-and-replacing-elements.kt	https://github.com/browsnet/leetcode/blob/main/2113.elements-in-array-after-removing-and-replacing-elements.kt
2113.elements-in-array-after-removing-and-replacing-elements.kt	https://github.com/browsnet/leetcode/blob/main/2113.elements-in-array-after-removing-and-replacing-elements.kt
2125.number-of-laser-beams-in-a-bank.kt	https://github.com/browsnet/leetcode/blob/main/2125.number-of-laser-beams-in-a-bank.kt
2125.number-of-laser-beams-in-a-bank.kt	https://github.com/browsnet/leetcode/blob/main/2125.number-of-laser-beams-in-a-bank.kt
2126.destroying-asteroids.kt	https://github.com/browsnet/leetcode/blob/main/2126.destroying-asteroids.kt
2126.destroying-asteroids.kt	https://github.com/browsnet/leetcode/blob/main/2126.destroying-asteroids.kt
2127.maximum-employees-to-be-invited-to-a-meeting.kt	https://github.com/browsnet/leetcode/blob/main/2127.maximum-employees-to-be-invited-to-a-meeting.kt
2127.maximum-employees-to-be-invited-to-a-meeting.kt	https://github.com/browsnet/leetcode/blob/main/2127.maximum-employees-to-be-invited-to-a-meeting.kt
2136.earliest-possible-day-of-full-bloom.kt	https://github.com/browsnet/leetcode/blob/main/2136.earliest-possible-day-of-full-bloom.kt
2136.earliest-possible-day-of-full-bloom.kt	https://github.com/browsnet/leetcode/blob/main/2136.earliest-possible-day-of-full-bloom.kt
2139.minimum-moves-to-reach-target-score.kt	https://github.com/browsnet/leetcode/blob/main/2139.minimum-moves-to-reach-target-score.kt
2139.minimum-moves-to-reach-target-score.kt	https://github.com/browsnet/leetcode/blob/main/2139.minimum-moves-to-reach-target-score.kt
214.shortest-palindrome.kt	https://github.com/browsnet/leetcode/blob/main/214.shortest-palindrome.kt
214.shortest-palindrome.kt	https://github.com/browsnet/leetcode/blob/main/214.shortest-palindrome.kt
2140.solving-questions-with-brainpower.kt	https://github.com/browsnet/leetcode/blob/main/2140.solving-questions-with-brainpower.kt
2140.solving-questions-with-brainpower.kt	https://github.com/browsnet/leetcode/blob/main/2140.solving-questions-with-brainpower.kt
2141.maximum-running-time-of-n-computers.kt	https://github.com/browsnet/leetcode/blob/main/2141.maximum-running-time-of-n-computers.kt
2141.maximum-running-time-of-n-computers.kt	https://github.com/browsnet/leetcode/blob/main/2141.maximum-running-time-of-n-computers.kt
2144.minimum-cost-of-buying-candies-with-discount.kt	https://github.com/browsnet/leetcode/blob/main/2144.minimum-cost-of-buying-candies-with-discount.kt
2144.minimum-cost-of-buying-candies-with-discount.kt	https://github.com/browsnet/leetcode/blob/main/2144.minimum-cost-of-buying-candies-with-discount.kt
2145.count-the-hidden-sequences.kt	https://github.com/browsnet/leetcode/blob/main/2145.count-the-hidden-sequences.kt
2145.count-the-hidden-sequences.kt	https://github.com/browsnet/leetcode/blob/main/2145.count-the-hidden-sequences.kt
2146.k-highest-ranked-items-within-a-price-range.kt	https://github.com/browsnet/leetcode/blob/main/2146.k-highest-ranked-items-within-a-price-range.kt
2146.k-highest-ranked-items-within-a-price-range.kt	https://github.com/browsnet/leetcode/blob/main/2146.k-highest-ranked-items-within-a-price-range.kt
2147.number-of-ways-to-divide-a-long-corridor.kt	https://github.com/browsnet/leetcode/blob/main/2147.number-of-ways-to-divide-a-long-corridor.kt
2147.number-of-ways-to-divide-a-long-corridor.kt	https://github.com/browsnet/leetcode/blob/main/2147.number-of-ways-to-divide-a-long-corridor.kt
2148.count-elements-with-strictly-smaller-and-greater-elements.kt	https://github.com/browsnet/leetcode/blob/main/2148.count-elements-with-strictly-smaller-and-greater-elements.kt
2148.count-elements-with-strictly-smaller-and-greater-elements.kt	https://github.com/browsnet/leetcode/blob/main/2148.count-elements-with-strictly-smaller-and-greater-elements.kt
2149.rearrange-array-elements-by-sign.kt	https://github.com/browsnet/leetcode/blob/main/2149.rearrange-array-elements-by-sign.kt
2149.rearrange-array-elements-by-sign.kt	https://github.com/browsnet/leetcode/blob/main/2149.rearrange-array-elements-by-sign.kt
2150.find-all-lonely-numbers-in-the-array.kt	https://github.com/browsnet/leetcode/blob/main/2150.find-all-lonely-numbers-in-the-array.kt
2150.find-all-lonely-numbers-in-the-array.kt	https://github.com/browsnet/leetcode/blob/main/2150.find-all-lonely-numbers-in-the-array.kt
2151.maximum-good-people-based-on-statements.kt	https://github.com/browsnet/leetcode/blob/main/2151.maximum-good-people-based-on-statements.kt
2151.maximum-good-people-based-on-statements.kt	https://github.com/browsnet/leetcode/blob/main/2151.maximum-good-people-based-on-statements.kt
2157.groups-of-strings.kt	https://github.com/browsnet/leetcode/blob/main/2157.groups-of-strings.kt
2157.groups-of-strings.kt	https://github.com/browsnet/leetcode/blob/main/2157.groups-of-strings.kt
2170.minimum-operations-to-make-the-array-alternating.kt	https://github.com/browsnet/leetcode/blob/main/2170.minimum-operations-to-make-the-array-alternating.kt
2170.minimum-operations-to-make-the-array-alternating.kt	https://github.com/browsnet/leetcode/blob/main/2170.minimum-operations-to-make-the-array-alternating.kt
2171.removing-minimum-number-of-magic-beans.kt	https://github.com/browsnet/leetcode/blob/main/2171.removing-minimum-number-of-magic-beans.kt
2171.removing-minimum-number-of-magic-beans.kt	https://github.com/browsnet/leetcode/blob/main/2171.removing-minimum-number-of-magic-beans.kt
2172.maximum-and-sum-of-array.kt	https://github.com/browsnet/leetcode/blob/main/2172.maximum-and-sum-of-array.kt
2172.maximum-and-sum-of-array.kt	https://github.com/browsnet/leetcode/blob/main/2172.maximum-and-sum-of-array.kt
2208.minimum-operations-to-halve-array-sum.kt	https://github.com/browsnet/leetcode/blob/main/2208.minimum-operations-to-halve-array-sum.kt
2208.minimum-operations-to-halve-array-sum.kt	https://github.com/browsnet/leetcode/blob/main/2208.minimum-operations-to-halve-array-sum.kt
244.shortest-word-distance-ii.kt	https://github.com/browsnet/leetcode/blob/main/244.shortest-word-distance-ii.kt
244.shortest-word-distance-ii.kt	https://github.com/browsnet/leetcode/blob/main/244.shortest-word-distance-ii.kt
245.shortest-word-distance-iii.kt	https://github.com/browsnet/leetcode/blob/main/245.shortest-word-distance-iii.kt
245.shortest-word-distance-iii.kt	https://github.com/browsnet/leetcode/blob/main/245.shortest-word-distance-iii.kt
250.count-univalue-subtrees.kt	https://github.com/browsnet/leetcode/blob/main/250.count-univalue-subtrees.kt
250.count-univalue-subtrees.kt	https://github.com/browsnet/leetcode/blob/main/250.count-univalue-subtrees.kt
251.flatten-2d-vector.kt	https://github.com/browsnet/leetcode/blob/main/251.flatten-2d-vector.kt
251.flatten-2d-vector.kt	https://github.com/browsnet/leetcode/blob/main/251.flatten-2d-vector.kt
253.meeting-rooms-ii.kt	https://github.com/browsnet/leetcode/blob/main/253.meeting-rooms-ii.kt
253.meeting-rooms-ii.kt	https://github.com/browsnet/leetcode/blob/main/253.meeting-rooms-ii.kt
254.factor-combinations.kt	https://github.com/browsnet/leetcode/blob/main/254.factor-combinations.kt
254.factor-combinations.kt	https://github.com/browsnet/leetcode/blob/main/254.factor-combinations.kt
261.graph-valid-tree.kt	https://github.com/browsnet/leetcode/blob/main/261.graph-valid-tree.kt
261.graph-valid-tree.kt	https://github.com/browsnet/leetcode/blob/main/261.graph-valid-tree.kt
277.find-the-celebrity.kt	https://github.com/browsnet/leetcode/blob/main/277.find-the-celebrity.kt
277.find-the-celebrity.kt	https://github.com/browsnet/leetcode/blob/main/277.find-the-celebrity.kt
296.best-meeting-point.kt	https://github.com/browsnet/leetcode/blob/main/296.best-meeting-point.kt
296.best-meeting-point.kt	https://github.com/browsnet/leetcode/blob/main/296.best-meeting-point.kt
302.smallest-rectangle-enclosing-black-pixels.kt	https://github.com/browsnet/leetcode/blob/main/302.smallest-rectangle-enclosing-black-pixels.kt
302.smallest-rectangle-enclosing-black-pixels.kt	https://github.com/browsnet/leetcode/blob/main/302.smallest-rectangle-enclosing-black-pixels.kt
306.additive-number.kt	https://github.com/browsnet/leetcode/blob/main/306.additive-number.kt
306.additive-number.kt	https://github.com/browsnet/leetcode/blob/main/306.additive-number.kt
317.shortest-distance-from-all-buildings.kt	https://github.com/browsnet/leetcode/blob/main/317.shortest-distance-from-all-buildings.kt
317.shortest-distance-from-all-buildings.kt	https://github.com/browsnet/leetcode/blob/main/317.shortest-distance-from-all-buildings.kt
334.increasing-triplet-subsequence.kt	https://github.com/browsnet/leetcode/blob/main/334.increasing-triplet-subsequence.kt
334.increasing-triplet-subsequence.kt	https://github.com/browsnet/leetcode/blob/main/334.increasing-triplet-subsequence.kt
340.longest-substring-with-at-most-k-distinct-characters.kt	https://github.com/browsnet/leetcode/blob/main/340.longest-substring-with-at-most-k-distinct-characters.kt
340.longest-substring-with-at-most-k-distinct-characters.kt	https://github.com/browsnet/leetcode/blob/main/340.longest-substring-with-at-most-k-distinct-characters.kt
369.plus-one-linked-list.kt	https://github.com/browsnet/leetcode/blob/main/369.plus-one-linked-list.kt
369.plus-one-linked-list.kt	https://github.com/browsnet/leetcode/blob/main/369.plus-one-linked-list.kt
370.range-addition.kt	https://github.com/browsnet/leetcode/blob/main/370.range-addition.kt
370.range-addition.kt	https://github.com/browsnet/leetcode/blob/main/370.range-addition.kt
373.find-k-pairs-with-smallest-sums.kt	https://github.com/browsnet/leetcode/blob/main/373.find-k-pairs-with-smallest-sums.kt
373.find-k-pairs-with-smallest-sums.kt	https://github.com/browsnet/leetcode/blob/main/373.find-k-pairs-with-smallest-sums.kt
410.split-array-largest-sum.kt	https://github.com/browsnet/leetcode/blob/main/410.split-array-largest-sum.kt
410.split-array-largest-sum.kt	https://github.com/browsnet/leetcode/blob/main/410.split-array-largest-sum.kt
427.construct-quad-tree.kt	https://github.com/browsnet/leetcode/blob/main/427.construct-quad-tree.kt
427.construct-quad-tree.kt	https://github.com/browsnet/leetcode/blob/main/427.construct-quad-tree.kt
README	https://github.com/browsnet/leetcode
	https://github.com/browsnet/leetcode#leetcode
Readme	https://github.com/browsnet/leetcode#readme-ov-file
Please reload this page	https://github.com/browsnet/leetcode
Activity	https://github.com/browsnet/leetcode/activity
0 forks	https://github.com/browsnet/leetcode/forks
Report repository	https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fbrowsnet%2Fleetcode&report=browsnet+%28user%29
Releases	https://github.com/browsnet/leetcode/releases
Packages 0	https://github.com/users/browsnet/packages?repo_name=leetcode
Please reload this page	https://github.com/browsnet/leetcode
Contributors	https://github.com/browsnet/leetcode/graphs/contributors
Please reload this page	https://github.com/browsnet/leetcode
Kotlin 100.0%	https://github.com/browsnet/leetcode/search?l=kotlin
	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.