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 }}
VivekDubey9
/
-Leetcode-practice
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
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
138 Commits
138 Commits
0101-symmetric-tree
0101-symmetric-tree
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0208-implement-trie-prefix-tree
0208-implement-trie-prefix-tree
0365-water-and-jug-problem
0365-water-and-jug-problem
0382-linked-list-random-node
0382-linked-list-random-node
0721-accounts-merge
0721-accounts-merge
0827-making-a-large-island
0827-making-a-large-island
0947-most-stones-removed-with-same-row-or-column
0947-most-stones-removed-with-same-row-or-column
0958-check-completeness-of-a-binary-tree
0958-check-completeness-of-a-binary-tree
1319-number-of-operations-to-make-network-connected
1319-number-of-operations-to-make-network-connected
Alex Travelling - GFG
Alex Travelling - GFG
BFS of graph - GFG
BFS of graph - GFG
Binary matrix having maximum number of 1s - GFG
Binary matrix having maximum number of 1s - GFG
Cheapest Flights Within K Stops - GFG
Cheapest Flights Within K Stops - GFG
Children Sum Parent - GFG
Children Sum Parent - GFG
Connect Nodes at Same Level - GFG
Connect Nodes at Same Level - GFG
Count Inversions - GFG
Count Inversions - GFG
Distance from the Source (Bellman-Ford Algorithm) - GFG
Distance from the Source (Bellman-Ford Algorithm) - GFG
Find kth element of spiral matrix - GFG
Find kth element of spiral matrix - GFG
Find the number of islands - GFG
Find the number of islands - GFG
Flattening a Linked List - GFG
Flattening a Linked List - GFG
Floyd Warshall - GFG
Floyd Warshall - GFG
Geek Jump - GFG
Geek Jump - GFG
Geek's Training - GFG
Geek's Training - GFG
K-th element of two sorted Arrays - GFG
K-th element of two sorted Arrays - GFG
Leaders in an array - GFG
Leaders in an array - GFG
Longest Bitonic subsequence - GFG
Longest Bitonic subsequence - GFG
Longest Increasing Subsequence - GFG
Longest Increasing Subsequence - GFG
M-Coloring Problem - GFG
M-Coloring Problem - GFG
Make Array Elements Equal - GFG
Make Array Elements Equal - GFG
Matrix Chain Multiplication - GFG
Matrix Chain Multiplication - GFG
Max Sum without Adjacents - GFG
Max Sum without Adjacents - GFG
Maximum Index - GFG
Maximum Index - GFG
Median in a row-wise sorted Matrix - GFG
Median in a row-wise sorted Matrix - GFG
Minimum Multiplications to reach End - GFG
Minimum Multiplications to reach End - GFG
Minimum Spanning Tree - GFG
Minimum Spanning Tree - GFG
Minimum sum partition - GFG
Minimum sum partition - GFG
Number Of Islands - GFG
Number Of Islands - GFG
Path With Minimum Effort - GFG
Path With Minimum Effort - GFG
Predecessor and Successor - GFG
Predecessor and Successor - GFG
Quick Sort - GFG
Quick Sort - GFG
Rat in a Maze Problem - I - GFG
Rat in a Maze Problem - I - GFG
Reverse both parts - GFG
Reverse both parts - GFG
Rod Cutting - GFG
Rod Cutting - GFG
Shortest Path Using Atmost One Curved Edge - GFG
Shortest Path Using Atmost One Curved Edge - GFG
Sort a stack - GFG
Sort a stack - GFG
Stickler Thief - GFG
Stickler Thief - GFG
Stock buy and sell II - GFG
Stock buy and sell II - GFG
Subset Sum Problem - GFG
Subset Sum Problem - GFG
Top View of Binary Tree - GFG
Top View of Binary Tree - GFG
Unique Binary Tree Requirements - GFG
Unique Binary Tree Requirements - GFG
Unique Paths in a Grid - GFG
Unique Paths in a Grid - GFG
Update Queries - GFG
Update Queries - GFG
Valid Compressed String - GFG
Valid Compressed String - GFG
Yet another query problem - GFG
Yet another query problem - GFG
README.md
README.md
View all files
Repository files navigation
README
More
items
-Leetcode-practice
About
No description, website, or topics provided.
Resources
Readme
Activity
Stars
0
stars
Watchers
1
watching
Forks
0
forks
Report repository
Releases
Packages
Contributors
Languages
You can’t perform that action at this time.