Skip to content
Navigation Menu
Toggle navigation
Sign in
Product
GitHub Copilot
Write better code with AI
GitHub Advanced Security
Find and fix vulnerabilities
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Discussions
Collaborate outside of code
Code Search
Find more, search less
Explore
Why GitHub
All features
Documentation
GitHub Skills
Blog
Solutions
By company size
Enterprises
Small and medium teams
Startups
Nonprofits
By use case
DevSecOps
DevOps
CI/CD
View all use cases
By industry
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
Topics
AI
DevOps
Security
Software Development
View all
Explore
Learning Pathways
Events & Webinars
Ebooks & Whitepapers
Customer Stories
Partners
Executive Insights
Open Source
GitHub Sponsors
Fund open source developers
The ReadME Project
GitHub community articles
Repositories
Topics
Trending
Collections
Enterprise
Enterprise platform
AI-powered developer platform
Available add-ons
GitHub Advanced Security
Enterprise-grade security features
Copilot for business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Search or jump to...
Search code, repositories, users, issues, pull requests...
Search syntax tips
Provide feedback
Saved searches
Use saved searches to filter your results more quickly
Sign in
Sign up
Reseting focus
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
Golang-Solutions
/
awesome-golang-algorithm
Public
Notifications
You must be signed in to change notification settings
Fork
1
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
0
Security
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security
Insights
Files
main
Breadcrumbs
awesome-golang-algorithm
/
leetcode
/
1901-2000
/
Copy path
Directory actions
More options
Directory actions
More options
Latest commit
History
History
main
Breadcrumbs
awesome-golang-algorithm
/
leetcode
/
1901-2000
/
Top
Folders and files
Name
Name
Last commit message
Last commit date
parent directory
..
1901.Find-a-Peak-Element-II
1901.Find-a-Peak-Element-II
1903.Largest-Odd-Number-in-String
1903.Largest-Odd-Number-in-String
1904.The-Number-of-Full-Rounds-You-Have-Played
1904.The-Number-of-Full-Rounds-You-Have-Played
1905.Count-Sub-Islands
1905.Count-Sub-Islands
1906.Minimum-Absolute-Difference-Queries
1906.Minimum-Absolute-Difference-Queries
1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasing
1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasing
1910.Remove-All-Occurrences-of-a-Substring
1910.Remove-All-Occurrences-of-a-Substring
1911.Maximum-Alternating-Subsequence-Sum
1911.Maximum-Alternating-Subsequence-Sum
1912.Design-Movie-Rental-System
1912.Design-Movie-Rental-System
1913.Maximum-Product-Difference-Between-Two-Pairs
1913.Maximum-Product-Difference-Between-Two-Pairs
1914.Cyclically-Rotating-a-Grid
1914.Cyclically-Rotating-a-Grid
1915.Number-of-Wonderful-Substrings
1915.Number-of-Wonderful-Substrings
1916.Count-Ways-to-Build-Rooms-in-an-Ant-Colony
1916.Count-Ways-to-Build-Rooms-in-an-Ant-Colony
1920.Build-Array-from-Permutation
1920.Build-Array-from-Permutation
1921.Eliminate-Maximum-Number-of-Monsters
1921.Eliminate-Maximum-Number-of-Monsters
1922.Count-Good-Numbers
1922.Count-Good-Numbers
1923.Longest-Common-Subpath
1923.Longest-Common-Subpath
1925.Count-Square-Sum-Triples
1925.Count-Square-Sum-Triples
1926.Nearest-Exit-from-Entrance-in-Maze
1926.Nearest-Exit-from-Entrance-in-Maze
1927.Sum-Game
1927.Sum-Game
1928.Minimum-Cost-to-Reach-Destination-in-Time
1928.Minimum-Cost-to-Reach-Destination-in-Time
1929.Concatenation-of-Array
1929.Concatenation-of-Array
1930.Unique-Length-3-Palindromic-Subsequences
1930.Unique-Length-3-Palindromic-Subsequences
1931.Painting-a-Grid-With-Three-Different-Colors
1931.Painting-a-Grid-With-Three-Different-Colors
1932.Merge-BSTs-to-Create-Single-BST
1932.Merge-BSTs-to-Create-Single-BST
1935.Maximum-Number-of-Words-You-Can-Type
1935.Maximum-Number-of-Words-You-Can-Type
1936.Add-Minimum-Number-of-Rungs
1936.Add-Minimum-Number-of-Rungs
1937.Maximum-Number-of-Points-with-Cost
1937.Maximum-Number-of-Points-with-Cost
1938.Maximum-Genetic-Difference-Query
1938.Maximum-Genetic-Difference-Query
1941.Check-if-All-Characters-Have-Equal-Number-of-Occurrences
1941.Check-if-All-Characters-Have-Equal-Number-of-Occurrences
1942.The-Number-of-the-Smallest-Unoccupied-Chair
1942.The-Number-of-the-Smallest-Unoccupied-Chair
1943.Describe-the-Painting
1943.Describe-the-Painting
1944.Number-of-Visible-People-in-a-Queue
1944.Number-of-Visible-People-in-a-Queue
1945.Sum-of-Digits-of-String-After-Convert
1945.Sum-of-Digits-of-String-After-Convert
1946.Largest-Number-After-Mutating-Substring
1946.Largest-Number-After-Mutating-Substring
1947.Maximum-Compatibility-Score-Sum
1947.Maximum-Compatibility-Score-Sum
1948.Delete-Duplicate-Folders-in-System
1948.Delete-Duplicate-Folders-in-System
1952.Three-Divisors
1952.Three-Divisors
1953.Maximum-Number-of-Weeks-for-Which-You-Can-Work
1953.Maximum-Number-of-Weeks-for-Which-You-Can-Work
1954.Minimum-Garden-Perimeter-to-Collect-Enough-Apples
1954.Minimum-Garden-Perimeter-to-Collect-Enough-Apples
1955.Count-Number-of-Special-Subsequences
1955.Count-Number-of-Special-Subsequences
1957.Delete-Characters-to-Make-Fancy-String
1957.Delete-Characters-to-Make-Fancy-String
1958.Check-if-Move-is-Legal
1958.Check-if-Move-is-Legal
1959.Minimum-Total-Space-Wasted-With-K-Resizing-Operations
1959.Minimum-Total-Space-Wasted-With-K-Resizing-Operations
1960.Maximum-Product-of-the-Length-of-Two-Palindromic-Substrings
1960.Maximum-Product-of-the-Length-of-Two-Palindromic-Substrings
1961.Check-If-String-Is-a-Prefix-of-Array
1961.Check-If-String-Is-a-Prefix-of-Array
1962.Remove-Stones-to-Minimize-the-Total
1962.Remove-Stones-to-Minimize-the-Total
1963.Minimum-Number-of-Swaps-to-Make-the-String-Balanced
1963.Minimum-Number-of-Swaps-to-Make-the-String-Balanced
1964.Find-the-Longest-Valid-Obstacle-Course-at-Each-Position
1964.Find-the-Longest-Valid-Obstacle-Course-at-Each-Position
1967.Number-of-Strings-That-Appear-as-Substrings-in-Word
1967.Number-of-Strings-That-Appear-as-Substrings-in-Word
1968.Array-With-Elements-Not-Equal-to-Average-of-Neighbors
1968.Array-With-Elements-Not-Equal-to-Average-of-Neighbors
1969.Minimum-Non-Zero-Product-of-the-Array-Elements
1969.Minimum-Non-Zero-Product-of-the-Array-Elements
1970.Last-Day-Where-You-Can-Still-Cross
1970.Last-Day-Where-You-Can-Still-Cross
1971.Find-if-Path-Exists-in-Graph
1971.Find-if-Path-Exists-in-Graph
1974.Minimum-Time-to-Type-Word-Using-Special-Typewriter
1974.Minimum-Time-to-Type-Word-Using-Special-Typewriter
1975.Maximum-Matrix-Sum
1975.Maximum-Matrix-Sum
1976.Number-of-Ways-to-Arrive-at-Destination
1976.Number-of-Ways-to-Arrive-at-Destination
1977.Number-of-Ways-to-Separate-Numbers
1977.Number-of-Ways-to-Separate-Numbers
1979.Find-Greatest-Common-Divisor-of-Array
1979.Find-Greatest-Common-Divisor-of-Array
1980.Find-Unique-Binary-String
1980.Find-Unique-Binary-String
1981.Minimize-the-Difference-Between-Target-and-Chosen-Elements
1981.Minimize-the-Difference-Between-Target-and-Chosen-Elements
1982.Find-Array-Given-Subset-Sums
1982.Find-Array-Given-Subset-Sums
1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores
1984.Minimum-Difference-Between-Highest-and-Lowest-of-K-Scores
1985.Find-the-Kth-Largest-Integer-in-the-Array
1985.Find-the-Kth-Largest-Integer-in-the-Array
1986.Minimum-Number-of-Work-Sessions-to-Finish-the-Tasks
1986.Minimum-Number-of-Work-Sessions-to-Finish-the-Tasks
1987.Number-of-Unique-Good-Subsequences
1987.Number-of-Unique-Good-Subsequences
1991.Find-the-Middle-Index-in-Array
1991.Find-the-Middle-Index-in-Array
1992.Find-All-Groups-of-Farmland
1992.Find-All-Groups-of-Farmland
1993.Operations-on-Tree
1993.Operations-on-Tree
1994.The-Number-of-Good-Subsets
1994.The-Number-of-Good-Subsets
1995.Count-Special-Quadruplets
1995.Count-Special-Quadruplets
1996.The-Number-of-Weak-Characters-in-the-Game
1996.The-Number-of-Weak-Characters-in-the-Game
1997.First-Day-Where-You-Have-Been-in-All-the-Rooms
1997.First-Day-Where-You-Have-Been-in-All-the-Rooms
1998.GCD-Sort-of-an-Array
1998.GCD-Sort-of-an-Array
2000.Reverse-Prefix-of-Word
2000.Reverse-Prefix-of-Word
View all files
You can’t perform that action at this time.