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
Accelerator
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 }}
abneka
/
Competitive-Programming
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
main
Branches
Tags
Go to file
Code
Open more actions menu
Folders and files
Name
Name
Last commit message
Last commit date
Latest commit
History
2,022 Commits
2,022 Commits
0002-add-two-numbers
0002-add-two-numbers
0003-longest-substring-without-repeating-characters
0003-longest-substring-without-repeating-characters
0009-palindrome-number
0009-palindrome-number
0011-container-with-most-water
0011-container-with-most-water
0014-longest-common-prefix
0014-longest-common-prefix
0015-3sum
0015-3sum
0019-remove-nth-node-from-end-of-list
0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0021-merge-two-sorted-lists
0023-merge-k-sorted-lists
0023-merge-k-sorted-lists
0025-reverse-nodes-in-k-group
0025-reverse-nodes-in-k-group
0026-remove-duplicates-from-sorted-array
0026-remove-duplicates-from-sorted-array
0027-remove-element
0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string
0028-find-the-index-of-the-first-occurrence-in-a-string
0034-find-first-and-last-position-of-element-in-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0035-search-insert-position
0036-valid-sudoku
0036-valid-sudoku
0043-multiply-strings
0043-multiply-strings
0046-permutations
0046-permutations
0048-rotate-image
0048-rotate-image
0050-powx-n
0050-powx-n
0054-spiral-matrix
0054-spiral-matrix
0055-jump-game
0055-jump-game
0058-length-of-last-word
0058-length-of-last-word
0061-rotate-list
0061-rotate-list
0062-unique-paths
0062-unique-paths
0063-unique-paths-ii
0063-unique-paths-ii
0066-plus-one
0066-plus-one
0067-add-binary
0067-add-binary
0069-sqrtx
0069-sqrtx
0070-climbing-stairs
0070-climbing-stairs
0071-simplify-path
0071-simplify-path
0072-edit-distance
0072-edit-distance
0073-set-matrix-zeroes
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0074-search-a-2d-matrix
0075-sort-colors
0075-sort-colors
0076-minimum-window-substring
0076-minimum-window-substring
0077-combinations
0077-combinations
0078-subsets
0078-subsets
0082-remove-duplicates-from-sorted-list-ii
0082-remove-duplicates-from-sorted-list-ii
0083-remove-duplicates-from-sorted-list
0083-remove-duplicates-from-sorted-list
0086-partition-list
0086-partition-list
0088-merge-sorted-array
0088-merge-sorted-array
0092-reverse-linked-list-ii
0092-reverse-linked-list-ii
0093. Restore IP Addresses
0093. Restore IP Addresses
0094-binary-tree-inorder-traversal
0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0098-validate-binary-search-tree
0100-same-tree
0100-same-tree
0101-symmetric-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0104-maximum-depth-of-binary-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0112-path-sum
0113-path-sum-ii
0113-path-sum-ii
0118-pascals-triangle
0118-pascals-triangle
0119-pascals-triangle-ii
0119-pascals-triangle-ii
0124-binary-tree-maximum-path-sum
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0129-sum-root-to-leaf-numbers
0130-surrounded-regions
0130-surrounded-regions
0134-gas-station
0134-gas-station
0135-candy
0135-candy
0136-single-number
0136-single-number
0137-single-number-ii
0137-single-number-ii
0141-linked-list-cycle
0141-linked-list-cycle
0142-linked-list-cycle-ii
0142-linked-list-cycle-ii
0143-reorder-list
0143-reorder-list
0144-binary-tree-preorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0145-binary-tree-postorder-traversal
0146-lru-cache
0146-lru-cache
0147-insertion-sort-list
0147-insertion-sort-list
0148-sort-list
0148-sort-list
0150-evaluate-reverse-polish-notation
0150-evaluate-reverse-polish-notation
0155-min-stack
0155-min-stack
0160-intersection-of-two-linked-lists
0160-intersection-of-two-linked-lists
0167-two-sum-ii-input-array-is-sorted
0167-two-sum-ii-input-array-is-sorted
0175-combine-two-tables
0175-combine-two-tables
0179-largest-number
0179-largest-number
0180-consecutive-numbers
0180-consecutive-numbers
0181-employees-earning-more-than-their-managers
0181-employees-earning-more-than-their-managers
0182-duplicate-emails
0182-duplicate-emails
0183-customers-who-never-order
0183-customers-who-never-order
0184-department-highest-salary
0184-department-highest-salary
0189-rotate-array
0189-rotate-array
0191-number-of-1-bits
0191-number-of-1-bits
0198-house-robber
0198-house-robber
0199-binary-tree-right-side-view
0199-binary-tree-right-side-view
0203-remove-linked-list-elements
0203-remove-linked-list-elements
0204-count-primes
0204-count-primes
0206-reverse-linked-list
0206-reverse-linked-list
0207-course-schedule
0207-course-schedule
0209-minimum-size-subarray-sum
0209-minimum-size-subarray-sum
0210-course-schedule-ii
0210-course-schedule-ii
0211-design-add-and-search-words-data-structure
0211-design-add-and-search-words-data-structure
0213-house-robber-ii
0213-house-robber-ii
0215-kth-largest-element-in-an-array
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0217-contains-duplicate
0219-contains-duplicate-ii
0219-contains-duplicate-ii
View all files
Repository files navigation
README
More
items
"Competitive Programming"
About
No description, website, or topics provided.
Resources
Readme
Activity
Stars
1
star
Watchers
1
watching
Forks
0
forks
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.