René's URL Explorer Experiment


Title: GitHub - AllenTom/Algorithm: algorithm cookbook

Open Graph Title: GitHub - AllenTom/Algorithm: algorithm cookbook

X Title: GitHub - AllenTom/Algorithm: algorithm cookbook

Description: algorithm cookbook. Contribute to AllenTom/Algorithm development by creating an account on GitHub.

Open Graph Description: algorithm cookbook. Contribute to AllenTom/Algorithm development by creating an account on GitHub.

X Description: algorithm cookbook. Contribute to AllenTom/Algorithm development by creating an account on GitHub.

Opengraph URL: https://github.com/AllenTom/Algorithm

X: @github

direct link

Domain: github.com

route-pattern/:user_id/:repository
route-controllerfiles
route-actiondisambiguate
fetch-noncev2:16a98a09-8c8d-f971-d52d-386fe6e0e11b
current-catalog-service-hashf3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb
request-id822C:3A5247:67724:83B64:698D349A
html-safe-nonce035341365d72f9ba53168dd5a8c27fbf8fdd59796566827c993c12045748aaf5
visitor-payloadeyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI4MjJDOjNBNTI0Nzo2NzcyNDo4M0I2NDo2OThEMzQ5QSIsInZpc2l0b3JfaWQiOiI5MjIyMDY1NTM0MTAxODg0NDMiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ==
visitor-hmacc980455a66af528161967d3318bc5f8e59105ae971932713b8cda82ab710b8b9
hovercard-subject-tagrepository:282813231
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/AllenTom/Algorithm
twitter:imagehttps://opengraph.githubassets.com/54bfaff290fefd42177c624e49975d52cccb137430fb66808240010864fe1020/AllenTom/Algorithm
twitter:cardsummary_large_image
og:imagehttps://opengraph.githubassets.com/54bfaff290fefd42177c624e49975d52cccb137430fb66808240010864fe1020/AllenTom/Algorithm
og:image:altalgorithm cookbook. Contribute to AllenTom/Algorithm development by creating an account on GitHub.
og:image:width1200
og:image:height600
og:site_nameGitHub
og:typeobject
hostnamegithub.com
expected-hostnamegithub.com
None685c54ce10ba532f53d13f7d7048395579317474c9e237f293605dec92d65284
turbo-cache-controlno-preview
go-importgithub.com/AllenTom/Algorithm git https://github.com/AllenTom/Algorithm.git
octolytics-dimension-user_id7824261
octolytics-dimension-user_loginAllenTom
octolytics-dimension-repository_id282813231
octolytics-dimension-repository_nwoAllenTom/Algorithm
octolytics-dimension-repository_publictrue
octolytics-dimension-repository_is_forkfalse
octolytics-dimension-repository_network_root_id282813231
octolytics-dimension-repository_network_root_nwoAllenTom/Algorithm
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
release8e173e7f9a7a23f40f2b89fda985ea0b7eb22f63
ui-targetfull
theme-color#1e2327
color-schemelight dark

Links:

Skip to contenthttps://github.com/AllenTom/Algorithm#start-of-content
https://github.com/
Sign in https://github.com/login?return_to=https%3A%2F%2Fgithub.com%2FAllenTom%2FAlgorithm
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%2FAllenTom%2FAlgorithm
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=AllenTom%2FAlgorithm
Reloadhttps://github.com/AllenTom/Algorithm
Reloadhttps://github.com/AllenTom/Algorithm
Reloadhttps://github.com/AllenTom/Algorithm
AllenTom https://github.com/AllenTom
Algorithmhttps://github.com/AllenTom/Algorithm
Notifications https://github.com/login?return_to=%2FAllenTom%2FAlgorithm
Fork 0 https://github.com/login?return_to=%2FAllenTom%2FAlgorithm
Star 0 https://github.com/login?return_to=%2FAllenTom%2FAlgorithm
MIT license https://github.com/AllenTom/Algorithm/blob/master/LICENSE
0 stars https://github.com/AllenTom/Algorithm/stargazers
0 forks https://github.com/AllenTom/Algorithm/forks
Branches https://github.com/AllenTom/Algorithm/branches
Tags https://github.com/AllenTom/Algorithm/tags
Activity https://github.com/AllenTom/Algorithm/activity
Star https://github.com/login?return_to=%2FAllenTom%2FAlgorithm
Notifications https://github.com/login?return_to=%2FAllenTom%2FAlgorithm
Code https://github.com/AllenTom/Algorithm
Issues 0 https://github.com/AllenTom/Algorithm/issues
Pull requests 0 https://github.com/AllenTom/Algorithm/pulls
Actions https://github.com/AllenTom/Algorithm/actions
Projects 0 https://github.com/AllenTom/Algorithm/projects
Security 0 https://github.com/AllenTom/Algorithm/security
Insights https://github.com/AllenTom/Algorithm/pulse
Code https://github.com/AllenTom/Algorithm
Issues https://github.com/AllenTom/Algorithm/issues
Pull requests https://github.com/AllenTom/Algorithm/pulls
Actions https://github.com/AllenTom/Algorithm/actions
Projects https://github.com/AllenTom/Algorithm/projects
Security https://github.com/AllenTom/Algorithm/security
Insights https://github.com/AllenTom/Algorithm/pulse
Brancheshttps://github.com/AllenTom/Algorithm/branches
Tagshttps://github.com/AllenTom/Algorithm/tags
https://github.com/AllenTom/Algorithm/branches
https://github.com/AllenTom/Algorithm/tags
51 Commitshttps://github.com/AllenTom/Algorithm/commits/master/
https://github.com/AllenTom/Algorithm/commits/master/
.gitignorehttps://github.com/AllenTom/Algorithm/blob/master/.gitignore
.gitignorehttps://github.com/AllenTom/Algorithm/blob/master/.gitignore
3Sum.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/3Sum.ipynb
3Sum.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/3Sum.ipynb
Array-Partition-I.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Array-Partition-I.ipynb
Array-Partition-I.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Array-Partition-I.ipynb
Can-Make-Arithmetic-Progression-From-Sequence.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Can-Make-Arithmetic-Progression-From-Sequence.ipynb
Can-Make-Arithmetic-Progression-From-Sequence.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Can-Make-Arithmetic-Progression-From-Sequence.ipynb
Cells-with-Odd-Values-in-a-Matrix.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Cells-with-Odd-Values-in-a-Matrix.ipynb
Cells-with-Odd-Values-in-a-Matrix.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Cells-with-Odd-Values-in-a-Matrix.ipynb
Combination-Sum.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Combination-Sum.ipynb
Combination-Sum.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Combination-Sum.ipynb
Consecutive-Characters.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Consecutive-Characters.ipynb
Consecutive-Characters.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Consecutive-Characters.ipynb
Count-Good-Triplets.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Count-Good-Triplets.ipynb
Count-Good-Triplets.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Count-Good-Triplets.ipynb
Count-Number-of-Teams.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Count-Number-of-Teams.ipynb
Count-Number-of-Teams.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Count-Number-of-Teams.ipynb
Create-Target-Array-in-the-Given-Order.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Create-Target-Array-in-the-Given-Order.ipynb
Create-Target-Array-in-the-Given-Order.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Create-Target-Array-in-the-Given-Order.ipynb
Decrypt-String-from-Alphabet-to-Integer-Mapping.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Decrypt-String-from-Alphabet-to-Integer-Mapping.ipynb
Decrypt-String-from-Alphabet-to-Integer-Mapping.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Decrypt-String-from-Alphabet-to-Integer-Mapping.ipynb
Duplicate-Zeros.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Duplicate-Zeros.ipynb
Duplicate-Zeros.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Duplicate-Zeros.ipynb
Fibonacci-Number.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Fibonacci-Number.ipynb
Fibonacci-Number.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Fibonacci-Number.ipynb
Find-and-Replace-Pattern.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Find-and-Replace-Pattern.ipynb
Find-and-Replace-Pattern.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Find-and-Replace-Pattern.ipynb
Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K.ipynb
Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K.ipynb
Increasing-Order-Search-Tree.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Increasing-Order-Search-Tree.ipynb
Increasing-Order-Search-Tree.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Increasing-Order-Search-Tree.ipynb
Kids-With-the-Greatest-Number-of-Candies.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Kids-With-the-Greatest-Number-of-Candies.ipynb
Kids-With-the-Greatest-Number-of-Candies.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Kids-With-the-Greatest-Number-of-Candies.ipynb
LICENSEhttps://github.com/AllenTom/Algorithm/blob/master/LICENSE
LICENSEhttps://github.com/AllenTom/Algorithm/blob/master/LICENSE
Lemonade-Change.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Lemonade-Change.ipynb
Lemonade-Change.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Lemonade-Change.ipynb
Make-Two-Arrays-Equal-by-Reversing-Sub-arrays.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Make-Two-Arrays-Equal-by-Reversing-Sub-arrays.ipynb
Make-Two-Arrays-Equal-by-Reversing-Sub-arrays.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Make-Two-Arrays-Equal-by-Reversing-Sub-arrays.ipynb
Matrix-Diagonal-Sum.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Matrix-Diagonal-Sum.ipynb
Matrix-Diagonal-Sum.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Matrix-Diagonal-Sum.ipynb
Maximize-Sum-Of-Array-After-K-Negations.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Maximize-Sum-Of-Array-After-K-Negations.ipynb
Maximize-Sum-Of-Array-After-K-Negations.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Maximize-Sum-Of-Array-After-K-Negations.ipynb
Maximum-Depth-of-N-ary-Tree.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Maximum-Depth-of-N-ary-Tree.ipynb
Maximum-Depth-of-N-ary-Tree.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Maximum-Depth-of-N-ary-Tree.ipynb
Maximum-Number-of-Balloons.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Maximum-Number-of-Balloons.ipynb
Maximum-Number-of-Balloons.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Maximum-Number-of-Balloons.ipynb
Maximum-Product-of-Two-Elements-in-an-Array.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Maximum-Product-of-Two-Elements-in-an-Array.ipynb
Maximum-Product-of-Two-Elements-in-an-Array.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Maximum-Product-of-Two-Elements-in-an-Array.ipynb
Maximum-Subarray.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Maximum-Subarray.ipynb
Maximum-Subarray.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Maximum-Subarray.ipynb
Merge-Intervals.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Merge-Intervals.ipynb
Merge-Intervals.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Merge-Intervals.ipynb
Merge-Two-Binary-Trees.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Merge-Two-Binary-Trees.ipynb
Merge-Two-Binary-Trees.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Merge-Two-Binary-Trees.ipynb
Minimum-Number-of-Steps-to-Make-Two-Strings-Anagram.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Minimum-Number-of-Steps-to-Make-Two-Strings-Anagram.ipynb
Minimum-Number-of-Steps-to-Make-Two-Strings-Anagram.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Minimum-Number-of-Steps-to-Make-Two-Strings-Anagram.ipynb
N-ary-Tree-Postorder-Traversal.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/N-ary-Tree-Postorder-Traversal.ipynb
N-ary-Tree-Postorder-Traversal.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/N-ary-Tree-Postorder-Traversal.ipynb
N-ary-Tree-Preorder-Traversal.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/N-ary-Tree-Preorder-Traversal.ipynb
N-ary-Tree-Preorder-Traversal.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/N-ary-Tree-Preorder-Traversal.ipynb
Number-of-Good-Pairs.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Number-of-Good-Pairs.ipynb
Number-of-Good-Pairs.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Number-of-Good-Pairs.ipynb
Number-of-Good-Ways-to-Split-a-String.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Number-of-Good-Ways-to-Split-a-String.ipynb
Number-of-Good-Ways-to-Split-a-String.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Number-of-Good-Ways-to-Split-a-String.ipynb
Number-of-Steps-to-Reduce-a-Number-to-Zero.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Number-of-Steps-to-Reduce-a-Number-to-Zero.ipynb
Number-of-Steps-to-Reduce-a-Number-to-Zero.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Number-of-Steps-to-Reduce-a-Number-to-Zero.ipynb
Pancake-Sorting.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Pancake-Sorting.ipynb
Pancake-Sorting.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Pancake-Sorting.ipynb
Plus-One.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Plus-One.ipynb
Plus-One.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Plus-One.ipynb
README.mdhttps://github.com/AllenTom/Algorithm/blob/master/README.md
README.mdhttps://github.com/AllenTom/Algorithm/blob/master/README.md
Range-Sum-of-BST.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Range-Sum-of-BST.ipynb
Range-Sum-of-BST.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Range-Sum-of-BST.ipynb
Range-Sum-of-Sorted-Subarray-Sums.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Range-Sum-of-Sorted-Subarray-Sums.ipynb
Range-Sum-of-Sorted-Subarray-Sums.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Range-Sum-of-Sorted-Subarray-Sums.ipynb
Reduce-Array-Size-to-The-Half.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Reduce-Array-Size-to-The-Half.ipynb
Reduce-Array-Size-to-The-Half.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Reduce-Array-Size-to-The-Half.ipynb
Reveal-Cards-In-Increasing-Order.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Reveal-Cards-In-Increasing-Order.ipynb
Reveal-Cards-In-Increasing-Order.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Reveal-Cards-In-Increasing-Order.ipynb
Running-Sum-of-1d-Array.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Running-Sum-of-1d-Array.ipynb
Running-Sum-of-1d-Array.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Running-Sum-of-1d-Array.ipynb
Search-Insert-Position.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Search-Insert-Position.ipynb
Search-Insert-Position.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Search-Insert-Position.ipynb
Search-in-a-Binary-Search-Tree.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Search-in-a-Binary-Search-Tree.ipynb
Search-in-a-Binary-Search-Tree.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Search-in-a-Binary-Search-Tree.ipynb
Second-Minimum-Node-In-a-Binary-Tree.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Second-Minimum-Node-In-a-Binary-Tree.ipynb
Second-Minimum-Node-In-a-Binary-Tree.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Second-Minimum-Node-In-a-Binary-Tree.ipynb
Shuffle-the-Array.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Shuffle-the-Array.ipynb
Shuffle-the-Array.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Shuffle-the-Array.ipynb
Split-a-String-in-Balanced-Strings.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Split-a-String-in-Balanced-Strings.ipynb
Split-a-String-in-Balanced-Strings.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Split-a-String-in-Balanced-Strings.ipynb
String-Matching-in-an-Array.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/String-Matching-in-an-Array.ipynb
String-Matching-in-an-Array.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/String-Matching-in-an-Array.ipynb
Subarray-Sum-Equals-K.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Subarray-Sum-Equals-K.ipynb
Subarray-Sum-Equals-K.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Subarray-Sum-Equals-K.ipynb
Subsets.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Subsets.ipynb
Subsets.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Subsets.ipynb
Sum-of-All-Odd-Length-Subarrays.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Sum-of-All-Odd-Length-Subarrays.ipynb
Sum-of-All-Odd-Length-Subarrays.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Sum-of-All-Odd-Length-Subarrays.ipynb
Third-Maximum-Number.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Third-Maximum-Number.ipynb
Third-Maximum-Number.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Third-Maximum-Number.ipynb
Univalued-Binary-Tree.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Univalued-Binary-Tree.ipynb
Univalued-Binary-Tree.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Univalued-Binary-Tree.ipynb
Water-Bottles.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Water-Bottles.ipynb
Water-Bottles.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/Water-Bottles.ipynb
array-offset.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/array-offset.ipynb
array-offset.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/array-offset.ipynb
linked-list.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/linked-list.ipynb
linked-list.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/linked-list.ipynb
public-prefix.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/public-prefix.ipynb
public-prefix.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/public-prefix.ipynb
two-sum.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/two-sum.ipynb
two-sum.ipynbhttps://github.com/AllenTom/Algorithm/blob/master/two-sum.ipynb
READMEhttps://github.com/AllenTom/Algorithm
MIT licensehttps://github.com/AllenTom/Algorithm
https://github.com/AllenTom/Algorithm#algorithm
https://github.com/AllenTom/Algorithm#category
https://github.com/AllenTom/Algorithm#基础
链表https://github.com/AllenTom/Algorithm/blob/master/linked-list.ipynb
https://github.com/AllenTom/Algorithm#array
Fibonacci Number - 509https://github.com/AllenTom/Algorithm/blob/master/Fibonacci-Number.ipynb
Running Sum of 1d Array - 1480https://github.com/AllenTom/Algorithm/blob/master/Running-Sum-of-1d-Array.ipynb
Create Target Array in the Given Order - 1389https://github.com/AllenTom/Algorithm/blob/master/Create-Target-Array-in-the-Given-Order.ipynb
Count Number of Teams - 1395https://github.com/AllenTom/Algorithm/blob/master/Count-Number-of-Teams.ipynb
Maximum Subarray - 53https://github.com/AllenTom/Algorithm/blob/master/Maximum-Subarray.ipynb
Can Make Arithmetic Progression From Sequence - 1502https://github.com/AllenTom/Algorithm/blob/master/Can-Make-Arithmetic-Progression-From-Sequence.ipynb
Count Good Triplets - 1534https://github.com/AllenTom/Algorithm/blob/master/Count-Good-Triplets.ipynb
Make Two Arrays Equal by Reversing Sub-arrays - 1460https://github.com/AllenTom/Algorithm/blob/master/Make-Two-Arrays-Equal-by-Reversing-Sub-arrays.ipynb
Duplicate Zeros - 1089https://github.com/AllenTom/Algorithm/blob/master/Duplicate-Zeros.ipynb
Plus One - 1089https://github.com/AllenTom/Algorithm/blob/master/Plus-One.ipynb
Third Maximum Number - 414https://github.com/AllenTom/Algorithm/blob/master/Third-Maximum-Number.ipynb
Shuffle the Array - 1470https://github.com/AllenTom/Algorithm/blob/master/Shuffle-the-Array.ipynb
Kids With the Greatest Number of Candies - 1431https://github.com/AllenTom/Algorithm/blob/master/Kids-With-the-Greatest-Number-of-Candies.ipynb
Number of Good Pairs - 1512https://github.com/AllenTom/Algorithm/blob/master/Number-of-Good-Pairs.ipynb
Reveal Cards In Increasing Order - 950https://github.com/AllenTom/Algorithm/blob/master/Reveal-Cards-In-Increasing-Order.ipynb
Subsets - 78https://github.com/AllenTom/Algorithm/blob/master/Subsets.ipynb
Range Sum of Sorted Subarray Sums - 1508https://github.com/AllenTom/Algorithm/blob/master/Range-Sum-of-Sorted-Subarray-Sums.ipynb
Combination Sum - 39https://github.com/AllenTom/Algorithm/blob/master/Combination-Sum.ipynb
Search Insert Position - 35https://github.com/AllenTom/Algorithm/blob/master/Search-Insert-Position.ipynb
Find the Minimum Number of Fibonacci Numbers Whose Sum Is K - 1414https://github.com/AllenTom/Algorithm/blob/master/Find-the-Minimum-Number-of-Fibonacci-Numbers-Whose-Sum-Is-K.ipynb
Merge Intervals - 56https://github.com/AllenTom/Algorithm/blob/master/Merge-Intervals.ipynb
Pancake Sorting - 969https://github.com/AllenTom/Algorithm/blob/master/Pancake-Sorting.ipynb
Array Partition I - 561https://github.com/AllenTom/Algorithm/blob/master/Array-Partition-I.ipynb
Consecutive Characters - 1446https://github.com/AllenTom/Algorithm/blob/master/Consecutive-Characters.ipynb
Decrypt String from Alphabet to Integer Mapping - 1309https://github.com/AllenTom/Algorithm/blob/master/Decrypt-String-from-Alphabet-to-Integer-Mapping.ipynb
数组元素移动https://github.com/AllenTom/Algorithm/blob/master/array-offset.ipynb
https://github.com/AllenTom/Algorithm#greedy
Lemonade Change - 860https://github.com/AllenTom/Algorithm/blob/master/Lemonade-Change.ipynb
Water Bottles - 1518https://github.com/AllenTom/Algorithm/blob/master/Water-Bottles.ipynb
Split a String in Balanced Strings - 1221https://github.com/AllenTom/Algorithm/blob/master/Split-a-String-in-Balanced-Strings.ipynb
https://github.com/AllenTom/Algorithm#string
Number of Good Ways to Split a String - 1525https://github.com/AllenTom/Algorithm/blob/master/Number-of-Good-Ways-to-Split-a-String.ipynb
Maximum Number of Balloons - 1189https://github.com/AllenTom/Algorithm/blob/master/Maximum-Number-of-Balloons.ipynb
https://github.com/AllenTom/Algorithm#tree
Increasing Order Search Tree - 897https://github.com/AllenTom/Algorithm/blob/master/Increasing-Order-Search-Tree.ipynb
N-ary Tree Postorder Traversal - 590https://github.com/AllenTom/Algorithm/blob/master/N-ary-Tree-Postorder-Traversal.ipynb
N-ary Tree Preorder Traversal - 589https://github.com/AllenTom/Algorithm/blob/master/N-ary-Tree-Preorder-Traversal.ipynb
Merge Two Binary Trees - 617https://github.com/AllenTom/Algorithm/blob/master/Merge-Two-Binary-Trees.ipynb
Univalued Binary Tree - 965https://github.com/AllenTom/Algorithm/blob/master/Univalued-Binary-Tree.ipynb
Maximum Depth of N-ary Tree - 559https://github.com/AllenTom/Algorithm/blob/master/Maximum-Depth-of-N-ary-Tree.ipynb
Reduce Array Size to The Half - 1338https://github.com/AllenTom/Algorithm/blob/master/Reduce-Array-Size-to-The-Half.ipynb
Search in a Binary Search Tree - 700https://github.com/AllenTom/Algorithm/blob/master/Search-in-a-Binary-Search-Tree.ipynb
https://github.com/AllenTom/Algorithm#其他
最大前缀子串https://github.com/AllenTom/Algorithm/blob/master/public-prefix.ipynb
两数相加https://github.com/AllenTom/Algorithm/blob/master/two-sum.ipynb
Number of Steps to Reduce a Number to Zero - 1342https://github.com/AllenTom/Algorithm/blob/master/Number-of-Steps-to-Reduce-a-Number-to-Zero.ipynb
Readme https://github.com/AllenTom/Algorithm#readme-ov-file
MIT license https://github.com/AllenTom/Algorithm#MIT-1-ov-file
Please reload this pagehttps://github.com/AllenTom/Algorithm
Activityhttps://github.com/AllenTom/Algorithm/activity
0 starshttps://github.com/AllenTom/Algorithm/stargazers
1 watchinghttps://github.com/AllenTom/Algorithm/watchers
0 forkshttps://github.com/AllenTom/Algorithm/forks
Report repository https://github.com/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2FAllenTom%2FAlgorithm&report=AllenTom+%28user%29
Releaseshttps://github.com/AllenTom/Algorithm/releases
Packages 0https://github.com/users/AllenTom/packages?repo_name=Algorithm
Jupyter Notebook 100.0% https://github.com/AllenTom/Algorithm/search?l=jupyter-notebook
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.