René's URL Explorer Experiment


Title: GitHub - raiden-02/LeetCode: my leetcode solutions

Open Graph Title: GitHub - raiden-02/LeetCode: my leetcode solutions

X Title: GitHub - raiden-02/LeetCode: my leetcode solutions

Description: my leetcode solutions. Contribute to raiden-02/LeetCode development by creating an account on GitHub.

Open Graph Description: my leetcode solutions. Contribute to raiden-02/LeetCode development by creating an account on GitHub.

X Description: my leetcode solutions. Contribute to raiden-02/LeetCode development by creating an account on GitHub.

Opengraph URL: https://github.com/raiden-02/LeetCode

X: @github

direct link

Domain: patch-diff.githubusercontent.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:2bae96ba-e09f-0acd-2234-1e5ee9b6d8de
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id8830:531A6:3F50434:56B5976:698CA85D
html-safe-nonce3b61e98511771b25f49be442e9b6d91d9b03eaf15b3183f38ebf48103264088b
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI4ODMwOjUzMUE2OjNGNTA0MzQ6NTZCNTk3Njo2OThDQTg1RCIsInZpc2l0b3JfaWQiOiIxNTgwNzk3NTA0Mjk4NzIzNDIxIiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmac111d87a8b8f0802ea31327e6d08564d3106a08450574c51422fac31951d02bbc
hovercard-subject-tagrepository:330881433
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/raiden-02/LeetCode
twitter:imagehttps://opengraph.githubassets.com/95125a2cd474d5aab3fb8d5e7bd0174a43aa22e0fbed06c8417218950bc9e6c9/raiden-02/LeetCode
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/95125a2cd474d5aab3fb8d5e7bd0174a43aa22e0fbed06c8417218950bc9e6c9/raiden-02/LeetCode
og:image:altmy leetcode solutions. Contribute to raiden-02/LeetCode development by creating an account on GitHub.
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None640eeb7b6ff4d8d106235d228c0c286e82592d4d2403227b5b2b4fc5832297a4
turbo-cache-controlno-preview
go-importgithub.com/raiden-02/LeetCode git https://github.com/raiden-02/LeetCode.git
octolytics-dimension-user_id54232956
octolytics-dimension-user_loginraiden-02
octolytics-dimension-repository_id330881433
octolytics-dimension-repository_nworaiden-02/LeetCode
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forkfalse
octolytics-dimension-repository_network_root_id330881433
octolytics-dimension-repository_network_root_nworaiden-02/LeetCode
turbo-body-classeslogged-out env-production page-responsive
disable-turbofalse
browser-stats-urlhttps://api.github.com/_private/browser/stats
browser-errors-urlhttps://api.github.com/_private/browser/errors
release3d444f0a47beeeac94cddbb51c91ab408befe8d4
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://patch-diff.githubusercontent.com/raiden-02/LeetCode#start-of-content
https://patch-diff.githubusercontent.com/
Sign in https://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2Fraiden-02%2FLeetCode
GitHub CopilotWrite better code with AIhttps://github.com/features/copilot
GitHub SparkBuild and deploy intelligent appshttps://github.com/features/spark
GitHub ModelsManage and compare promptshttps://github.com/features/models
MCP RegistryNewIntegrate external toolshttps://github.com/mcp
ActionsAutomate any workflowhttps://github.com/features/actions
CodespacesInstant dev environmentshttps://github.com/features/codespaces
IssuesPlan and track workhttps://github.com/features/issues
Code ReviewManage code changeshttps://github.com/features/code-review
GitHub Advanced SecurityFind and fix vulnerabilitieshttps://github.com/security/advanced-security
Code securitySecure your code as you buildhttps://github.com/security/advanced-security/code-security
Secret protectionStop leaks before they starthttps://github.com/security/advanced-security/secret-protection
Why GitHubhttps://github.com/why-github
Documentationhttps://docs.github.com
Bloghttps://github.blog
Changeloghttps://github.blog/changelog
Marketplacehttps://github.com/marketplace
View all featureshttps://github.com/features
Enterpriseshttps://github.com/enterprise
Small and medium teamshttps://github.com/team
Startupshttps://github.com/enterprise/startups
Nonprofitshttps://github.com/solutions/industry/nonprofits
App Modernizationhttps://github.com/solutions/use-case/app-modernization
DevSecOpshttps://github.com/solutions/use-case/devsecops
DevOpshttps://github.com/solutions/use-case/devops
CI/CDhttps://github.com/solutions/use-case/ci-cd
View all use caseshttps://github.com/solutions/use-case
Healthcarehttps://github.com/solutions/industry/healthcare
Financial serviceshttps://github.com/solutions/industry/financial-services
Manufacturinghttps://github.com/solutions/industry/manufacturing
Governmenthttps://github.com/solutions/industry/government
View all industrieshttps://github.com/solutions/industry
View all solutionshttps://github.com/solutions
AIhttps://github.com/resources/articles?topic=ai
Software Developmenthttps://github.com/resources/articles?topic=software-development
DevOpshttps://github.com/resources/articles?topic=devops
Securityhttps://github.com/resources/articles?topic=security
View all topicshttps://github.com/resources/articles
Customer storieshttps://github.com/customer-stories
Events & webinarshttps://github.com/resources/events
Ebooks & reportshttps://github.com/resources/whitepapers
Business insightshttps://github.com/solutions/executive-insights
GitHub Skillshttps://skills.github.com
Documentationhttps://docs.github.com
Customer supporthttps://support.github.com
Community forumhttps://github.com/orgs/community/discussions
Trust centerhttps://github.com/trust-center
Partnershttps://github.com/partners
GitHub SponsorsFund open source developershttps://github.com/sponsors
Security Labhttps://securitylab.github.com
Maintainer Communityhttps://maintainers.github.com
Acceleratorhttps://github.com/accelerator
Archive Programhttps://archiveprogram.github.com
Topicshttps://github.com/topics
Trendinghttps://github.com/trending
Collectionshttps://github.com/collections
Enterprise platformAI-powered developer platformhttps://github.com/enterprise
GitHub Advanced SecurityEnterprise-grade security featureshttps://github.com/security/advanced-security
Copilot for BusinessEnterprise-grade AI featureshttps://github.com/features/copilot/copilot-business
Premium SupportEnterprise-grade 24/7 supporthttps://github.com/premium-support
Pricinghttps://github.com/pricing
Search syntax tipshttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
documentationhttps://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax
Sign in https://patch-diff.githubusercontent.com/login?return_to=https%3A%2F%2Fgithub.com%2Fraiden-02%2FLeetCode
Sign up https://patch-diff.githubusercontent.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=raiden-02%2FLeetCode
Reloadhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode
Reloadhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode
Reloadhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode
raiden-02 https://patch-diff.githubusercontent.com/raiden-02
LeetCodehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2Fraiden-02%2FLeetCode
Fork 0 https://patch-diff.githubusercontent.com/login?return_to=%2Fraiden-02%2FLeetCode
Star 2 https://patch-diff.githubusercontent.com/login?return_to=%2Fraiden-02%2FLeetCode
leetcode.com/Mayur316/https://leetcode.com/Mayur316/
2 stars https://patch-diff.githubusercontent.com/raiden-02/LeetCode/stargazers
0 forks https://patch-diff.githubusercontent.com/raiden-02/LeetCode/forks
Branches https://patch-diff.githubusercontent.com/raiden-02/LeetCode/branches
Tags https://patch-diff.githubusercontent.com/raiden-02/LeetCode/tags
Activity https://patch-diff.githubusercontent.com/raiden-02/LeetCode/activity
Star https://patch-diff.githubusercontent.com/login?return_to=%2Fraiden-02%2FLeetCode
Notifications https://patch-diff.githubusercontent.com/login?return_to=%2Fraiden-02%2FLeetCode
Code https://patch-diff.githubusercontent.com/raiden-02/LeetCode
Issues 0 https://patch-diff.githubusercontent.com/raiden-02/LeetCode/issues
Pull requests 0 https://patch-diff.githubusercontent.com/raiden-02/LeetCode/pulls
Actions https://patch-diff.githubusercontent.com/raiden-02/LeetCode/actions
Projects 0 https://patch-diff.githubusercontent.com/raiden-02/LeetCode/projects
Security 0 https://patch-diff.githubusercontent.com/raiden-02/LeetCode/security
Insights https://patch-diff.githubusercontent.com/raiden-02/LeetCode/pulse
Code https://patch-diff.githubusercontent.com/raiden-02/LeetCode
Issues https://patch-diff.githubusercontent.com/raiden-02/LeetCode/issues
Pull requests https://patch-diff.githubusercontent.com/raiden-02/LeetCode/pulls
Actions https://patch-diff.githubusercontent.com/raiden-02/LeetCode/actions
Projects https://patch-diff.githubusercontent.com/raiden-02/LeetCode/projects
Security https://patch-diff.githubusercontent.com/raiden-02/LeetCode/security
Insights https://patch-diff.githubusercontent.com/raiden-02/LeetCode/pulse
Brancheshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/branches
Tagshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/tags
https://patch-diff.githubusercontent.com/raiden-02/LeetCode/branches
https://patch-diff.githubusercontent.com/raiden-02/LeetCode/tags
1,293 Commitshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/commits/main/
https://patch-diff.githubusercontent.com/raiden-02/LeetCode/commits/main/
1146. Snapshot Arrayhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/tree/main/1146.%20Snapshot%20Array
1146. Snapshot Arrayhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/tree/main/1146.%20Snapshot%20Array
1. Two Sum.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1.%20Two%20Sum.cpp
1. Two Sum.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1.%20Two%20Sum.cpp
10. Regular Expression Matchinghttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/10.%20Regular%20Expression%20Matching
10. Regular Expression Matchinghttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/10.%20Regular%20Expression%20Matching
1004. Max Consecutive Ones IIIhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1004.%20Max%20Consecutive%20Ones%20III
1004. Max Consecutive Ones IIIhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1004.%20Max%20Consecutive%20Ones%20III
1007. Minimum Domino Rotations For Equal Rowhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1007.%20Minimum%20Domino%20Rotations%20For%20Equal%20Row
1007. Minimum Domino Rotations For Equal Rowhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1007.%20Minimum%20Domino%20Rotations%20For%20Equal%20Row
1008. Construct Binary Search Tree from Preorder Traversalhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1008.%20Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal
1008. Construct Binary Search Tree from Preorder Traversalhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1008.%20Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal
101. Symmetric Treehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/101.%20Symmetric%20Tree
101. Symmetric Treehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/101.%20Symmetric%20Tree
1010. Pairs of Songs With Total Durations Divisible by 60https://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1010.%20Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060
1010. Pairs of Songs With Total Durations Divisible by 60https://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1010.%20Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060
1011. Capacity To Ship Packages Within D Dayshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1011.%20Capacity%20To%20Ship%20Packages%20Within%20D%20Days
1011. Capacity To Ship Packages Within D Dayshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1011.%20Capacity%20To%20Ship%20Packages%20Within%20D%20Days
1013. Partition Array Into Three Parts With Equal Sumhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1013.%20Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum
1013. Partition Array Into Three Parts With Equal Sumhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1013.%20Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum
1015. Smallest Integer Divisible by Khttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1015.%20Smallest%20Integer%20Divisible%20by%20K
1015. Smallest Integer Divisible by Khttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1015.%20Smallest%20Integer%20Divisible%20by%20K
102. Binary Tree Level Order Traversalhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/102.%20Binary%20Tree%20Level%20Order%20Traversal
102. Binary Tree Level Order Traversalhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/102.%20Binary%20Tree%20Level%20Order%20Traversal
1020. Number of Enclaveshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1020.%20Number%20of%20Enclaves
1020. Number of Enclaveshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1020.%20Number%20of%20Enclaves
1022. Sum of Root To Leaf Binary Numbershttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1022.%20Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers
1022. Sum of Root To Leaf Binary Numbershttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1022.%20Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers
1026. Maximum Difference Between Node and Ancestor.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1026.%20Maximum%20Difference%20Between%20Node%20and%20Ancestor.cpp
1026. Maximum Difference Between Node and Ancestor.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1026.%20Maximum%20Difference%20Between%20Node%20and%20Ancestor.cpp
1029. Two City Scheduling.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1029.%20Two%20City%20Scheduling.cpp
1029. Two City Scheduling.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1029.%20Two%20City%20Scheduling.cpp
103. Binary Tree Zigzag Level Order Traversalhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal
103. Binary Tree Zigzag Level Order Traversalhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal
1033. Moving Stones Until Consecutive.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1033.%20Moving%20Stones%20Until%20Consecutive.cpp
1033. Moving Stones Until Consecutive.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1033.%20Moving%20Stones%20Until%20Consecutive.cpp
1035. Uncrossed Lines.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1035.%20Uncrossed%20Lines.cpp
1035. Uncrossed Lines.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1035.%20Uncrossed%20Lines.cpp
104. Maximum Depth of Binary Treehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/104.%20Maximum%20Depth%20of%20Binary%20Tree
104. Maximum Depth of Binary Treehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/104.%20Maximum%20Depth%20of%20Binary%20Tree
1041. Robot Bounded In Circlehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1041.%20Robot%20Bounded%20In%20Circle
1041. Robot Bounded In Circlehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1041.%20Robot%20Bounded%20In%20Circle
1043. Partition Array for Maximum Sum.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1043.%20Partition%20Array%20for%20Maximum%20Sum.cpp
1043. Partition Array for Maximum Sum.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1043.%20Partition%20Array%20for%20Maximum%20Sum.cpp
1043. Partition Array for Maximum Sum.pyhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1043.%20Partition%20Array%20for%20Maximum%20Sum.py
1043. Partition Array for Maximum Sum.pyhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1043.%20Partition%20Array%20for%20Maximum%20Sum.py
1046. Last Stone Weighthttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1046.%20Last%20Stone%20Weight
1046. Last Stone Weighthttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1046.%20Last%20Stone%20Weight
1047. Remove All Adjacent Duplicates In Stringhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1047.%20Remove%20All%20Adjacent%20Duplicates%20In%20String
1047. Remove All Adjacent Duplicates In Stringhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1047.%20Remove%20All%20Adjacent%20Duplicates%20In%20String
1048. Longest String Chainhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1048.%20Longest%20String%20Chain
1048. Longest String Chainhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1048.%20Longest%20String%20Chain
105. Construct Binary Tree from Preorder and Inorder Traversalhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal
105. Construct Binary Tree from Preorder and Inorder Traversalhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal
1055. Shortest Way to Form Stringhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1055.%20Shortest%20Way%20to%20Form%20String
1055. Shortest Way to Form Stringhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1055.%20Shortest%20Way%20to%20Form%20String
1058. Minimize Rounding Error to Meet Targethttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1058.%20Minimize%20Rounding%20Error%20to%20Meet%20Target
1058. Minimize Rounding Error to Meet Targethttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1058.%20Minimize%20Rounding%20Error%20to%20Meet%20Target
1059. All Paths from Source Lead to Destinationhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1059.%20All%20Paths%20from%20Source%20Lead%20to%20Destination
1059. All Paths from Source Lead to Destinationhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1059.%20All%20Paths%20from%20Source%20Lead%20to%20Destination
106. Construct Binary Tree from Inorder and Postorder Traversalhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal
106. Construct Binary Tree from Inorder and Postorder Traversalhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal
1061. Lexicographically Smallest Equivalent Stringhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1061.%20Lexicographically%20Smallest%20Equivalent%20String
1061. Lexicographically Smallest Equivalent Stringhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1061.%20Lexicographically%20Smallest%20Equivalent%20String
1064. Fixed Pointhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1064.%20Fixed%20Point
1064. Fixed Pointhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1064.%20Fixed%20Point
1071. Greatest Common Divisor of Stringshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1071.%20Greatest%20Common%20Divisor%20of%20Strings
1071. Greatest Common Divisor of Stringshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1071.%20Greatest%20Common%20Divisor%20of%20Strings
1074. Number of Submatrices That Sum to Targethttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1074.%20Number%20of%20Submatrices%20That%20Sum%20to%20Target
1074. Number of Submatrices That Sum to Targethttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1074.%20Number%20of%20Submatrices%20That%20Sum%20to%20Target
108. Convert Sorted Array to Binary Search Treehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree
108. Convert Sorted Array to Binary Search Treehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree
1081. Smallest Subsequence of Distinct Charactershttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1081.%20Smallest%20Subsequence%20of%20Distinct%20Characters
1081. Smallest Subsequence of Distinct Charactershttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1081.%20Smallest%20Subsequence%20of%20Distinct%20Characters
1086. High Fivehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1086.%20High%20Five
1086. High Fivehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1086.%20High%20Five
1087. Brace Expansionhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1087.%20Brace%20Expansion
1087. Brace Expansionhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1087.%20Brace%20Expansion
109. Convert Sorted List to Binary Search Tree.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.cpp
109. Convert Sorted List to Binary Search Tree.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.cpp
109. Convert Sorted List to Binary Search Tree.jshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.js
109. Convert Sorted List to Binary Search Tree.jshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.js
1091. Shortest Path in Binary Matrix.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1091.%20Shortest%20Path%20in%20Binary%20Matrix.cpp
1091. Shortest Path in Binary Matrix.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1091.%20Shortest%20Path%20in%20Binary%20Matrix.cpp
1094. Car Poolinghttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1094.%20Car%20Pooling
1094. Car Poolinghttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1094.%20Car%20Pooling
1096. Brace Expansion IIhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1096.%20Brace%20Expansion%20II
1096. Brace Expansion IIhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1096.%20Brace%20Expansion%20II
11. Container With Most Waterhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/11.%20Container%20With%20Most%20Water
11. Container With Most Waterhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/11.%20Container%20With%20Most%20Water
110. Balanced Binary Treehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/110.%20Balanced%20Binary%20Tree
110. Balanced Binary Treehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/110.%20Balanced%20Binary%20Tree
1102. Path With Maximum Minimum Valuehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1102.%20Path%20With%20Maximum%20Minimum%20Value
1102. Path With Maximum Minimum Valuehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1102.%20Path%20With%20Maximum%20Minimum%20Value
1105. Filling Bookcase Shelveshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1105.%20Filling%20Bookcase%20Shelves
1105. Filling Bookcase Shelveshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1105.%20Filling%20Bookcase%20Shelves
112. Path Sumhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/112.%20Path%20Sum
112. Path Sumhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/112.%20Path%20Sum
1120. Maximum Average Subtreehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1120.%20Maximum%20Average%20Subtree
1120. Maximum Average Subtreehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1120.%20Maximum%20Average%20Subtree
1129. Shortest Path with Alternating Colorshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1129.%20Shortest%20Path%20with%20Alternating%20Colors
1129. Shortest Path with Alternating Colorshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1129.%20Shortest%20Path%20with%20Alternating%20Colors
113. Path Sum IIhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/113.%20Path%20Sum%20II
113. Path Sum IIhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/113.%20Path%20Sum%20II
1133. Largest Unique Numberhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1133.%20Largest%20Unique%20Number
1133. Largest Unique Numberhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1133.%20Largest%20Unique%20Number
1134. Armstrong Numberhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1134.%20Armstrong%20Number
1134. Armstrong Numberhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1134.%20Armstrong%20Number
1135. Connecting Cities With Minimum Costhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1135.%20Connecting%20Cities%20With%20Minimum%20Cost
1135. Connecting Cities With Minimum Costhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1135.%20Connecting%20Cities%20With%20Minimum%20Cost
1136. Parallel Courseshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1136.%20Parallel%20Courses
1136. Parallel Courseshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1136.%20Parallel%20Courses
1137. N-th Tribonacci Numberhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1137.%20N-th%20Tribonacci%20Number
1137. N-th Tribonacci Numberhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1137.%20N-th%20Tribonacci%20Number
1137. N-th Tribonacci Number.pyhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1137.%20N-th%20Tribonacci%20Number.py
1137. N-th Tribonacci Number.pyhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1137.%20N-th%20Tribonacci%20Number.py
114. Flatten Binary Tree to Linked Listhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/114.%20Flatten%20Binary%20Tree%20to%20Linked%20List
114. Flatten Binary Tree to Linked Listhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/114.%20Flatten%20Binary%20Tree%20to%20Linked%20List
1140. Stone Game IIhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1140.%20Stone%20Game%20II
1140. Stone Game IIhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1140.%20Stone%20Game%20II
1143. Longest Common Subsequence.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1143.%20Longest%20Common%20Subsequence.cpp
1143. Longest Common Subsequence.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1143.%20Longest%20Common%20Subsequence.cpp
1143. Longest Common Subsequence.pyhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1143.%20Longest%20Common%20Subsequence.py
1143. Longest Common Subsequence.pyhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1143.%20Longest%20Common%20Subsequence.py
115. Distinct Subsequenceshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/115.%20Distinct%20Subsequences
115. Distinct Subsequenceshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/115.%20Distinct%20Subsequences
1151. Minimum Swaps to Group All 1's Togetherhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1151.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together
1151. Minimum Swaps to Group All 1's Togetherhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1151.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together
1155. Number of Dice Rolls With Target Sum.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1155.%20Number%20of%20Dice%20Rolls%20With%20Target%20Sum.cpp
1155. Number of Dice Rolls With Target Sum.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1155.%20Number%20of%20Dice%20Rolls%20With%20Target%20Sum.cpp
116. Populating Next Right Pointers in Each Nodehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node
116. Populating Next Right Pointers in Each Nodehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node
1160. Find Words That Can Be Formed by Characters.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1160.%20Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters.cpp
1160. Find Words That Can Be Formed by Characters.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1160.%20Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters.cpp
1161. Maximum Level Sum of a Binary Tree.tshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1161.%20Maximum%20Level%20Sum%20of%20a%20Binary%20Tree.ts
1161. Maximum Level Sum of a Binary Tree.tshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1161.%20Maximum%20Level%20Sum%20of%20a%20Binary%20Tree.ts
1162. As Far from Land as Possiblehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1162.%20As%20Far%20from%20Land%20as%20Possible
1162. As Far from Land as Possiblehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1162.%20As%20Far%20from%20Land%20as%20Possible
1163. Last Substring in Lexicographical Orderhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1163.%20Last%20Substring%20in%20Lexicographical%20Order
1163. Last Substring in Lexicographical Orderhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1163.%20Last%20Substring%20in%20Lexicographical%20Order
1165. Single-Row Keyboardhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1165.%20Single-Row%20Keyboard
1165. Single-Row Keyboardhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1165.%20Single-Row%20Keyboard
1166. Design File System.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1166.%20Design%20File%20System.cpp
1166. Design File System.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1166.%20Design%20File%20System.cpp
1167. Minimum Cost to Connect Stickshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1167.%20Minimum%20Cost%20to%20Connect%20Sticks
1167. Minimum Cost to Connect Stickshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1167.%20Minimum%20Cost%20to%20Connect%20Sticks
1178. Number of Valid Words for Each Puzzlehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1178.%20Number%20of%20Valid%20Words%20for%20Each%20Puzzle
1178. Number of Valid Words for Each Puzzlehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1178.%20Number%20of%20Valid%20Words%20for%20Each%20Puzzle
118. Pascal's Trianglehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/118.%20Pascal's%20Triangle
118. Pascal's Trianglehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/118.%20Pascal's%20Triangle
1182. Shortest Distance to Target Colorhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1182.%20Shortest%20Distance%20to%20Target%20Color
1182. Shortest Distance to Target Colorhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1182.%20Shortest%20Distance%20to%20Target%20Color
1187. Make Array Strictly Increasing.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1187.%20Make%20Array%20Strictly%20Increasing.cpp
1187. Make Array Strictly Increasing.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1187.%20Make%20Array%20Strictly%20Increasing.cpp
1189. Maximum Number of Balloonshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1189.%20Maximum%20Number%20of%20Balloons
1189. Maximum Number of Balloonshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1189.%20Maximum%20Number%20of%20Balloons
1192. Critical Connections in a Networkhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1192.%20Critical%20Connections%20in%20a%20Network
1192. Critical Connections in a Networkhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1192.%20Critical%20Connections%20in%20a%20Network
1197. Minimum Knight Moveshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1197.%20Minimum%20Knight%20Moves
1197. Minimum Knight Moveshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1197.%20Minimum%20Knight%20Moves
1198. Find Smallest Common Element in All Rowshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1198.%20Find%20Smallest%20Common%20Element%20in%20All%20Rows
1198. Find Smallest Common Element in All Rowshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1198.%20Find%20Smallest%20Common%20Element%20in%20All%20Rows
12. Integer to Romanhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/12.%20Integer%20to%20Roman
12. Integer to Romanhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/12.%20Integer%20to%20Roman
120. Trianglehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/120.%20Triangle
120. Trianglehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/120.%20Triangle
1202. Smallest String With Swapshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1202.%20Smallest%20String%20With%20Swaps
1202. Smallest String With Swapshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1202.%20Smallest%20String%20With%20Swaps
1207. Unique Number of Occurrences.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1207.%20Unique%20Number%20of%20Occurrences.cpp
1207. Unique Number of Occurrences.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1207.%20Unique%20Number%20of%20Occurrences.cpp
1209. Remove All Adjacent Duplicates in String IIhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1209.%20Remove%20All%20Adjacent%20Duplicates%20in%20String%20II
1209. Remove All Adjacent Duplicates in String IIhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1209.%20Remove%20All%20Adjacent%20Duplicates%20in%20String%20II
121. Best Time to Buy and Sell Stockhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock
121. Best Time to Buy and Sell Stockhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock
1215. Stepping Numbershttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1215.%20Stepping%20Numbers
1215. Stepping Numbershttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1215.%20Stepping%20Numbers
1218. Longest Arithmetic Subsequence of Given Differencehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1218.%20Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference
1218. Longest Arithmetic Subsequence of Given Differencehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1218.%20Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference
122. Best Time to Buy and Sell Stock IIhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II
122. Best Time to Buy and Sell Stock IIhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II
1220. Count Vowels Permutationhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1220.%20Count%20Vowels%20Permutation
1220. Count Vowels Permutationhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1220.%20Count%20Vowels%20Permutation
1228. Missing Number In Arithmetic Progressionhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1228.%20Missing%20Number%20In%20Arithmetic%20Progression
1228. Missing Number In Arithmetic Progressionhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1228.%20Missing%20Number%20In%20Arithmetic%20Progression
1229. Meeting Schedulerhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1229.%20Meeting%20Scheduler
1229. Meeting Schedulerhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1229.%20Meeting%20Scheduler
1232. Check If It Is a Straight Line.tshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1232.%20Check%20If%20It%20Is%20a%20Straight%20Line.ts
1232. Check If It Is a Straight Line.tshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1232.%20Check%20If%20It%20Is%20a%20Straight%20Line.ts
1235. Maximum Profit in Job Scheduling.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1235.%20Maximum%20Profit%20in%20Job%20Scheduling.cpp
1235. Maximum Profit in Job Scheduling.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1235.%20Maximum%20Profit%20in%20Job%20Scheduling.cpp
1235. Maximum Profit in Job Scheduling.pyhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1235.%20Maximum%20Profit%20in%20Job%20Scheduling.py
1235. Maximum Profit in Job Scheduling.pyhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1235.%20Maximum%20Profit%20in%20Job%20Scheduling.py
1239. Maximum Length of a Concatenated String with Unique Charactershttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1239.%20Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters
1239. Maximum Length of a Concatenated String with Unique Charactershttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1239.%20Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters
124. Binary Tree Maximum Path Sumhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum
124. Binary Tree Maximum Path Sumhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/124.%20Binary%20Tree%20Maximum%20Path%20Sum
1245. Tree Diameterhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1245.%20Tree%20Diameter
1245. Tree Diameterhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1245.%20Tree%20Diameter
1249. Minimum Remove to Make Valid Parentheses.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1249.%20Minimum%20Remove%20to%20Make%20Valid%20Parentheses.cpp
1249. Minimum Remove to Make Valid Parentheses.cpphttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/blob/main/1249.%20Minimum%20Remove%20to%20Make%20Valid%20Parentheses.cpp
leetcode.com/Mayur316/https://leetcode.com/Mayur316/
python https://patch-diff.githubusercontent.com/topics/python
java https://patch-diff.githubusercontent.com/topics/java
typescript https://patch-diff.githubusercontent.com/topics/typescript
leetcode https://patch-diff.githubusercontent.com/topics/leetcode
cpp https://patch-diff.githubusercontent.com/topics/cpp
Please reload this pagehttps://patch-diff.githubusercontent.com/raiden-02/LeetCode
Activityhttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/activity
2 starshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/stargazers
1 watchinghttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/watchers
0 forkshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/forks
Report repository https://patch-diff.githubusercontent.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fraiden-02%2FLeetCode&report=raiden-02+%28user%29
Releaseshttps://patch-diff.githubusercontent.com/raiden-02/LeetCode/releases
Packages 0https://patch-diff.githubusercontent.com/users/raiden-02/packages?repo_name=LeetCode
C++ 68.4% https://patch-diff.githubusercontent.com/raiden-02/LeetCode/search?l=c%2B%2B
Python 11.4% https://patch-diff.githubusercontent.com/raiden-02/LeetCode/search?l=python
TypeScript 10.5% https://patch-diff.githubusercontent.com/raiden-02/LeetCode/search?l=typescript
C# 6.8% https://patch-diff.githubusercontent.com/raiden-02/LeetCode/search?l=c%23
JavaScript 2.0% https://patch-diff.githubusercontent.com/raiden-02/LeetCode/search?l=javascript
C 0.7% https://patch-diff.githubusercontent.com/raiden-02/LeetCode/search?l=c
Java 0.2% https://patch-diff.githubusercontent.com/raiden-02/LeetCode/search?l=java
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.