Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
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
/
Sign in
Sign up
Appearance settings
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 }}
bomeng
/
learning_python
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Files
Expand file tree
main
Breadcrumbs
learning_python
/
solution
/
1000-1099
/
Copy path
Directory actions
More options
More options
Directory actions
More options
More options
Latest commit
History
History
History
main
Breadcrumbs
learning_python
/
solution
/
1000-1099
/
Copy path
Top
Folders and files
Name
Name
Last commit message
Last commit date
parent directory
..
1000.Minimum Cost to Merge Stones
1000.Minimum Cost to Merge Stones
1001.Grid Illumination
1001.Grid Illumination
1002.Find Common Characters
1002.Find Common Characters
1003.Check If Word Is Valid After Substitutions
1003.Check If Word Is Valid After Substitutions
1004.Max Consecutive Ones III
1004.Max Consecutive Ones III
1005.Maximize Sum Of Array After K Negations
1005.Maximize Sum Of Array After K Negations
1006.Clumsy Factorial
1006.Clumsy Factorial
1007.Minimum Domino Rotations For Equal Row
1007.Minimum Domino Rotations For Equal Row
1008.Construct Binary Search Tree from Preorder Traversal
1008.Construct Binary Search Tree from Preorder Traversal
1009.Complement of Base 10 Integer
1009.Complement of Base 10 Integer
1010.Pairs of Songs With Total Durations Divisible by 60
1010.Pairs of Songs With Total Durations Divisible by 60
1011.Capacity To Ship Packages Within D Days
1011.Capacity To Ship Packages Within D Days
1012.Numbers With Repeated Digits
1012.Numbers With Repeated Digits
1013.Partition Array Into Three Parts With Equal Sum
1013.Partition Array Into Three Parts With Equal Sum
1014.Best Sightseeing Pair
1014.Best Sightseeing Pair
1015.Smallest Integer Divisible by K
1015.Smallest Integer Divisible by K
1016.Binary String With Substrings Representing 1 To N
1016.Binary String With Substrings Representing 1 To N
1017.Convert to Base -2
1017.Convert to Base -2
1018.Binary Prefix Divisible By 5
1018.Binary Prefix Divisible By 5
1019.Next Greater Node In Linked List
1019.Next Greater Node In Linked List
1020.Number of Enclaves
1020.Number of Enclaves
1021.Remove Outermost Parentheses
1021.Remove Outermost Parentheses
1022.Sum of Root To Leaf Binary Numbers
1022.Sum of Root To Leaf Binary Numbers
1023.Camelcase Matching
1023.Camelcase Matching
1024.Video Stitching
1024.Video Stitching
1025.Divisor Game
1025.Divisor Game
1026.Maximum Difference Between Node and Ancestor
1026.Maximum Difference Between Node and Ancestor
1027.Longest Arithmetic Subsequence
1027.Longest Arithmetic Subsequence
1028.Recover a Tree From Preorder Traversal
1028.Recover a Tree From Preorder Traversal
1029.Two City Scheduling
1029.Two City Scheduling
1030.Matrix Cells in Distance Order
1030.Matrix Cells in Distance Order
1031.Maximum Sum of Two Non-Overlapping Subarrays
1031.Maximum Sum of Two Non-Overlapping Subarrays
1032.Stream of Characters
1032.Stream of Characters
1033.Moving Stones Until Consecutive
1033.Moving Stones Until Consecutive
1034.Coloring A Border
1034.Coloring A Border
1035.Uncrossed Lines
1035.Uncrossed Lines
1036.Escape a Large Maze
1036.Escape a Large Maze
1037.Valid Boomerang
1037.Valid Boomerang
1038.Binary Search Tree to Greater Sum Tree
1038.Binary Search Tree to Greater Sum Tree
1039.Minimum Score Triangulation of Polygon
1039.Minimum Score Triangulation of Polygon
1040.Moving Stones Until Consecutive II
1040.Moving Stones Until Consecutive II
1041.Robot Bounded In Circle
1041.Robot Bounded In Circle
1042.Flower Planting With No Adjacent
1042.Flower Planting With No Adjacent
1043.Partition Array for Maximum Sum
1043.Partition Array for Maximum Sum
1044.Longest Duplicate Substring
1044.Longest Duplicate Substring
1045.Customers Who Bought All Products
1045.Customers Who Bought All Products
1046.Last Stone Weight
1046.Last Stone Weight
1047.Remove All Adjacent Duplicates In String
1047.Remove All Adjacent Duplicates In String
1048.Longest String Chain
1048.Longest String Chain
1049.Last Stone Weight II
1049.Last Stone Weight II
1050.Actors and Directors Who Cooperated At Least Three Times
1050.Actors and Directors Who Cooperated At Least Three Times
1051.Height Checker
1051.Height Checker
1052.Grumpy Bookstore Owner
1052.Grumpy Bookstore Owner
1053.Previous Permutation With One Swap
1053.Previous Permutation With One Swap
1054.Distant Barcodes
1054.Distant Barcodes
1055.Shortest Way to Form String
1055.Shortest Way to Form String
1056.Confusing Number
1056.Confusing Number
1057.Campus Bikes
1057.Campus Bikes
1058.Minimize Rounding Error to Meet Target
1058.Minimize Rounding Error to Meet Target
1059.All Paths from Source Lead to Destination
1059.All Paths from Source Lead to Destination
1060.Missing Element in Sorted Array
1060.Missing Element in Sorted Array
1061.Lexicographically Smallest Equivalent String
1061.Lexicographically Smallest Equivalent String
1062.Longest Repeating Substring
1062.Longest Repeating Substring
1063.Number of Valid Subarrays
1063.Number of Valid Subarrays
1064.Fixed Point
1064.Fixed Point
1065.Index Pairs of a String
1065.Index Pairs of a String
1066.Campus Bikes II
1066.Campus Bikes II
1067.Digit Count in Range
1067.Digit Count in Range
1068.Product Sales Analysis I
1068.Product Sales Analysis I
1069.Product Sales Analysis II
1069.Product Sales Analysis II
1070.Product Sales Analysis III
1070.Product Sales Analysis III
1071.Greatest Common Divisor of Strings
1071.Greatest Common Divisor of Strings
1072.Flip Columns For Maximum Number of Equal Rows
1072.Flip Columns For Maximum Number of Equal Rows
1073.Adding Two Negabinary Numbers
1073.Adding Two Negabinary Numbers
1074.Number of Submatrices That Sum to Target
1074.Number of Submatrices That Sum to Target
1075.Project Employees I
1075.Project Employees I
1076.Project Employees II
1076.Project Employees II
1077.Project Employees III
1077.Project Employees III
1078.Occurrences After Bigram
1078.Occurrences After Bigram
1079.Letter Tile Possibilities
1079.Letter Tile Possibilities
1080.Insufficient Nodes in Root to Leaf Paths
1080.Insufficient Nodes in Root to Leaf Paths
1081.Smallest Subsequence of Distinct Characters
1081.Smallest Subsequence of Distinct Characters
1082.Sales Analysis I
1082.Sales Analysis I
1083.Sales Analysis II
1083.Sales Analysis II
1084.Sales Analysis III
1084.Sales Analysis III
1085.Sum of Digits in the Minimum Number
1085.Sum of Digits in the Minimum Number
1086.High Five
1086.High Five
1087.Brace Expansion
1087.Brace Expansion
1088.Confusing Number II
1088.Confusing Number II
1089.Duplicate Zeros
1089.Duplicate Zeros
1090.Largest Values From Labels
1090.Largest Values From Labels
1091.Shortest Path in Binary Matrix
1091.Shortest Path in Binary Matrix
1092.Shortest Common Supersequence
1092.Shortest Common Supersequence
1093.Statistics from a Large Sample
1093.Statistics from a Large Sample
1094.Car Pooling
1094.Car Pooling
1095.Find in Mountain Array
1095.Find in Mountain Array
1096.Brace Expansion II
1096.Brace Expansion II
1097.Game Play Analysis V
1097.Game Play Analysis V
1098.Unpopular Books
1098.Unpopular Books
1099.Two Sum Less Than K
1099.Two Sum Less Than K
View all files
You can’t perform that action at this time.