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
Type
/
to 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 }}
eyuuab
/
Competitive-programing
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
358 Commits
358 Commits
0104-maximum-depth-of-binary-tree
0104-maximum-depth-of-binary-tree
0917-reverse-only-letters
0917-reverse-only-letters
adfa
adfa
leetcode
leetcode
on boarding
on boarding
progress sheet
progress sheet
1004. Max Consecutive Ones III
1004. Max Consecutive Ones III
1019. Next Greater Node In Linked List
1019. Next Greater Node In Linked List
1031. Maximum Sum of Two Non-Overlapping Subarrays
1031. Maximum Sum of Two Non-Overlapping Subarrays
11. Container With Most Water
11. Container With Most Water
1190. Reverse Substrings Between Each Pair of Parentheses
1190. Reverse Substrings Between Each Pair of Parentheses
1248. Count Number of Nice Subarrays
1248. Count Number of Nice Subarrays
1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
1365. How Many Numbers Are Smaller Than the Current Number
1365. How Many Numbers Are Smaller Than the Current Number
1423. Maximum Points You Can Obtain from Cards
1423. Maximum Points You Can Obtain from Cards
1456. Maximum Number of Vowels in a Substring of Given Length
1456. Maximum Number of Vowels in a Substring of Given Length
150. Evaluate Reverse Polish Notation
150. Evaluate Reverse Polish Notation
1512. Number of Good Pairs
1512. Number of Good Pairs
155. Min Stack
155. Min Stack
179. Largest Number
179. Largest Number
1859. Sorting the Sentence
1859. Sorting the Sentence
189. Rotate Array
189. Rotate Array
1894. Find the Student that Will Replace the Chalk
1894. Find the Student that Will Replace the Chalk
19. Remove Nth Node From End of List
19. Remove Nth Node From End of List
2. Add Two Numbers
2. Add Two Numbers
20. Valid Parentheses
20. Valid Parentheses
206. Reverse Linked List
206. Reverse Linked List
2089. Find Target Indices After Sorting Array
2089. Find Target Indices After Sorting Array
21. Merge Two Sorted Lists
21. Merge Two Sorted Lists
232. Implement Queue using Stacks
232. Implement Queue using Stacks
234. Palindrome Linked List
234. Palindrome Linked List
237. Delete Node in a Linked List
237. Delete Node in a Linked List
238. Product of Array Except Self
238. Product of Array Except Self
283. Move Zeroes
283. Move Zeroes
326. Power of Three
326. Power of Three
342. Power of Four
342. Power of Four
412. Fizz Buzz
412. Fizz Buzz
438. Find All Anagrams in a String
438. Find All Anagrams in a String
496. Next Greater Element I
496. Next Greater Element I
50. Pow(x, n)
50. Pow(x, n)
509. Fibonacci Number
509. Fibonacci Number
560. Subarray Sum Equals K
560. Subarray Sum Equals K
724. Find Pivot Index
724. Find Pivot Index
75. Sort Colors
75. Sort Colors
83. Remove Duplicates from Sorted List
83. Remove Duplicates from Sorted List
876. Middle of the Linked List
876. Middle of the Linked List
881. Boats to Save People
881. Boats to Save People
923. 3Sum With Multiplicity
923. 3Sum With Multiplicity
946. Validate Stack Sequences
946. Validate Stack Sequences
948. Bag of Tokens
948. Bag of Tokens
973. K Closest Points to Origin
973. K Closest Points to Origin
Bubble Sort
Bubble Sort
C- Theatre Square
C- Theatre Square
Counting Sort 1
Counting Sort 1
Grading Students
Grading Students
Insertion Sort - Part 1
Insertion Sort - Part 1
README.md
README.md
Selection Sort
Selection Sort
Top K Frequent Elements
Top K Frequent Elements
code fore Domino Piling
code fore Domino Piling
View all files
Repository files navigation
README
More
items
A2SV
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.