René's URL Explorer Experiment


Title: leetcode/README_EN.md at main · ly520/leetcode · GitHub

Open Graph Title: leetcode/README_EN.md at main · ly520/leetcode

X Title: leetcode/README_EN.md at main · ly520/leetcode

Description: 😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - leetcode/README_EN.md at main · ly520/leetcode

Open Graph Description: 😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - ly520/leetcode

X Description: 😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - ly520/leetcode

Opengraph URL: https://github.com/ly520/leetcode/blob/main/README_EN.md

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository/blob/*name(/*path)
route-controllerblob
route-actionshow
fetch-noncev2:3a9dd2ea-c9cb-499e-7cd0-4e98e94c9a62
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-idCF26:29BE58:430DFE7:5A2C9DD:6A653231
html-safe-nonceff5e142008be5283835ae2d79e23ea9301b1240b3a9d2ca092bab2ba864eae38
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJDRjI2OjI5QkU1ODo0MzBERkU3OjVBMkM5REQ6NkE2NTMyMzEiLCJ2aXNpdG9yX2lkIjoiODY4MjQ5OTIyMjE0MjI2Nzk1MyIsInJlZ2lvbl9lZGdlIjoiaWFkIiwicmVnaW9uX3JlbmRlciI6ImlhZCJ9
visitor-hmac9871ee1fa30277672f6027770947c68a54842de18142930762b981f8bc5a0933
hovercard-subject-tagrepository:462599680
github-keyboard-shortcutsrepository,source-code,file-tree,copilot
google-site-verificationApib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I
octolytics-urlhttps://collector.github.com/github/collect
analytics-location///blob/show
fb:app_id1401488693436528
apple-itunes-appapp-id=1477376905, app-argument=https://github.com/ly520/leetcode/blob/main/README_EN.md
twitter:imagehttps://opengraph.githubassets.com/b4a45935bfb327a13416501d7a203f44f8e4ea77db0b47ab24250e30ef4d736d/ly520/leetcode
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/b4a45935bfb327a13416501d7a203f44f8e4ea77db0b47ab24250e30ef4d736d/ly520/leetcode
og:image:alt😏 LeetCode solutions in any programming language | 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 - ly520/leetcode
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None52c76df668885aaff23b50bdca1fa1ea44ac9c1553e888ebc70ff1e4daa4625b
turbo-cache-controlno-cache
go-importgithub.com/ly520/leetcode git https://github.com/ly520/leetcode.git
octolytics-dimension-user_id8967751
octolytics-dimension-user_loginly520
octolytics-dimension-repository_id462599680
octolytics-dimension-repository_nwoly520/leetcode
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forktrue
octolytics-dimension-repository_parent_id149001365
octolytics-dimension-repository_parent_nwodoocs/leetcode
octolytics-dimension-repository_network_root_id149001365
octolytics-dimension-repository_network_root_nwodoocs/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
release309153364422b3c499922d1a2a6404910a58ed8e
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/ly520/leetcode/blob/main/README_EN.md#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fly520%2Fleetcode%2Fblob%2Fmain%2FREADME_EN.md
GitHub CopilotWrite better code with AIhttps://github.com/features/copilot
GitHub Copilot appDirect agents from issue to mergehttps://github.com/features/ai/github-app
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
Code QualityEnforce quality at mergehttps://github.com/features/code-quality
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
View all resourceshttps://github.com/resources
GitHub SponsorsFund open source developershttps://github.com/open-source/sponsors
Security Labhttps://securitylab.github.com
Maintainer Communityhttps://maintainers.github.com
Acceleratorhttps://github.com/open-source/accelerator
GitHub Starshttps://stars.github.com
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/enterprise/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%2Fly520%2Fleetcode%2Fblob%2Fmain%2FREADME_EN.md
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%2Fblob%2Fshow&source=header-repo&source_repo=ly520%2Fleetcode
Reloadhttps://github.com/ly520/leetcode/blob/main/README_EN.md
Reloadhttps://github.com/ly520/leetcode/blob/main/README_EN.md
Reloadhttps://github.com/ly520/leetcode/blob/main/README_EN.md
ly520 https://github.com/ly520
leetcodehttps://github.com/ly520/leetcode
doocs/leetcodehttps://github.com/doocs/leetcode
Notifications https://github.com/login?return_to=%2Fly520%2Fleetcode
Fork 0 https://github.com/login?return_to=%2Fly520%2Fleetcode
Star 0 https://github.com/login?return_to=%2Fly520%2Fleetcode
Code https://github.com/ly520/leetcode
Pull requests 0 https://github.com/ly520/leetcode/pulls
Actions https://github.com/ly520/leetcode/actions
Projects https://github.com/ly520/leetcode/projects
Security and quality 0 https://github.com/ly520/leetcode/security
Insights https://github.com/ly520/leetcode/pulse
Code https://github.com/ly520/leetcode
Pull requests https://github.com/ly520/leetcode/pulls
Actions https://github.com/ly520/leetcode/actions
Projects https://github.com/ly520/leetcode/projects
Security and quality https://github.com/ly520/leetcode/security
Insights https://github.com/ly520/leetcode/pulse
https://github.com/ly520/leetcode
leetcodehttps://github.com/ly520/leetcode/tree/main
Historyhttps://github.com/ly520/leetcode/commits/main/README_EN.md
https://github.com/ly520/leetcode/commits/main/README_EN.md
leetcodehttps://github.com/ly520/leetcode/tree/main
Rawhttps://github.com/ly520/leetcode/raw/refs/heads/main/README_EN.md
https://github.com/doocs/leetcode
https://github.com/doocs/leetcode
https://doocs.github.io/#/?id=how-to-join
https://github.com/doocs/leetcode/blob/main/LICENSE
https://opencollective.com/doocs-leetcode/backers/badge.svg
https://github.com/doocs/leetcode/stargazers
https://github.com/doocs/leetcode/network/members
https://opencollective.com/doocs-leetcode/sponsors/badge.svg
https://github.com/ly520/leetcode/blob/main/README_EN.md#introduction
LeetCodehttps://leetcode.com/problemset/all/
LCOFhttps://leetcode-cn.com/problemset/lcof/
LCCIhttps://leetcode-cn.com/problemset/lcci/
starhttps://github.com/doocs/leetcode
中文文档https://github.com/ly520/leetcode/blob/main/README.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#sites
https://lc.netlify.apphttps://lc.netlify.app
https://doocs.github.io/leetcodehttps://doocs.github.io/leetcode
https://github.com/ly520/leetcode/blob/main/README_EN.md#solutions
LeetCodehttps://github.com/ly520/leetcode/blob/main/solution/README_EN.md
LCOF: Coding Interviews, 2nd Editionhttps://github.com/ly520/leetcode/blob/main/lcof/README_EN.md
LCCI: Cracking the Coding Interview, 6th Editionhttps://github.com/ly520/leetcode/blob/main/lcci/README_EN.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#basic-algorithms
https://github.com/ly520/leetcode/blob/main/README_EN.md#sorting
Bubble Sorthttps://github.com/ly520/leetcode/blob/main/basic/sorting/BubbleSort/README.md
Insertion Sorthttps://github.com/ly520/leetcode/blob/main/basic/sorting/InsertionSort/README.md
Selection Sorthttps://github.com/ly520/leetcode/blob/main/basic/sorting/SelectionSort/README.md
Merge Sort(Algorithm Template)https://github.com/ly520/leetcode/blob/main/basic/sorting/MergeSort/README.md
Quick Sort(Algorithm Template)https://github.com/ly520/leetcode/blob/main/basic/sorting/QuickSort/README.md
Shell Sorthttps://github.com/ly520/leetcode/blob/main/basic/sorting/ShellSort/README.md
Heap Sort(Algorithm Template)https://github.com/ly520/leetcode/blob/main/basic/sorting/HeapSort/README.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#searching
Binary Search(Algorithm Template)https://github.com/ly520/leetcode/blob/main/basic/searching/BinarySearch/README_EN.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#high-frequency-interview-questions
https://github.com/ly520/leetcode/blob/main/README_EN.md#arrays
Majority Elementhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0169.Majority%20Element/README_EN.md
Remove Duplicates from Sorted Arrayhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0026.Remove%20Duplicates%20from%20Sorted%20Array/README_EN.md
Remove Duplicates from Sorted Array IIhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0080.Remove%20Duplicates%20from%20Sorted%20Array%20II/README_EN.md
Remove Elementhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0027.Remove%20Element/README_EN.md
Move Zeroeshttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0283.Move%20Zeroes/README_EN.md
Rotate Arrayhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0189.Rotate%20Array/README_EN.md
Spiral Matrixhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0054.Spiral%20Matrix/README_EN.md
Two Sumhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0001.Two%20Sum/README_EN.md
3Sumhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0015.3Sum/README_EN.md
4Sumhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0018.4Sum/README_EN.md
3Sum Smallerhttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0259.3Sum%20Smaller/README_EN.md
3Sum Closesthttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0016.3Sum%20Closest/README_EN.md
Merge Sorted Arrayhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0088.Merge%20Sorted%20Array/README_EN.md
Find Minimum in Rotated Sorted Arrayhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0153.Find%20Minimum%20in%20Rotated%20Sorted%20Array/README_EN.md
Find Minimum in Rotated Sorted Array IIhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0154.Find%20Minimum%20in%20Rotated%20Sorted%20Array%20II/README_EN.md
Product of Array Except Selfhttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0238.Product%20of%20Array%20Except%20Self/README_EN.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#strings
Longest Substring Without Repeating Charactershttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README_EN.md
Longest Common Prefixhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0014.Longest%20Common%20Prefix/README_EN.md
Reverse Vowels of a Stringhttps://github.com/ly520/leetcode/blob/main/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README_EN.md
String to Integer (atoi)https://github.com/ly520/leetcode/blob/main/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README_EN.md
Ransom Notehttps://github.com/ly520/leetcode/blob/main/solution/0300-0399/0383.Ransom%20Note/README_EN.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#linked-list
Add Two Numbershttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0002.Add%20Two%20Numbers/README_EN.md
Add Two Numbers IIhttps://github.com/ly520/leetcode/blob/main/solution/0400-0499/0445.Add%20Two%20Numbers%20II/README_EN.md
Delete Node in a Linked Listhttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README_EN.md
Remove Duplicates from Sorted Listhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0083.Remove%20Duplicates%20from%20Sorted%20List/README_EN.md
Remove Duplicates from Sorted List IIhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0082.Remove%20Duplicates%20from%20Sorted%20List%20II/README_EN.md
Remove Linked List Elementshttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0203.Remove%20Linked%20List%20Elements/README_EN.md
Kth Node From End of Listhttps://github.com/ly520/leetcode/blob/main/lcci/02.02.Kth%20Node%20From%20End%20of%20List/README_EN.md
Swap Nodes in Pairshttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README_EN.md
Merge Two Sorted Listshttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README_EN.md
Merge k Sorted Listshttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README_EN.md
Insertion Sort Listhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0147.Insertion%20Sort%20List/README_EN.md
Sort Listhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0148.Sort%20List/README_EN.md
Reverse Linked Listhttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0206.Reverse%20Linked%20List/README_EN.md
Reverse Linked List IIhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0092.Reverse%20Linked%20List%20II/README_EN.md
Reorder Listhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0143.Reorder%20List/README_EN.md
Rotate Listhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0061.Rotate%20List/README_EN.md
Palindrome Linked Listhttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0234.Palindrome%20Linked%20List/README_EN.md
Intersection of Two Linked Listshttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README_EN.md
Odd Even Linked Listhttps://github.com/ly520/leetcode/blob/main/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README_EN.md
Linked List Cyclehttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0141.Linked%20List%20Cycle/README_EN.md
Linked List Cycle IIhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README_EN.md
Design Linked Listhttps://github.com/ly520/leetcode/blob/main/solution/0700-0799/0707.Design%20Linked%20List/README_EN.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#binary-tree
Binary Tree Preorder Traversalhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0144.Binary%20Tree%20Preorder%20Traversal/README_EN.md
Binary Tree Postorder Traversalhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0145.Binary%20Tree%20Postorder%20Traversal/README_EN.md
Binary Tree Inorder Traversalhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0094.Binary%20Tree%20Inorder%20Traversal/README_EN.md
Symmetric Treehttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0101.Symmetric%20Tree/README_EN.md
Invert Binary Treehttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0226.Invert%20Binary%20Tree/README_EN.md
Binary Tree Level Order Traversalhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0102.Binary%20Tree%20Level%20Order%20Traversal/README_EN.md
Binary Tree Level Order Traversal IIhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0107.Binary%20Tree%20Level%20Order%20Traversal%20II/README_EN.md
Binary Tree Right Side Viewhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/README_EN.md
Maximum Depth of Binary Treehttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0104.Maximum%20Depth%20of%20Binary%20Tree/README_EN.md
Minimum Depth of Binary Treehttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0111.Minimum%20Depth%20of%20Binary%20Tree/README_EN.md
Binary Tree Pathshttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0257.Binary%20Tree%20Paths/README_EN.md
Path Sumhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0112.Path%20Sum/README_EN.md
Path Sum IIhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0113.Path%20Sum%20II/README_EN.md
Construct Binary Tree from Preorder and Inorder Traversalhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/README_EN.md
Construct Binary Tree from Inorder and Postorder Traversalhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0106.Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal/README_EN.md
Binary Search Tree Iteratorhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0173.Binary%20Search%20Tree%20Iterator/README_EN.md
Lowest Common Ancestor of a Binary Treehttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README_EN.md
Lowest Common Ancestor of a Binary Search Treehttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README_EN.md
BiNodehttps://github.com/ly520/leetcode/blob/main/lcci/17.12.BiNode/README_EN.md
Convert Binary Search Tree to Sorted Doubly Linked Listhttps://github.com/ly520/leetcode/blob/main/solution/0400-0499/0426.Convert%20Binary%20Search%20Tree%20to%20Sorted%20Doubly%20Linked%20List/README_EN.md
Boundary of Binary Treehttps://github.com/ly520/leetcode/blob/main/solution/0500-0599/0545.Boundary%20of%20Binary%20Tree/README_EN.md
Populating Next Right Pointers in Each Nodehttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node/README_EN.md
Populating Next Right Pointers in Each Node IIhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II/README_EN.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#math
Integer to Romanhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0012.Integer%20to%20Roman/README_EN.md
Roman to Integerhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0013.Roman%20to%20Integer/README_EN.md
Single Numberhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0136.Single%20Number/README_EN.md
Single Number IIhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0137.Single%20Number%20II/README_EN.md
Single Number IIIhttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0260.Single%20Number%20III/README_EN.md
Set Mismatchhttps://github.com/ly520/leetcode/blob/main/solution/0600-0699/0645.Set%20Mismatch/README_EN.md
Number of 1 Bitshttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0191.Number%20of%201%20Bits/README_EN.md
Count Primeshttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0204.Count%20Primes/README_EN.md
Missing Numberhttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0268.Missing%20Number/README_EN.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#stack--queue
Valid Parentheseshttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0020.Valid%20Parentheses/README_EN.md
Min Stackhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0155.Min%20Stack/README_EN.md
Implement Queue using Stackshttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README_EN.md
Implement Stack using Queueshttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README_EN.md
Evaluate Reverse Polish Notationhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README_EN.md
Number of Recent Callshttps://github.com/ly520/leetcode/blob/main/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README_EN.md
Daily Temperatureshttps://github.com/ly520/leetcode/blob/main/solution/0700-0799/0739.Daily%20Temperatures/README_EN.md
Basic Calculator IIhttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0227.Basic%20Calculator%20II/README_EN.md
Next Greater Element Ihttps://github.com/ly520/leetcode/blob/main/solution/0400-0499/0496.Next%20Greater%20Element%20I/README_EN.md
Next Greater Element IIhttps://github.com/ly520/leetcode/blob/main/solution/0500-0599/0503.Next%20Greater%20Element%20II/README_EN.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#dynamic-programming
Fibonacci Numberhttps://github.com/ly520/leetcode/blob/main/solution/0500-0599/0509.Fibonacci%20Number/README_EN.md
N-th Tribonacci Numberhttps://github.com/ly520/leetcode/blob/main/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README_EN.md
Climbing Stairshttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0070.Climbing%20Stairs/README_EN.md
Min Cost Climbing Stairshttps://github.com/ly520/leetcode/blob/main/solution/0700-0799/0746.Min%20Cost%20Climbing%20Stairs/README_EN.md
House Robberhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0198.House%20Robber/README_EN.md
House Robber IIhttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0213.House%20Robber%20II/README_EN.md
Delete and Earnhttps://github.com/ly520/leetcode/blob/main/solution/0700-0799/0740.Delete%20and%20Earn/README_EN.md
Jump Gamehttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0055.Jump%20Game/README_EN.md
Jump Game IIhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0045.Jump%20Game%20II/README_EN.md
Maximum Subarrayhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0053.Maximum%20Subarray/README_EN.md
Maximum Sum Circular Subarrayhttps://github.com/ly520/leetcode/blob/main/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README_EN.md
Maximum Product Subarrayhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0152.Maximum%20Product%20Subarray/README_EN.md
Maximum Length of Subarray With Positive Producthttps://github.com/ly520/leetcode/blob/main/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README_EN.md
Best Sightseeing Pairhttps://github.com/ly520/leetcode/blob/main/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README_EN.md
Best Time to Buy and Sell Stockhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0121.Best%20Time%20to%20Buy%20and%20Sell%20Stock/README_EN.md
Best Time to Buy and Sell Stock IIhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0122.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II/README_EN.md
Best Time to Buy and Sell Stock IIIhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0123.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III/README_EN.md
Best Time to Buy and Sell Stock with Cooldownhttps://github.com/ly520/leetcode/blob/main/solution/0300-0399/0309.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown/README_EN.md
Best Time to Buy and Sell Stock with Transaction Feehttps://github.com/ly520/leetcode/blob/main/solution/0700-0799/0714.Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee/README_EN.md
Word Breakhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0139.Word%20Break/README_EN.md
Trapping Rain Waterhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0042.Trapping%20Rain%20Water/README_EN.md
Arithmetic Sliceshttps://github.com/ly520/leetcode/blob/main/solution/0400-0499/0413.Arithmetic%20Slices/README_EN.md
Decode Wayshttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0091.Decode%20Ways/README_EN.md
Unique Binary Search Treeshttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0096.Unique%20Binary%20Search%20Trees/README_EN.md
Ugly Number IIhttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0264.Ugly%20Number%20II/README_EN.md
Pascal's Trianglehttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0118.Pascal%27s%20Triangle/README_EN.md
Pascal's Triangle IIhttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0119.Pascal%27s%20Triangle%20II/README_EN.md
Minimum Falling Path Sumhttps://github.com/ly520/leetcode/blob/main/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README_EN.md
Trianglehttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0120.Triangle/README_EN.md
Matrix Block Sumhttps://github.com/ly520/leetcode/blob/main/solution/1300-1399/1314.Matrix%20Block%20Sum/README_EN.md
Range Sum Query 2D - Immutablehttps://github.com/ly520/leetcode/blob/main/solution/0300-0399/0304.Range%20Sum%20Query%202D%20-%20Immutable/README_EN.md
Unique Pathshttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0062.Unique%20Paths/README_EN.md
Unique Paths IIhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0063.Unique%20Paths%20II/README_EN.md
Minimum Path Sumhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0064.Minimum%20Path%20Sum/README_EN.md
Longest Palindromic Substringhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README_EN.md
Longest Palindromic Subsequencehttps://github.com/ly520/leetcode/blob/main/.solution/0500-0599/0516.Longest%20Palindromic%20Subsequence/README_EN.md
Longest Increasing Subsequencehttps://github.com/ly520/leetcode/blob/main/solution/0300-0399/0300.Longest%20Increasing%20Subsequence/README_EN.md
Wiggle Subsequencehttps://github.com/ly520/leetcode/blob/main/solution/0300-0399/0376.Wiggle%20Subsequence/README_EN.md
Longest Common Subsequencehttps://github.com/ly520/leetcode/blob/main/solution/1100-1199/1143.Longest%20Common%20Subsequence/README_EN.md
Edit Distancehttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0072.Edit%20Distance/README_EN.md
Coin Changehttps://github.com/ly520/leetcode/blob/main/solution/0300-0399/0322.Coin%20Change/README_EN.md
Coin Change 2https://github.com/ly520/leetcode/blob/main/solution/0500-0599/0518.Coin%20Change%202/README_EN.md
Combination Sum IVhttps://github.com/ly520/leetcode/blob/main/solution/0300-0399/0377.Combination%20Sum%20IV/README_EN.md
Integer Breakhttps://github.com/ly520/leetcode/blob/main/solution/0300-0399/0343.Integer%20Break/README_EN.md
Perfect Squareshttps://github.com/ly520/leetcode/blob/main/solution/0200-0299/0279.Perfect%20Squares/README_EN.md
Russian Doll Envelopeshttps://github.com/ly520/leetcode/blob/main/solution/0300-0399/0354.Russian%20Doll%20Envelopes/README_EN.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#backtracking
Subsetshttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0078.Subsets/README_EN.md
Subsets IIhttps://github.com/ly520/leetcode/blob/main/solution/0000-0099/0090.Subsets%20II/README_EN.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#union-find
Surrounded Regionshttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0130.Surrounded%20Regions/README_EN.md
Number of Provinceshttps://github.com/ly520/leetcode/blob/main/solution/0500-0599/0547.Number%20of%20Provinces/README_EN.md
Redundant Connectionhttps://github.com/ly520/leetcode/blob/main/solution/0600-0699/0684.Redundant%20Connection/README_EN.md
Possible Bipartitionhttps://github.com/ly520/leetcode/blob/main/solution/0800-0899/0886.Possible%20Bipartition/README_EN.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#design
LRU Cachehttps://github.com/ly520/leetcode/blob/main/solution/0100-0199/0146.Lru%20Cache/README_EN.md
Implement Trie (Prefix Tree)https://github.com/ly520/leetcode/blob/main/solution/0200-0299/0208.Implement%20Trie%20%28Prefix%20Tree%29/README_EN.md
Implement Trie II (Prefix Tree)https://github.com/ly520/leetcode/blob/main/solution/1800-1899/1804.Implement%20Trie%20II%20%28Prefix%20Tree%29/README_EN.md
Design Circular Queuehttps://github.com/ly520/leetcode/blob/main/solution/0600-0699/0622.Design%20Circular%20Queue/README_EN.md
Design Circular Dequehttps://github.com/ly520/leetcode/blob/main/solution/0600-0699/0641.Design%20Circular%20Deque/README_EN.md
Design HashSethttps://github.com/ly520/leetcode/blob/main/solution/0700-0799/0705.Design%20HashSet/README_EN.md
Design HashMaphttps://github.com/ly520/leetcode/blob/main/solution/0700-0799/0706.Design%20HashMap/README_EN.md
https://github.com/ly520/leetcode/blob/main/README_EN.md#maintainers
Yang Libinhttps://github.com/yanglbme
Mao Longlonghttps://github.com/MaoLongLong
https://github.com/ly520/leetcode/blob/main/README_EN.md#contributions
PRshttps://github.com/doocs/leetcode/pulls
this repositoryhttps://github.com/doocs/leetcode
CONTRIBUTINGhttps://github.com/doocs/.github/blob/main/CONTRIBUTING.md
GitHub Helphttps://help.github.com/en
https://github.com/doocs/leetcode
doocs/leetcodehttps://github.com/doocs/leetcode
Gitpod.iohttps://www.gitpod.io
https://gitpod.io/#https://github.com/doocs/leetcode
https://github.com/ly520/leetcode/blob/main/README_EN.md#stargazers-over-time
https://github.com/doocs/leetcode/stargazers
https://github.com/ly520/leetcode/blob/main/README_EN.md#contributors
https://github.com/doocs/leetcode/graphs/contributors
https://github.com/ly520/leetcode/blob/main/README_EN.md#backers--sponsors
https://opencollective.com/doocs-leetcode/backers.svg?width=890
https://opencollective.com/doocs-leetcode/sponsors.svg?width=890
Alan Yessenbayevhttps://opencollective.com/alan-yessenbayev
https://github.com/ly520/leetcode/blob/main/README_EN.md#license
Creative Commons Attribution-ShareAlike 4.0 International Licensehttp://creativecommons.org/licenses/by-sa/4.0/
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.