René's URL Explorer Experiment


Title: GitHub - arifkhan1990/LeetCode-solution

Open Graph Title: GitHub - arifkhan1990/LeetCode-solution

X Title: GitHub - arifkhan1990/LeetCode-solution

Description: Contribute to arifkhan1990/LeetCode-solution development by creating an account on GitHub.

Open Graph Description: Contribute to arifkhan1990/LeetCode-solution development by creating an account on GitHub.

X Description: Contribute to arifkhan1990/LeetCode-solution development by creating an account on GitHub.

Opengraph URL: https://github.com/arifkhan1990/LeetCode-solution

X: @github

direct link

Domain: patch-diff.githubusercontent.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:beda7b7a-454a-4698-b032-0773c2512038
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idA85C:36CA7:55920F5:74FFE4B:697CC7C0
html-safe-nonce27f5830f485c7ddfe15dfaa2cc83d8b8d412b3087cdc5bd1be86edcbd2312e40
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJBODVDOjM2Q0E3OjU1OTIwRjU6NzRGRkU0Qjo2OTdDQzdDMCIsInZpc2l0b3JfaWQiOiI4NTA0MjM1NzQxMjE4MTI5ODU2IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmacdd848245fc220a8b606fcec0ea35fe2cbb6ae33e4daf1fcb4d4f44a6939c259c
hovercard-subject-tagrepository:243922740
github-keyboard-shortcutsrepository,copilot
google-site-verificationApib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-urlhttps://collector.github.com/github/collect
analytics-location//
fb:app_id1401488693436528
apple-itunes-appapp-id=1477376905, app-argument=https://github.com/arifkhan1990/LeetCode-solution
twitter:imagehttps://opengraph.githubassets.com/8dfc35924eb9b0a3e902ca98f05521f40d5ee5546ab57dd521e5f84ef205606d/arifkhan1990/LeetCode-solution
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/8dfc35924eb9b0a3e902ca98f05521f40d5ee5546ab57dd521e5f84ef205606d/arifkhan1990/LeetCode-solution
og:image:altContribute to arifkhan1990/LeetCode-solution development by creating an account on GitHub.
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
Noned4c783778d5800630f3410c71c48893af4e0b2c5fc0c3d1b496c01fbaf3dc168
turbo-cache-controlno-preview
go-importgithub.com/arifkhan1990/LeetCode-solution git https://github.com/arifkhan1990/LeetCode-solution.git
octolytics-dimension-user_id18575807
octolytics-dimension-user_loginarifkhan1990
octolytics-dimension-repository_id243922740
octolytics-dimension-repository_nwoarifkhan1990/LeetCode-solution
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forkfalse
octolytics-dimension-repository_network_root_id243922740
octolytics-dimension-repository_network_root_nwoarifkhan1990/LeetCode-solution
turbo-body-classeslogged-out env-production page-responsive
disable-turbofalse
browser-stats-urlhttps://api.github.com/_private/browser/stats
browser-errors-urlhttps://api.github.com/_private/browser/errors
release5692c2ac29cb639a6b80b3e5e21feed6755366b6
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution#start-of-content
https://patch-diff.githubusercontent.com/
Sign in https://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2Farifkhan1990%2FLeetCode-solution
GitHub CopilotWrite better code with AIhttps://github.com/features/copilot
GitHub SparkBuild and deploy intelligent appshttps://github.com/features/spark
GitHub ModelsManage and compare promptshttps://github.com/features/models
MCP RegistryNewIntegrate external toolshttps://github.com/mcp
ActionsAutomate any workflowhttps://github.com/features/actions
CodespacesInstant dev environmentshttps://github.com/features/codespaces
IssuesPlan and track workhttps://github.com/features/issues
Code ReviewManage code changeshttps://github.com/features/code-review
GitHub Advanced SecurityFind and fix vulnerabilitieshttps://github.com/security/advanced-security
Code securitySecure your code as you buildhttps://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they starthttps://github.com/security/advanced-security/secret-protection
Why GitHubhttps://github.com/why-github
Documentationhttps://docs.github.com
Bloghttps://github.blog
Changeloghttps://github.blog/changelog
Marketplacehttps://github.com/marketplace
View all featureshttps://github.com/features
Enterpriseshttps://github.com/enterprise
Small and medium teamshttps://github.com/team
Startupshttps://github.com/enterprise/startups
Nonprofitshttps://github.com/solutions/industry/nonprofits
App Modernizationhttps://github.com/solutions/use-case/app-modernization
DevSecOpshttps://github.com/solutions/use-case/devsecops
DevOpshttps://github.com/solutions/use-case/devops
CI/CDhttps://github.com/solutions/use-case/ci-cd
View all use caseshttps://github.com/solutions/use-case
Healthcarehttps://github.com/solutions/industry/healthcare
Financial serviceshttps://github.com/solutions/industry/financial-services
Manufacturinghttps://github.com/solutions/industry/manufacturing
Governmenthttps://github.com/solutions/industry/government
View all industrieshttps://github.com/solutions/industry
View all solutionshttps://github.com/solutions
AIhttps://github.com/resources/articles?topic=ai
Software Developmenthttps://github.com/resources/articles?topic=software-development
DevOpshttps://github.com/resources/articles?topic=devops
Securityhttps://github.com/resources/articles?topic=security
View all topicshttps://github.com/resources/articles
Customer storieshttps://github.com/customer-stories
Events & webinarshttps://github.com/resources/events
Ebooks & reportshttps://github.com/resources/whitepapers
Business insightshttps://github.com/solutions/executive-insights
GitHub Skillshttps://skills.github.com
Documentationhttps://docs.github.com
Customer supporthttps://support.github.com
Community forumhttps://github.com/orgs/community/discussions
Trust centerhttps://github.com/trust-center
Partnershttps://github.com/partners
GitHub SponsorsFund open source developershttps://github.com/sponsors
Security Labhttps://securitylab.github.com
Maintainer Communityhttps://maintainers.github.com
Acceleratorhttps://github.com/accelerator
Archive Programhttps://archiveprogram.github.com
Topicshttps://github.com/topics
Trendinghttps://github.com/trending
Collectionshttps://github.com/collections
Enterprise platformAI-powered developer platformhttps://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security featureshttps://github.com/security/advanced-security
Copilot for BusinessEnterprise-grade AI featureshttps://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 supporthttps://github.com/premium-support
Pricinghttps://github.com/pricing
Search syntax tipshttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentationhttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
Sign in https://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2Farifkhan1990%2FLeetCode-solution
Sign up https://patch-diff.githubusercontent.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=arifkhan1990%2FLeetCode-solution
Reloadhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution
Reloadhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution
Reloadhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution
arifkhan1990 https://patch-diff.githubusercontent.com/arifkhan1990
LeetCode-solutionhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2Farifkhan1990%2FLeetCode-solution
Fork 0 https://patch-diff.githubusercontent.com/login?return_to=%2Farifkhan1990%2FLeetCode-solution
Star 0 https://patch-diff.githubusercontent.com/login?return_to=%2Farifkhan1990%2FLeetCode-solution
0 stars https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/stargazers
0 forks https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/forks
Branches https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/branches
Tags https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tags
Activity https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/activity
Star https://patch-diff.githubusercontent.com/login?return_to=%2Farifkhan1990%2FLeetCode-solution
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2Farifkhan1990%2FLeetCode-solution
Code https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution
Issues 0 https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/issues
Pull requests 0 https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/pulls
Actions https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/actions
Projects 0 https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/projects
Security 0 https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/security
Insights https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/pulse
Code https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution
Issues https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/issues
Pull requests https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/pulls
Actions https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/actions
Projects https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/projects
Security https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/security
Insights https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/pulse
Brancheshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/branches
Tagshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tags
https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/branches
https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tags
1,971 Commitshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/commits/master/
https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/commits/master/
.github/workflowshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/.github/workflows
.github/workflowshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/.github/workflows
.vscodehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/.vscode
.vscodehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/.vscode
0001-two-sumhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0001-two-sum
0001-two-sumhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0001-two-sum
0053-maximum-subarrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0053-maximum-subarray
0053-maximum-subarrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0053-maximum-subarray
0075-sort-colorshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0075-sort-colors
0075-sort-colorshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0075-sort-colors
0100-same-treehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0100-same-tree
0100-same-treehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0100-same-tree
0125-valid-palindromehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0125-valid-palindrome
0125-valid-palindromehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0125-valid-palindrome
0144-binary-tree-preorder-traversalhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0144-binary-tree-preorder-traversal
0144-binary-tree-preorder-traversalhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0144-binary-tree-preorder-traversal
0169-majority-elementhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0169-majority-element
0169-majority-elementhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0169-majority-element
0205-isomorphic-stringshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0205-isomorphic-strings
0205-isomorphic-stringshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0205-isomorphic-strings
0217-contains-duplicatehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0217-contains-duplicate
0217-contains-duplicatehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0217-contains-duplicate
0228-summary-rangeshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0228-summary-ranges
0228-summary-rangeshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0228-summary-ranges
0231-power-of-twohttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0231-power-of-two
0231-power-of-twohttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0231-power-of-two
0237-delete-node-in-a-linked-listhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0237-delete-node-in-a-linked-list
0237-delete-node-in-a-linked-listhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0237-delete-node-in-a-linked-list
0242-valid-anagramhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0242-valid-anagram
0242-valid-anagramhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0242-valid-anagram
0263-ugly-numberhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0263-ugly-number
0263-ugly-numberhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0263-ugly-number
0287-find-the-duplicate-numberhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0287-find-the-duplicate-number
0287-find-the-duplicate-numberhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0287-find-the-duplicate-number
0290-word-patternhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0290-word-pattern
0290-word-patternhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0290-word-pattern
0326-power-of-threehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0326-power-of-three
0326-power-of-threehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0326-power-of-three
0334-increasing-triplet-subsequencehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0334-increasing-triplet-subsequence
0334-increasing-triplet-subsequencehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0334-increasing-triplet-subsequence
0342-power-of-fourhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0342-power-of-four
0342-power-of-fourhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0342-power-of-four
0349-intersection-of-two-arrayshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0349-intersection-of-two-arrays
0349-intersection-of-two-arrayshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-iihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0350-intersection-of-two-arrays-ii
0350-intersection-of-two-arrays-iihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0350-intersection-of-two-arrays-ii
0374-guess-number-higher-or-lowerhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0374-guess-number-higher-or-lower
0374-guess-number-higher-or-lowerhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0374-guess-number-higher-or-lower
0383-ransom-notehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0383-ransom-note
0383-ransom-notehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0383-ransom-note
0387-first-unique-character-in-a-stringhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0387-first-unique-character-in-a-string
0387-first-unique-character-in-a-stringhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0387-first-unique-character-in-a-string
0392-is-subsequencehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0392-is-subsequence
0392-is-subsequencehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0392-is-subsequence
0412-fizz-buzzhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0412-fizz-buzz
0412-fizz-buzzhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0412-fizz-buzz
0415-add-stringshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0415-add-strings
0415-add-stringshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0415-add-strings
0442-find-all-duplicates-in-an-arrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0442-find-all-duplicates-in-an-array
0442-find-all-duplicates-in-an-arrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0442-find-all-duplicates-in-an-array
0452-minimum-number-of-arrows-to-burst-balloonshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0452-minimum-number-of-arrows-to-burst-balloons
0452-minimum-number-of-arrows-to-burst-balloonshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0452-minimum-number-of-arrows-to-burst-balloons
0520-detect-capitalhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0520-detect-capital
0520-detect-capitalhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0520-detect-capital
0525-contiguous-arrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0525-contiguous-array
0525-contiguous-arrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0525-contiguous-array
0605-can-place-flowershttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0605-can-place-flowers
0605-can-place-flowershttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0605-can-place-flowers
0633-sum-of-square-numbershttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0633-sum-of-square-numbers
0633-sum-of-square-numbershttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0633-sum-of-square-numbers
0645-set-mismatchhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0645-set-mismatch
0645-set-mismatchhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0645-set-mismatch
0704-binary-searchhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0704-binary-search
0704-binary-searchhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0704-binary-search
0724-find-pivot-indexhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0724-find-pivot-index
0724-find-pivot-indexhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0724-find-pivot-index
0914-x-of-a-kind-in-a-deck-of-cardshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0914-x-of-a-kind-in-a-deck-of-cards
0914-x-of-a-kind-in-a-deck-of-cardshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0914-x-of-a-kind-in-a-deck-of-cards
0941-valid-mountain-arrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0941-valid-mountain-array
0941-valid-mountain-arrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0941-valid-mountain-array
0944-delete-columns-to-make-sortedhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0944-delete-columns-to-make-sorted
0944-delete-columns-to-make-sortedhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0944-delete-columns-to-make-sorted
0961-n-repeated-element-in-size-2n-arrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0961-n-repeated-element-in-size-2n-array
0961-n-repeated-element-in-size-2n-arrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0961-n-repeated-element-in-size-2n-array
0976-largest-perimeter-trianglehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0976-largest-perimeter-triangle
0976-largest-perimeter-trianglehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/0976-largest-perimeter-triangle
1-two-sumhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1-two-sum
1-two-sumhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1-two-sum
100-same-treehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/100-same-tree
100-same-treehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/100-same-tree
1002-find-common-charactershttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1002-find-common-characters
1002-find-common-charactershttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1002-find-common-characters
1013-fibonacci-numberhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1013-fibonacci-number
1013-fibonacci-numberhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1013-fibonacci-number
1014-k-closest-points-to-originhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1014-k-closest-points-to-origin
1014-k-closest-points-to-originhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1014-k-closest-points-to-origin
1019-squares-of-a-sorted-arrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1019-squares-of-a-sorted-array
1019-squares-of-a-sorted-arrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1019-squares-of-a-sorted-array
1030-smallest-string-starting-from-leafhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1030-smallest-string-starting-from-leaf
1030-smallest-string-starting-from-leafhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1030-smallest-string-starting-from-leaf
1034-subarrays-with-k-different-integershttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1034-subarrays-with-k-different-integers
1034-subarrays-with-k-different-integershttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1034-subarrays-with-k-different-integers
1037-minimum-number-of-k-consecutive-bit-flipshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1037-minimum-number-of-k-consecutive-bit-flips
1037-minimum-number-of-k-consecutive-bit-flipshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1037-minimum-number-of-k-consecutive-bit-flips
1039-find-the-town-judgehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1039-find-the-town-judge
1039-find-the-town-judgehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1039-find-the-town-judge
104-maximum-depth-of-binary-treehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-treehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/104-maximum-depth-of-binary-tree
1046-max-consecutive-ones-iiihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1046-max-consecutive-ones-iii
1046-max-consecutive-ones-iiihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1046-max-consecutive-ones-iii
1079-sum-of-root-to-leaf-binary-numbershttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1079-sum-of-root-to-leaf-binary-numbers
1079-sum-of-root-to-leaf-binary-numbershttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1079-sum-of-root-to-leaf-binary-numbers
108-convert-sorted-array-to-binary-search-treehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/108-convert-sorted-array-to-binary-search-tree
108-convert-sorted-array-to-binary-search-treehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/108-convert-sorted-array-to-binary-search-tree
1087-longest-arithmetic-subsequencehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1087-longest-arithmetic-subsequence
1087-longest-arithmetic-subsequencehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1087-longest-arithmetic-subsequence
1089-duplicate-zeroshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1089-duplicate-zeros
1089-duplicate-zeroshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1089-duplicate-zeros
11-container-with-most-waterhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/11-container-with-most-water
11-container-with-most-waterhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/11-container-with-most-water
1105-uncrossed-lineshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1105-uncrossed-lines
1105-uncrossed-lineshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1105-uncrossed-lines
1108-defanging-an-ip-addresshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1108-defanging-an-ip-address
1108-defanging-an-ip-addresshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1108-defanging-an-ip-address
111-minimum-depth-of-binary-treehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/111-minimum-depth-of-binary-tree
111-minimum-depth-of-binary-treehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/111-minimum-depth-of-binary-tree
1116-maximum-level-sum-of-a-binary-treehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1116-maximum-level-sum-of-a-binary-tree
1116-maximum-level-sum-of-a-binary-treehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1116-maximum-level-sum-of-a-binary-tree
112-path-sumhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/112-path-sum
112-path-sumhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/112-path-sum
113-path-sum-iihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/113-path-sum-ii
113-path-sum-iihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/113-path-sum-ii
1135-customers-who-bought-all-productshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1135-customers-who-bought-all-products
1135-customers-who-bought-all-productshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1135-customers-who-bought-all-products
1137-n-th-tribonacci-numberhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1137-n-th-tribonacci-number
1137-n-th-tribonacci-numberhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1137-n-th-tribonacci-number
1146-greatest-common-divisor-of-stringshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1146-greatest-common-divisor-of-strings
1146-greatest-common-divisor-of-stringshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1146-greatest-common-divisor-of-strings
115-distinct-subsequenceshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/115-distinct-subsequences
115-distinct-subsequenceshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/115-distinct-subsequences
1153-product-sales-analysis-ihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1153-product-sales-analysis-i
1153-product-sales-analysis-ihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1153-product-sales-analysis-i
1155-product-sales-analysis-iiihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1155-product-sales-analysis-iii
1155-product-sales-analysis-iiihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1155-product-sales-analysis-iii
1161-project-employees-ihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1161-project-employees-i
1161-project-employees-ihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1161-project-employees-i
118-pascals-trianglehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/118-pascals-triangle
118-pascals-trianglehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/118-pascals-triangle
1182-game-play-analysis-ivhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1182-game-play-analysis-iv
1182-game-play-analysis-ivhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1182-game-play-analysis-iv
120-trianglehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/120-triangle
120-trianglehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/120-triangle
1207-unique-number-of-occurrenceshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1207-unique-number-of-occurrences
1207-unique-number-of-occurrenceshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1207-unique-number-of-occurrences
121-best-time-to-buy-and-sell-stockhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/121-best-time-to-buy-and-sell-stock
121-best-time-to-buy-and-sell-stockhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/121-best-time-to-buy-and-sell-stock
1221-element-appearing-more-than-25-in-sorted-arrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1221-element-appearing-more-than-25-in-sorted-array
1221-element-appearing-more-than-25-in-sorted-arrayhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1221-element-appearing-more-than-25-in-sorted-array
1224-minimum-falling-path-sum-iihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1224-minimum-falling-path-sum-ii
1224-minimum-falling-path-sum-iihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1224-minimum-falling-path-sum-ii
1231-replace-elements-with-greatest-element-on-right-sidehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1231-replace-elements-with-greatest-element-on-right-side
1231-replace-elements-with-greatest-element-on-right-sidehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1231-replace-elements-with-greatest-element-on-right-side
1236-n-th-tribonacci-numberhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1236-n-th-tribonacci-number
1236-n-th-tribonacci-numberhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1236-n-th-tribonacci-number
1245-user-activity-for-the-past-30-days-ihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1245-user-activity-for-the-past-30-days-i
1245-user-activity-for-the-past-30-days-ihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1245-user-activity-for-the-past-30-days-i
1250-longest-common-subsequencehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1250-longest-common-subsequence
1250-longest-common-subsequencehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1250-longest-common-subsequence
1253-sort-the-matrix-diagonallyhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1253-sort-the-matrix-diagonally
1253-sort-the-matrix-diagonallyhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1253-sort-the-matrix-diagonally
1254-deepest-leaves-sumhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1254-deepest-leaves-sum
1254-deepest-leaves-sumhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1254-deepest-leaves-sum
1258-article-views-ihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1258-article-views-i
1258-article-views-ihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1258-article-views-i
1267-remove-zero-sum-consecutive-nodes-from-linked-listhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1267-remove-zero-sum-consecutive-nodes-from-linked-list
1267-remove-zero-sum-consecutive-nodes-from-linked-listhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1267-remove-zero-sum-consecutive-nodes-from-linked-list
128-longest-consecutive-sequencehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/128-longest-consecutive-sequence
128-longest-consecutive-sequencehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/128-longest-consecutive-sequence
1281-subtract-the-product-and-sum-of-digits-of-an-integerhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1281-subtract-the-product-and-sum-of-digits-of-an-integer
1281-subtract-the-product-and-sum-of-digits-of-an-integerhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1281-subtract-the-product-and-sum-of-digits-of-an-integer
1282-group-the-people-given-the-group-size-they-belong-tohttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1282-group-the-people-given-the-group-size-they-belong-to
1282-group-the-people-given-the-group-size-they-belong-tohttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1282-group-the-people-given-the-group-size-they-belong-to
129-sum-root-to-leaf-numbershttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/129-sum-root-to-leaf-numbers
129-sum-root-to-leaf-numbershttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/129-sum-root-to-leaf-numbers
1290-convert-binary-number-in-a-linked-list-to-integerhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1290-convert-binary-number-in-a-linked-list-to-integer
1290-convert-binary-number-in-a-linked-list-to-integerhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1290-convert-binary-number-in-a-linked-list-to-integer
1292-immediate-food-delivery-iihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1292-immediate-food-delivery-ii
1292-immediate-food-delivery-iihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1292-immediate-food-delivery-ii
1297-maximum-number-of-balloonshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1297-maximum-number-of-balloons
1297-maximum-number-of-balloonshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1297-maximum-number-of-balloons
1304-find-n-unique-integers-sum-up-to-zerohttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1304-find-n-unique-integers-sum-up-to-zero
1304-find-n-unique-integers-sum-up-to-zerohttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1304-find-n-unique-integers-sum-up-to-zero
131-palindrome-partitioninghttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/131-palindrome-partitioning
131-palindrome-partitioninghttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/131-palindrome-partitioning
1313-decompress-run-length-encoded-listhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1313-decompress-run-length-encoded-list
1313-decompress-run-length-encoded-listhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1313-decompress-run-length-encoded-list
1320-remove-all-adjacent-duplicates-in-string-iihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1320-remove-all-adjacent-duplicates-in-string-ii
1320-remove-all-adjacent-duplicates-in-string-iihttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1320-remove-all-adjacent-duplicates-in-string-ii
1323-maximum-69-numberhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1323-maximum-69-number
1323-maximum-69-numberhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/tree/master/1323-maximum-69-number
Please reload this pagehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution
Activityhttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/activity
0 starshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/stargazers
1 watchinghttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/watchers
0 forkshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/forks
Report repository https://patch-diff.githubusercontent.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Farifkhan1990%2FLeetCode-solution&report=arifkhan1990+%28user%29
Releaseshttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/releases
Packages 0https://patch-diff.githubusercontent.com/users/arifkhan1990/packages?repo_name=LeetCode-solution
Please reload this pagehttps://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution
Python 86.4% https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/search?l=python
C++ 6.9% https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/search?l=c%2B%2B
JavaScript 4.2% https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/search?l=javascript
Hack 1.1% https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/search?l=hack
Go 0.5% https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/search?l=go
C 0.5% https://patch-diff.githubusercontent.com/arifkhan1990/LeetCode-solution/search?l=c
https://github.com
Termshttps://docs.github.com/site-policy/github-terms/github-terms-of-service
Privacyhttps://docs.github.com/site-policy/privacy-policies/github-privacy-statement
Securityhttps://github.com/security
Statushttps://www.githubstatus.com/
Communityhttps://github.community/
Docshttps://docs.github.com/
Contacthttps://support.github.com?tags=dotcom-footer

Viewport: width=device-width

URLs of crawlers that visited me.