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 }}
prernagupta2625
/
Coding-Problems
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
698 Commits
698 Commits
0 - 1 Knapsack Problem - GFG
0 - 1 Knapsack Problem - GFG
Add 1 to a number represented as linked list - GFG
Add 1 to a number represented as linked list - GFG
Aggressive Cows - GFG
Aggressive Cows - GFG
Alternate positive and negative numbers - GFG
Alternate positive and negative numbers - GFG
Anagram - GFG
Anagram - GFG
Ancestors in Binary Tree - GFG
Ancestors in Binary Tree - GFG
Arranging the array - GFG
Arranging the array - GFG
Array Subset of another array - GFG
Array Subset of another array - GFG
Array to BST - GFG
Array to BST - GFG
Assign Cookies - GFG
Assign Cookies - GFG
Asteroid Collision - GFG
Asteroid Collision - GFG
Binary Heap Operations - GFG
Binary Heap Operations - GFG
Binary Search - GFG
Binary Search - GFG
Binary Tree to BST - GFG
Binary Tree to BST - GFG
Binary subarray with sum - GFG
Binary subarray with sum - GFG
Bipartite Graph - GFG
Bipartite Graph - GFG
Boolean Matrix - GFG
Boolean Matrix - GFG
Bottom View of Binary Tree - GFG
Bottom View of Binary Tree - GFG
Boundary Traversal of binary tree - GFG
Boundary Traversal of binary tree - GFG
Boundary traversal of matrix - GFG
Boundary traversal of matrix - GFG
Candy - GFG
Candy - GFG
Capacity To Ship Packages Within D Days - GFG
Capacity To Ship Packages Within D Days - GFG
Ceil in BST - GFG
Ceil in BST - GFG
Check If Circular Linked List - GFG
Check If Circular Linked List - GFG
Check for BST - GFG
Check for BST - GFG
Check for Balanced Tree - GFG
Check for Balanced Tree - GFG
Check if Tree is Isomorphic - GFG
Check if Tree is Isomorphic - GFG
Check if array is sorted - GFG
Check if array is sorted - GFG
Check if strings are rotations of each other or not - GFG
Check if strings are rotations of each other or not - GFG
Check if there exists a subsequence with sum K - GFG
Check if there exists a subsequence with sum K - GFG
Check whether K-th bit is set or not - GFG
Check whether K-th bit is set or not - GFG
Children Sum Parent - GFG
Children Sum Parent - GFG
Circular tour - GFG
Circular tour - GFG
Coin Change - GFG
Coin Change - GFG
Column name from a given column number - GFG
Column name from a given column number - GFG
Combination Sum II - GFG
Combination Sum II - GFG
Combination Sum III - GFG
Combination Sum III - GFG
Connect Nodes at Same Level - GFG
Connect Nodes at Same Level - GFG
Construct BST from Postorder - GFG
Construct BST from Postorder - GFG
Construct Tree from Inorder & Preorder - GFG
Construct Tree from Inorder & Preorder - GFG
Convert Min Heap to Max Heap - GFG
Convert Min Heap to Max Heap - GFG
Convert array into Zig-Zag fashion - GFG
Convert array into Zig-Zag fashion - GFG
Copy Set Bits in Range - GFG
Copy Set Bits in Range - GFG
Count Leaves in Binary Tree - GFG
Count Leaves in Binary Tree - GFG
Count Non-Leaf Nodes in Tree - GFG
Count Non-Leaf Nodes in Tree - GFG
Count Pairs whose sum is equal to X - GFG
Count Pairs whose sum is equal to X - GFG
Count nodes of linked list - GFG
Count nodes of linked list - GFG
Count number of hops - GFG
Count number of hops - GFG
Count numbers containing 4 - GFG
Count numbers containing 4 - GFG
Count pairs with given sum - GFG
Count pairs with given sum - GFG
Cyclically rotate an array by one - GFG
Cyclically rotate an array by one - GFG
DFS of Graph - GFG
DFS of Graph - GFG
Decimal Equivalent of Binary Linked List - GFG
Decimal Equivalent of Binary Linked List - GFG
Delete Alternate Nodes - GFG
Delete Alternate Nodes - GFG
Delete Middle of Linked List - GFG
Delete Middle of Linked List - GFG
Delete N nodes after M nodes of a linked list - GFG
Delete N nodes after M nodes of a linked list - GFG
Delete a Node in Single Linked List - GFG
Delete a Node in Single Linked List - GFG
Delete middle element of a stack - GFG
Delete middle element of a stack - GFG
Delete node in Doubly Linked List - GFG
Delete node in Doubly Linked List - GFG
Delete without head pointer - GFG
Delete without head pointer - GFG
Detect Loop in linked list - GFG
Detect Loop in linked list - GFG
Detect cycle in an undirected graph - GFG
Detect cycle in an undirected graph - GFG
Determine if Two Trees are Identical - GFG
Determine if Two Trees are Identical - GFG
Diameter of a Binary Tree - GFG
Diameter of a Binary Tree - GFG
Edit Distance - GFG
Edit Distance - GFG
Equilibrium Point - GFG
Equilibrium Point - GFG
Equivalent Sub-Arrays - GFG
Equivalent Sub-Arrays - GFG
Expression Tree - GFG
Expression Tree - GFG
Fact Digit Sum - GFG
Fact Digit Sum - GFG
Fibonacci Series up to Nth term - GFG
Fibonacci Series up to Nth term - GFG
Find Common Nodes in two BSTs - GFG
Find Common Nodes in two BSTs - GFG
Find Nth root of M - GFG
Find Nth root of M - GFG
Find a pair with given target in BST - GFG
Find a pair with given target in BST - GFG
Find all pairs with a given sum - GFG
Find all pairs with a given sum - GFG
Find duplicates in an array - GFG
Find duplicates in an array - GFG
Find first set bit - GFG
Find first set bit - GFG
Find length of Loop - GFG
Find length of Loop - GFG
Find median in a stream - GFG
Find median in a stream - GFG
Find n/
k th node in Linked list - GFG
Find n/
k th node in Linked list - GFG
Find the Node with maximum GCD of the siblings of a Binary Tree - GFG
Find the Node with maximum GCD of the siblings of a Binary Tree - GFG
Find the Sum of Last N nodes of the Linked List - GFG
Find the Sum of Last N nodes of the Linked List - GFG
Find the element that appears once - GFG
Find the element that appears once - GFG
Find the element that appears once in sorted array - GFG
Find the element that appears once in sorted array - GFG
Find the number of islands - GFG
Find the number of islands - GFG
Finding Position - GFG
Finding Position - GFG
Finding middle element in a linked list - GFG
Finding middle element in a linked list - GFG
Flatten binary tree to linked list - GFG
Flatten binary tree to linked list - GFG
Flood fill Algorithm - GFG
Flood fill Algorithm - GFG
Floor in BST - GFG
Floor in BST - GFG
Floor in a Sorted Array - GFG
Floor in a Sorted Array - GFG
Form a palindrome - GFG
Form a palindrome - GFG
Fruit Into Baskets - GFG
Fruit Into Baskets - GFG
Geek's Training - GFG
Geek's Training - GFG
Generate Parentheses - GFG
Generate Parentheses - GFG
Generate all binary strings - GFG
Generate all binary strings - GFG
Grid Path 2 - GFG
Grid Path 2 - GFG
Height of Binary Tree - GFG
Height of Binary Tree - GFG
Help a Thief!!! - GFG
Help a Thief!!! - GFG
Identical Linked Lists - GFG
Identical Linked Lists - GFG
Implement Atoi - GFG
Implement Atoi - GFG
View all files
About
No description, website, or topics provided.
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.