René's URL Explorer Experiment


Title: GitHub - all1m-algorithm-study/LeetCode-Solutions: 알고리즘 소모임 AL林 릿코드 풀이 저장소 / AL林 leetcode problem solutions

Open Graph Title: GitHub - all1m-algorithm-study/LeetCode-Solutions: 알고리즘 소모임 AL林 릿코드 풀이 저장소 / AL林 leetcode problem solutions

X Title: GitHub - all1m-algorithm-study/LeetCode-Solutions: 알고리즘 소모임 AL林 릿코드 풀이 저장소 / AL林 leetcode problem solutions

Description: 알고리즘 소모임 AL林 릿코드 풀이 저장소 / AL林 leetcode problem solutions - all1m-algorithm-study/LeetCode-Solutions

Open Graph Description: 알고리즘 소모임 AL林 릿코드 풀이 저장소 / AL林 leetcode problem solutions - all1m-algorithm-study/LeetCode-Solutions

X Description: 알고리즘 소모임 AL林 릿코드 풀이 저장소 / AL林 leetcode problem solutions - all1m-algorithm-study/LeetCode-Solutions

Opengraph URL: https://github.com/all1m-algorithm-study/LeetCode-Solutions

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:5f9d8b21-55c8-2d27-8927-5ed4d266aa29
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idACF0:DDB35:12D02A4:17CE228:699174B6
html-safe-noncea93418054b99ecd8990331b10f6057733586477c5bc7468a929ad29a08ce02db
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJBQ0YwOkREQjM1OjEyRDAyQTQ6MTdDRTIyODo2OTkxNzRCNiIsInZpc2l0b3JfaWQiOiIxMTA2MDk0MDQ0ODg1MzgyMzI2IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0=
visitor-hmac4d82c1a65fff5629dea53eff7b66e9c40f826489232048ff37e41a99c01bf58b
hovercard-subject-tagrepository:329126488
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/all1m-algorithm-study/LeetCode-Solutions
twitter:imagehttps://opengraph.githubassets.com/5875d90e74454f3d7ad475e825cf133cc0dc194fd855828c7a40f7d1db9d127c/all1m-algorithm-study/LeetCode-Solutions
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/5875d90e74454f3d7ad475e825cf133cc0dc194fd855828c7a40f7d1db9d127c/all1m-algorithm-study/LeetCode-Solutions
og:image:alt알고리즘 소모임 AL林 릿코드 풀이 저장소 / AL林 leetcode problem solutions - all1m-algorithm-study/LeetCode-Solutions
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None42c603b9d642c4a9065a51770f75e5e27132fef0e858607f5c9cb7e422831a7b
turbo-cache-controlno-preview
go-importgithub.com/all1m-algorithm-study/LeetCode-Solutions git https://github.com/all1m-algorithm-study/LeetCode-Solutions.git
octolytics-dimension-user_id33099506
octolytics-dimension-user_loginall1m-algorithm-study
octolytics-dimension-repository_id329126488
octolytics-dimension-repository_nwoall1m-algorithm-study/LeetCode-Solutions
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forkfalse
octolytics-dimension-repository_network_root_id329126488
octolytics-dimension-repository_network_root_nwoall1m-algorithm-study/LeetCode-Solutions
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
release848bc6032dcc93a9a7301dcc3f379a72ba13b96e
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/all1m-algorithm-study/LeetCode-Solutions#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fall1m-algorithm-study%2FLeetCode-Solutions
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://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fall1m-algorithm-study%2FLeetCode-Solutions
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=all1m-algorithm-study%2FLeetCode-Solutions
Reloadhttps://github.com/all1m-algorithm-study/LeetCode-Solutions
Reloadhttps://github.com/all1m-algorithm-study/LeetCode-Solutions
Reloadhttps://github.com/all1m-algorithm-study/LeetCode-Solutions
all1m-algorithm-study https://github.com/all1m-algorithm-study
LeetCode-Solutionshttps://github.com/all1m-algorithm-study/LeetCode-Solutions
Notifications https://github.com/login?return_to=%2Fall1m-algorithm-study%2FLeetCode-Solutions
Fork 13 https://github.com/login?return_to=%2Fall1m-algorithm-study%2FLeetCode-Solutions
Star 4 https://github.com/login?return_to=%2Fall1m-algorithm-study%2FLeetCode-Solutions
MIT license https://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/LICENSE
4 stars https://github.com/all1m-algorithm-study/LeetCode-Solutions/stargazers
13 forks https://github.com/all1m-algorithm-study/LeetCode-Solutions/forks
Branches https://github.com/all1m-algorithm-study/LeetCode-Solutions/branches
Tags https://github.com/all1m-algorithm-study/LeetCode-Solutions/tags
Activity https://github.com/all1m-algorithm-study/LeetCode-Solutions/activity
Star https://github.com/login?return_to=%2Fall1m-algorithm-study%2FLeetCode-Solutions
Notifications https://github.com/login?return_to=%2Fall1m-algorithm-study%2FLeetCode-Solutions
Code https://github.com/all1m-algorithm-study/LeetCode-Solutions
Issues 0 https://github.com/all1m-algorithm-study/LeetCode-Solutions/issues
Pull requests 0 https://github.com/all1m-algorithm-study/LeetCode-Solutions/pulls
Actions https://github.com/all1m-algorithm-study/LeetCode-Solutions/actions
Projects 0 https://github.com/all1m-algorithm-study/LeetCode-Solutions/projects
Security 0 https://github.com/all1m-algorithm-study/LeetCode-Solutions/security
Insights https://github.com/all1m-algorithm-study/LeetCode-Solutions/pulse
Code https://github.com/all1m-algorithm-study/LeetCode-Solutions
Issues https://github.com/all1m-algorithm-study/LeetCode-Solutions/issues
Pull requests https://github.com/all1m-algorithm-study/LeetCode-Solutions/pulls
Actions https://github.com/all1m-algorithm-study/LeetCode-Solutions/actions
Projects https://github.com/all1m-algorithm-study/LeetCode-Solutions/projects
Security https://github.com/all1m-algorithm-study/LeetCode-Solutions/security
Insights https://github.com/all1m-algorithm-study/LeetCode-Solutions/pulse
Brancheshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/branches
Tagshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/tags
https://github.com/all1m-algorithm-study/LeetCode-Solutions/branches
https://github.com/all1m-algorithm-study/LeetCode-Solutions/tags
366 Commitshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/commits/main/
https://github.com/all1m-algorithm-study/LeetCode-Solutions/commits/main/
.github/workflowshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/tree/main/.github/workflows
.github/workflowshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/tree/main/.github/workflows
solutionshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/tree/main/solutions
solutionshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/tree/main/solutions
.gitignorehttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/.gitignore
.gitignorehttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/.gitignore
HowToContribute.mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/HowToContribute.md
HowToContribute.mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/HowToContribute.md
LICENSEhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/LICENSE
LICENSEhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/LICENSE
README-Template.mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/README-Template.md
README-Template.mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/README-Template.md
README.mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/README.md
README.mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/README.md
contribute_point_calculator.pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/contribute_point_calculator.py
contribute_point_calculator.pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/contribute_point_calculator.py
leetcode_table_maker.pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/leetcode_table_maker.py
leetcode_table_maker.pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/leetcode_table_maker.py
problems_infohttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/problems_info
problems_infohttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/problems_info
readme_updater.pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/readme_updater.py
readme_updater.pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/readme_updater.py
READMEhttps://github.com/all1m-algorithm-study/LeetCode-Solutions
MIT licensehttps://github.com/all1m-algorithm-study/LeetCode-Solutions
https://github.com/all1m-algorithm-study/LeetCode-Solutions#leetcode-solutions
https://camo.githubusercontent.com/d5a0a163c4ff65fa66e0edfa77c93d53cca4a98420abc13c0e8780c589b1680e/68747470733a2f2f696d672e736869656c64732e696f2f62616467652f2533452d4c656574436f64652d6f72616e67652e737667
https://camo.githubusercontent.com/1006d1c41418d2520f114094d070ba1262fe7600e9dd3c2d22879e894377e5a4/68747470733a2f2f696d672e736869656c64732e696f2f62616467652f6c616e67756167652d432b2b2d626c75652e737667
https://camo.githubusercontent.com/5d1d6bad280045de88c381cc5b58c2678ac3131f31c88719c8deff33b0ec0f38/68747470733a2f2f696d672e736869656c64732e696f2f62616467652f6c616e67756167652d507974686f6e2d677265656e2e737667
https://camo.githubusercontent.com/2be7718c89c353f2ecc93cffe6c2a055ec9423811c3c146681a719b8ac6e5286/68747470733a2f2f696d672e736869656c64732e696f2f62616467652f6c616e67756167652d4a6176612d7265642e737667
LeetCodehttps://leetcode.com/
https://github.com/all1m-algorithm-study/LeetCode-Solutions#기여하는-방법20210126-수정
링크https://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/HowToContribute.md
2021.01.18.(월) ~ 2021.02.21.(일)에 기여를 많이하면 상품을 드립니다.https://www.notion.so/AL-LeetCode-8abcfca9056e472cb65316683b15bc34
https://github.com/all1m-algorithm-study/LeetCode-Solutions#ranking
https://github.com/all1m-algorithm-study/LeetCode-Solutions#event-1-가장-꾸준히-기여한-사람
https://github.com/all1m-algorithm-study/LeetCode-Solutions#event-2-모든-난이도에-가장-많이-기여한-사람
https://github.com/all1m-algorithm-study/LeetCode-Solutions#event-3-medium-hard-난이도에-가장-많이-기여한-사람
https://github.com/all1m-algorithm-study/LeetCode-Solutions#algorithms
Two Sumhttps://leetcode.com/problems/two-sum
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1/1.cpp
jshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1/1-gusrb3164.js
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1/1-fivestar1103.py
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1/1.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1/1.md
Add Two Numbershttps://leetcode.com/problems/add-two-numbers
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/2/2-gusrb3164.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/2/2-moran991231.java
Longest Substring Without Repeating Charactershttps://leetcode.com/problems/longest-substring-without-repeating-characters
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/3/3-gusrb3164.cpp
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/3/3.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/3/3-moran991231.java
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/3/3-moran991231.md
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/3/3.md
Longest Palindromic Substringhttps://leetcode.com/problems/longest-palindromic-substring
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/5/5-moran991231.java
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/5/5-moran991231.md
ZigZag Conversionhttps://leetcode.com/problems/zigzag-conversion
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/6/6-sally0226.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/6/6-moran991231.java
jpghttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/6/6-moran991321.jpg
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/6/6-moran991231.md
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/6/6-sally0226.md
Reverse Integerhttps://leetcode.com/problems/reverse-integer
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/7/7-moran991231.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/7/7.py
Palindrome Numberhttps://leetcode.com/problems/palindrome-number
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/9/9-gusrb3164.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/9/9.py
Roman to Integerhttps://leetcode.com/problems/roman-to-integer
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/13/13-gusrb3164.cpp
Letter Combinations of a Phone Numberhttps://leetcode.com/problems/letter-combinations-of-a-phone-number
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/17/17-gusrb3164.cpp
Valid Parentheseshttps://leetcode.com/problems/valid-parentheses
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/20/20-mulmuri.py
Merge k Sorted Listshttps://leetcode.com/problems/merge-k-sorted-lists
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/23/23-moran991231.java
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/23/23-moran991231.md
Find First and Last Position of Element in Sorted Arrayhttps://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/34/34-moran991231.java
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/34/34-moran991231.md
Sudoku Solverhttps://leetcode.com/problems/sudoku-solver
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/37/37-moran991231.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/37/37-fivestar1103.py
Combination Sumhttps://leetcode.com/problems/combination-sum
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/39/39-gusrb3164.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/39/39-fivestar1103.py
Trapping Rain Waterhttps://leetcode.com/problems/trapping-rain-water
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/42/42-fivestar1103.py
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/42/42-gusrb3164.py
Permutationshttps://leetcode.com/problems/permutations
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/46/46-gusrb3164.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/46/46-fivestar1103.py
Pow(x, n)https://leetcode.com/problems/powx-n
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/50/50.py
N-Queenshttps://leetcode.com/problems/n-queens
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/51/51-fivestar1103.py
N-Queens IIhttps://leetcode.com/problems/n-queens-ii
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/52/52-fivestar1103.py
Merge Intervalshttps://leetcode.com/problems/merge-intervals
jshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/56/56-gusrb3164.js
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/56/56-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/56/56-yongjoonseo.md
Permutation Sequencehttps://leetcode.com/problems/permutation-sequence
chttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/60/60-fivestar1103.c
Rotate Listhttps://leetcode.com/problems/rotate-list
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/61/61-moran991231.java
Unique Pathshttps://leetcode.com/problems/unique-paths
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/62/62-moran991231.java
Unique Paths IIhttps://leetcode.com/problems/unique-paths-ii
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/63/63-moran991231.java
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/63/63-moran991231.md
Valid Numberhttps://leetcode.com/problems/valid-number
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/65/65-moran991231.java
Add Binaryhttps://leetcode.com/problems/add-binary
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/67/67-moran991231.java
Search a 2D Matrixhttps://leetcode.com/problems/search-a-2d-matrix
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/74/74-moran991231.java
Sort Colorshttps://leetcode.com/problems/sort-colors
jshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/75/75-gusrb3164.js
Combinationshttps://leetcode.com/problems/combinations
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/77/77-gusrb3164.cpp
Subsetshttps://leetcode.com/problems/subsets
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/78/78-gusrb3164.cpp
Largest Rectangle in Histogramhttps://leetcode.com/problems/largest-rectangle-in-histogram
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/84/84-fivestar1103.py
Merge Sorted Arrayhttps://leetcode.com/problems/merge-sorted-array
jshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/88/88-gusrb3164.js
Gray Codehttps://leetcode.com/problems/gray-code
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/89/89-moran991231.java
Reverse Linked List IIhttps://leetcode.com/problems/reverse-linked-list-ii
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/92/92-gusrb3164.cpp
Binary Tree Inorder Traversalhttps://leetcode.com/problems/binary-tree-inorder-traversal
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/94/94-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/94/94-yongjoonseo.md
Interleaving Stringhttps://leetcode.com/problems/interleaving-string
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/97/97-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/97/97-yongjoonseo.md
Binary Tree Level Order Traversalhttps://leetcode.com/problems/binary-tree-level-order-traversal
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/102/102-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/102/102-yongjoonseo.md
Binary Tree Zigzag Level Order Traversalhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/103/103-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/103/103-yongjoonseo.md
Maximum Depth of Binary Treehttps://leetcode.com/problems/maximum-depth-of-binary-tree
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/104/104-gusrb3164.cpp
Construct Binary Tree from Preorder and Inorder Traversalhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/105/105-gusrb3164.cpp
Binary Tree Level Order Traversal IIhttps://leetcode.com/problems/binary-tree-level-order-traversal-ii
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/107/107-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/107/107-yongjoonseo.md
Convert Sorted Array to Binary Search Treehttps://leetcode.com/problems/convert-sorted-array-to-binary-search-tree
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/108/108-gusrb3164.cpp
Balanced Binary Treehttps://leetcode.com/problems/balanced-binary-tree
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/110/110-gusrb3164.cpp
Minimum Depth of Binary Treehttps://leetcode.com/problems/minimum-depth-of-binary-tree
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/111/111-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/111/111-yongjoonseo.md
Valid Palindromehttps://leetcode.com/problems/valid-palindrome
chttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/125/125-zeze1004.c
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/125/125-zeze1004(1).py
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/125/125-zeze1004(2).py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/125/125-zeze1004.md
Surrounded Regionshttps://leetcode.com/problems/surrounded-regions
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/130/130-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/130/130-yongjoonseo.md
Binary Tree Preorder Traversalhttps://leetcode.com/problems/binary-tree-preorder-traversal
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/144/144-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/144/144-yongjoonseo.md
Binary Tree Postorder Traversalhttps://leetcode.com/problems/binary-tree-postorder-traversal
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/145/145-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/145/145-yongjoonseo.md
Insertion Sort Listhttps://leetcode.com/problems/insertion-sort-list
jshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/147/147-gusrb3164.js
Factorial Trailing Zeroeshttps://leetcode.com/problems/factorial-trailing-zeroes
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/172/172.py
Largest Numberhttps://leetcode.com/problems/largest-number
jshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/179/179-gusrb3164.js
Binary Tree Right Side Viewhttps://leetcode.com/problems/binary-tree-right-side-view
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/199/199-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/199/199-yongjoonseo.md
Number of Islandshttps://leetcode.com/problems/number-of-islands
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/200/200-gusrb3164.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/200/200-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/200/200-yongjoonseo.md
Happy Numberhttps://leetcode.com/problems/happy-number
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/202/202.py
Reverse Linked Listhttps://leetcode.com/problems/reverse-linked-list
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/206/206(1)-gusrb3164.cpp
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/206/206(2)-gusrb3164.cpp
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/206/206-gusrb3164.md
Course Schedulehttps://leetcode.com/problems/course-schedule
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/207/207-gusrb3164.cpp
Implement Trie (Prefix Tree)https://leetcode.com/problems/implement-trie-prefix-tree
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/208/208-gusrb3164.cpp
Kth Largest Element in an Arrayhttps://leetcode.com/problems/kth-largest-element-in-an-array
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/215/215-gusrb3164.cpp
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/215/215-gusrb3164.md
Contains Duplicatehttps://leetcode.com/problems/contains-duplicate
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/217/217.py
Invert Binary Treehttps://leetcode.com/problems/invert-binary-tree
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/226/226-gusrb3164.cpp
jshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/226/226-gusrb3164.js
Power of Twohttps://leetcode.com/problems/power-of-two
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/231/231.py
Valid Anagramhttps://leetcode.com/problems/valid-anagram
jshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/242/242-gusrb3164.js
Serialize and Deserialize Binary Treehttps://leetcode.com/problems/serialize-and-deserialize-binary-tree
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/297/297-gusrb3164.cpp
Minimum Height Treeshttps://leetcode.com/problems/minimum-height-trees
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/310/310-gusrb3164.cpp
Remove Duplicate Lettershttps://leetcode.com/problems/remove-duplicate-letters
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/316/316-gusrb3164.cpp
Power of Threehttps://leetcode.com/problems/power-of-three
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/326/326-yongjoonseo.py
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/326/326.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/326/326-yongjoonseo.md
Reconstruct Itineraryhttps://leetcode.com/problems/reconstruct-itinerary
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/332/332-gusrb3164.cpp
Power of Fourhttps://leetcode.com/problems/power-of-four
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/342/342.py
Reverse Stringhttps://leetcode.com/problems/reverse-string
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/344/344-zeze1004.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/344/344-zeze1004(1).py
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/344/344-zeze1004(2).py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/344/344-zeze1004.md
Fizz Buzzhttps://leetcode.com/problems/fizz-buzz
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/412/412-zeze1004.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/412/412-iknoom.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/412/412-zeze1004.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/412/412-zeze1004.md
N-ary Tree Level Order Traversalhttps://leetcode.com/problems/n-ary-tree-level-order-traversal
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/429/429-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/429/429-yongjoonseo.md
4Sum IIhttps://leetcode.com/problems/4sum-ii
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/454/454-mulmuri.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/454/454-mulmuri.md
Find Largest Value in Each Tree Rowhttps://leetcode.com/problems/find-largest-value-in-each-tree-row
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/515/515-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/515/515-yongjoonseo.md
Convert BST to Greater Treehttps://leetcode.com/problems/convert-bst-to-greater-tree
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/538/538-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/538/538-kir3i.md
01 Matrixhttps://leetcode.com/problems/01-matrix
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/542/542-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/542/542-yongjoonseo.md
Diameter of Binary Treehttps://leetcode.com/problems/diameter-of-binary-tree
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/543/543-gusrb3164.cpp
Number of Provinceshttps://leetcode.com/problems/number-of-provinces
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/547/547-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/547/547-yongjoonseo.md
Maximum Depth of N-ary Treehttps://leetcode.com/problems/maximum-depth-of-n-ary-tree
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/559/559-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/559/559-yongjoonseo.md
Array Partition Ihttps://leetcode.com/problems/array-partition-i
jshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/561/561-gusrb3164.js
Merge Two Binary Treeshttps://leetcode.com/problems/merge-two-binary-trees
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/617/617-gusrb3164.cpp
Maximum Binary Treehttps://leetcode.com/problems/maximum-binary-tree
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/654/654-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/654/654-kir3i.md
Redundant Connectionhttps://leetcode.com/problems/redundant-connection
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/684/684-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/684/684-yongjoonseo.md
Longest Univalue Pathhttps://leetcode.com/problems/longest-univalue-path
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/687/687-gusrb3164.cpp
Insert into a Binary Search Treehttps://leetcode.com/problems/insert-into-a-binary-search-tree
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/701/701-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/701/701-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/701/701-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/701/701-kir3i.md
Daily Temperatureshttps://leetcode.com/problems/daily-temperatures
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/739/739-gusrb3164.cpp
Network Delay Timehttps://leetcode.com/problems/network-delay-time
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/743/743-gusrb3164.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/743/743-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/743/743-yongjoonseo.md
Partition Labelshttps://leetcode.com/problems/partition-labels
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/763/763-kir3i.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/763/763-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/763/763-kir3i.md
Jewels and Stoneshttps://leetcode.com/problems/jewels-and-stones
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/771/771-gusrb3164.cpp
Minimum Distance Between BST Nodeshttps://leetcode.com/problems/minimum-distance-between-bst-nodes
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/783/783-gusrb3164.cpp
Cheapest Flights Within K Stopshttps://leetcode.com/problems/cheapest-flights-within-k-stops
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/787/787-gusrb3164.cpp
Custom Sort Stringhttps://leetcode.com/problems/custom-sort-string
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/791/791-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/791/791-yongjoonseo.md
All Paths From Source to Targethttps://leetcode.com/problems/all-paths-from-source-to-target
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/797/797-kir3i.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/797/797-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/797/797-kir3i.md
Max Increase to Keep City Skylinehttps://leetcode.com/problems/max-increase-to-keep-city-skyline
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/807/807-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/807/807-kir3i.md
Making A Large Islandhttps://leetcode.com/problems/making-a-large-island
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/827/827-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/827/827-yongjoonseo.md
Find and Replace Patternhttps://leetcode.com/problems/find-and-replace-pattern
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/890/890-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/890/890-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/890/890-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/890/890-kir3i.md
Sort an Arrayhttps://leetcode.com/problems/sort-an-array
jshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/912/912-gusrb3164.js
Minimum Add to Make Parentheses Validhttps://leetcode.com/problems/minimum-add-to-make-parentheses-valid
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/921/921-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/921/921-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/921/921-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/921/921-kir3i.md
Long Pressed Namehttps://leetcode.com/problems/long-pressed-name
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/925/925-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/925/925-yongjoonseo.md
Range Sum of BSThttps://leetcode.com/problems/range-sum-of-bst
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/938/938-gusrb3164.cpp
Minimum Increment to Make Array Uniquehttps://leetcode.com/problems/minimum-increment-to-make-array-unique
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/945/945-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/945/945-yongjoonseo.md
Reveal Cards In Increasing Orderhttps://leetcode.com/problems/reveal-cards-in-increasing-order
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/950/950-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/950/950-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/950/950-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/950/950-kir3i.md
K Closest Points to Originhttps://leetcode.com/problems/k-closest-points-to-origin
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/973/973-gusrb3164.cpp
Satisfiability of Equality Equationshttps://leetcode.com/problems/satisfiability-of-equality-equations
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/990/990-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/990/990-yongjoonseo.md
Rotting Orangeshttps://leetcode.com/problems/rotting-oranges
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/994/994-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/994/994-yongjoonseo.md
Construct Binary Search Tree from Preorder Traversalhttps://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1008/1008-kir3i.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1008/1008-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1008/1008-kir3i.md
Binary Search Tree to Greater Sum Treehttps://leetcode.com/problems/binary-search-tree-to-greater-sum-tree
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1038/1038-gusrb3164.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1038/1038-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1038/1038-kir3i.md
Shortest Path in Binary Matrixhttps://leetcode.com/problems/shortest-path-in-binary-matrix
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1091/1091-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1091/1091-yongjoonseo.md
Defanging an IP Addresshttps://leetcode.com/problems/defanging-an-ip-address
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1108/1108-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1108/1108-kir3i.md
Maximum Level Sum of a Binary Treehttps://leetcode.com/problems/maximum-level-sum-of-a-binary-tree
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1161/1161-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1161/1161-yongjoonseo.md
As Far from Land as Possiblehttps://leetcode.com/problems/as-far-from-land-as-possible
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1162/1162-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1162/1162-yongjoonseo.md
Find Elements in a Contaminated Binary Treehttps://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1261/1261-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1261/1261-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1261/1261-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1261/1261-kir3i.md
Group the People Given the Group Size They Belong Tohttps://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1282/1282-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1282/1282-kir3i.md
Remove Covered Intervalshttps://leetcode.com/problems/remove-covered-intervals
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1288/1288-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1288/1288-yongjoonseo.md
Deepest Leaves Sumhttps://leetcode.com/problems/deepest-leaves-sum
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1302/1302-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1302/1302-kir3i.md
All Elements in Two Binary Search Treeshttps://leetcode.com/problems/all-elements-in-two-binary-search-trees
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1305/1305-kir3i.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1305/1305-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1305/1305-kir3i.md
XOR Queries of a Subarrayhttps://leetcode.com/problems/xor-queries-of-a-subarray
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1310/1310-gusrb3164.cpp
Sum of Nodes with Even-Valued Grandparenthttps://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1315/1315-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1315/1315-kir3i.md
Delete Leaves With a Given Valuehttps://leetcode.com/problems/delete-leaves-with-a-given-value
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1325/1325-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1325/1325-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1325/1325-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1325/1325-kir3i.md
Sort the Matrix Diagonallyhttps://leetcode.com/problems/sort-the-matrix-diagonally
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1329/1329-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1329/1329-kir3i.md
Find the City With the Smallest Number of Neighbors at a Threshold Distancehttps://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1334/1334-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1334/1334-yongjoonseo.md
Number of Steps to Reduce a Number to Zerohttps://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1342/1342-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1342/1342-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1342/1342-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1342/1342-kir3i.md
Minimum Number of Steps to Make Two Strings Anagramhttps://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1347/1347-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1347/1347-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1347/1347-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1347/1347-kir3i.md
How Many Numbers Are Smaller Than the Current Numberhttps://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1365/1365-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1365/1365-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1365/1365-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1365/1365-kir3i.md
Find a Corresponding Node of a Binary Tree in a Clone of That Treehttps://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1379/1379-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1379/1379-kir3i.md
Design a Stack With Increment Operationhttps://leetcode.com/problems/design-a-stack-with-increment-operation
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1381/1381-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1381/1381-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1381/1381-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1381/1381-kir3i.md
Balance a Binary Search Treehttps://leetcode.com/problems/balance-a-binary-search-tree
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1382/1382-kir3i.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1382/1382-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1382/1382-kir3i.md
Count Number of Teamshttps://leetcode.com/problems/count-number-of-teams
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1395/1395-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1395/1395-kir3i.md
Queries on a Permutation With Keyhttps://leetcode.com/problems/queries-on-a-permutation-with-key
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1409/1409-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1409/1409-kir3i.md
Shuffle the Arrayhttps://leetcode.com/problems/shuffle-the-array
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1470/1470-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1470/1470-kir3i.md
Running Sum of 1d Arrayhttps://leetcode.com/problems/running-sum-of-1d-array
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1480/1480-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1480/1480-kir3i.md
Number of Good Pairshttps://leetcode.com/problems/number-of-good-pairs
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1512/1512-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1512/1512-kir3i.md
Shuffle Stringhttps://leetcode.com/problems/shuffle-string
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1528/1528-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1528/1528-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1528/1528-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1528/1528-kir3i.md
Make The String Greathttps://leetcode.com/problems/make-the-string-great
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1544/1544-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1544/1544-yongjoonseo.md
Minimum Operations to Make Array Equalhttps://leetcode.com/problems/minimum-operations-to-make-array-equal
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1551/1551-kir3i.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1551/1551-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1551/1551-kir3i.md
Minimum Number of Vertices to Reach All Nodeshttps://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1557/1557-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1557/1557-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1557/1557-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1557/1557-kir3i.md
Maximum Number of Coins You Can Gethttps://leetcode.com/problems/maximum-number-of-coins-you-can-get
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1561/1561-kir3i.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1561/1561-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1561/1561-kir3i.md
Design Parking Systemhttps://leetcode.com/problems/design-parking-system
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1603/1603-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1603/1603-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1603/1603-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1603/1603-kir3i.md
Arithmetic Subarrayshttps://leetcode.com/problems/arithmetic-subarrays
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1630/1630-kir3i.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1630/1630-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1630/1630-kir3i.md
Widest Vertical Area Between Two Points Containing No Pointshttps://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1637/1637-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1637/1637-kir3i.md
Count Sorted Vowel Stringshttps://leetcode.com/problems/count-sorted-vowel-strings
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1641/1641-kir3i.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1641/1641-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1641/1641-kir3i.md
Merge In Between Linked Listshttps://leetcode.com/problems/merge-in-between-linked-lists
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1669/1669-kir3i.cpp
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1669/1669-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1669/1669-kir3i.md
Richest Customer Wealthhttps://leetcode.com/problems/richest-customer-wealth
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1672/1672-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1672/1672-kir3i.md
Partitioning Into Minimum Number Of Deci-Binary Numbershttps://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1689/1689-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1689/1689-kir3i.md
Decode XORed Arrayhttps://leetcode.com/problems/decode-xored-array
cpphttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1720/1720-kir3i.cpp
javahttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1720/1720-kir3i.java
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1720/1720-kir3i.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1720/1720-kir3i.md
Number Of Rectangles That Can Form The Largest Squarehttps://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square
pyhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1725/1725-yongjoonseo.py
mdhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/blob/main/solutions/1725/1725-yongjoonseo.md
https://github.com/all1m-algorithm-study/LeetCode-Solutions#database
https://github.com/all1m-algorithm-study/LeetCode-Solutions#shell
https://github.com/all1m-algorithm-study/LeetCode-Solutions#concurrency
python https://github.com/topics/python
java https://github.com/topics/java
algorithms https://github.com/topics/algorithms
leetcode https://github.com/topics/leetcode
cpp https://github.com/topics/cpp
leetcode-solutions https://github.com/topics/leetcode-solutions
Readme https://github.com/all1m-algorithm-study/LeetCode-Solutions#readme-ov-file
MIT license https://github.com/all1m-algorithm-study/LeetCode-Solutions#MIT-1-ov-file
Please reload this pagehttps://github.com/all1m-algorithm-study/LeetCode-Solutions
Activityhttps://github.com/all1m-algorithm-study/LeetCode-Solutions/activity
Custom propertieshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/custom-properties
4 starshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/stargazers
3 watchinghttps://github.com/all1m-algorithm-study/LeetCode-Solutions/watchers
13 forkshttps://github.com/all1m-algorithm-study/LeetCode-Solutions/forks
Report repository https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fall1m-algorithm-study%2FLeetCode-Solutions&report=all1m-algorithm-study+%28user%29
Contributors 11https://github.com/all1m-algorithm-study/LeetCode-Solutions/graphs/contributors
Please reload this pagehttps://github.com/all1m-algorithm-study/LeetCode-Solutions
Python 46.7% https://github.com/all1m-algorithm-study/LeetCode-Solutions/search?l=python
C++ 35.3% https://github.com/all1m-algorithm-study/LeetCode-Solutions/search?l=c%2B%2B
Java 14.4% https://github.com/all1m-algorithm-study/LeetCode-Solutions/search?l=java
JavaScript 2.7% https://github.com/all1m-algorithm-study/LeetCode-Solutions/search?l=javascript
C 0.9% https://github.com/all1m-algorithm-study/LeetCode-Solutions/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.