Skip to content
BranchesTags

Latest commit

 

History

346 Commits

Folders and files

NameName
Last commit message
Last commit date
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
 
 
Add two numbers represented by linked lists - GFG
Add two numbers represented by linked lists - GFG
 
 
Aggressive Cows - GFG
Aggressive Cows - GFG
 
 
Allocate minimum number of pages - GFG
Allocate minimum number of pages - GFG
 
 
Alternate positive and negative numbers - GFG
Alternate positive and negative numbers - GFG
 
 
Anagram - GFG
Anagram - GFG
 
 
Asteroid Collision - GFG
Asteroid Collision - GFG
 
 
BST to max heap - GFG
BST to max heap - 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
 
 
Bubble Sort - GFG
Bubble Sort - GFG
 
 
Burning Tree - GFG
Burning Tree - GFG
 
 
Ceil in BST - GFG
Ceil in BST - GFG
 
 
Check If Circular Linked List - GFG
Check If Circular Linked List - GFG
 
 
Check if Linked List is Palindrome - GFG
Check if Linked List is Palindrome - 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
 
 
Children Sum Parent - GFG
Children Sum Parent - GFG
 
 
Circular tour - GFG
Circular tour - GFG
 
 
Clone a linked list with next and random pointer - GFG
Clone a linked list with next and random pointer - GFG
 
 
Combination Sum - GFG
Combination Sum - GFG
 
 
Combination Sum II - GFG
Combination Sum II - GFG
 
 
Combination Sum III - GFG
Combination Sum III - GFG
 
 
Count Inversions - GFG
Count Inversions - GFG
 
 
Count Reverse Pairs - GFG
Count Reverse Pairs - GFG
 
 
Count Substrings - GFG
Count Substrings - GFG
 
 
Count nodes of linked list - GFG
Count nodes of linked list - GFG
 
 
Delete Middle of Linked List - GFG
Delete Middle of Linked List - GFG
 
 
Delete a Node in Single Linked List - GFG
Delete a Node in Single Linked List - GFG
 
 
Delete all occurrences of a given key in a doubly linked list - GFG
Delete all occurrences of a given key in a doubly linked list - GFG
 
 
Delete node in Doubly Linked List - GFG
Delete node in Doubly Linked List - GFG
 
 
Detect Loop in linked list - GFG
Detect Loop in linked list - GFG
 
 
Does array represent Heap - GFG
Does array represent Heap - GFG
 
 
Doubly linked list Insertion at given position - GFG
Doubly linked list Insertion at given position - GFG
 
 
Factorial - GFG
Factorial - GFG
 
 
Find All Four Sum Numbers - GFG
Find All Four Sum Numbers - GFG
 
 
Find Missing And Repeating - GFG
Find Missing And Repeating - GFG
 
 
Find all pairs with a given sum - GFG
Find all pairs with a given sum - GFG
 
 
Find length of Loop - GFG
Find length of Loop - GFG
 
 
Find pairs with given sum in doubly linked list - GFG
Find pairs with given sum in doubly linked list - GFG
 
 
Find the Highest number - GFG
Find the Highest number - 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
 
 
Finding middle element in a linked list - GFG
Finding middle element in a linked list - GFG
 
 
First negative integer in every window of size k - GFG
First negative integer in every window of size k - GFG
 
 
First non-repeating character in a stream - GFG
First non-repeating character in a stream - GFG
 
 
Flattening a Linked List - GFG
Flattening a Linked List - GFG
 
 
Floor in BST - GFG
Floor in BST - GFG
 
 
Get minimum element from stack - GFG
Get minimum element from stack - GFG
 
 
Given a linked list of 0s, 1s and 2s, sort it. - GFG
Given a linked list of 0s, 1s and 2s, sort it. - GFG
 
 
Height of Binary Tree - GFG
Height of Binary Tree - GFG
 
 
Immediate Smaller Element - GFG
Immediate Smaller Element - GFG
 
 
Implement Atoi - GFG
Implement Atoi - GFG
 
 
Implement Queue using Linked List - GFG
Implement Queue using Linked List - GFG
 
 
Implement Queue using array - GFG
Implement Queue using array - GFG
 
 
Implement stack using array - GFG
Implement stack using array - GFG
 
 
Implement two stacks in an array - GFG
Implement two stacks in an array - GFG
 
 
Insertion Sort - GFG
Insertion Sort - GFG
 
 
Interleave the First Half of the Queue with Second Half - GFG
Interleave the First Half of the Queue with Second Half - GFG
 
 
Intersection of Two Linked Lists - GFG
Intersection of Two Linked Lists - GFG
 
 
Intersection of two arrays - GFG
Intersection of two arrays - GFG
 
 
Isomorphic Strings - GFG
Isomorphic Strings - GFG
 
 
Kadane's Algorithm - GFG
Kadane's Algorithm - GFG
 
 
Koko Eating Bananas - GFG
Koko Eating Bananas - GFG
 
 
Largest BST - GFG
Largest BST - GFG
 
 
Largest subarray with 0 sum - GFG
Largest subarray with 0 sum - GFG
 
 
Leaders in an array - GFG
Leaders in an array - GFG
 
 
Left most and right most index - GFG
Left most and right most index - GFG
 
 
Linked List Insertion - GFG
Linked List Insertion - GFG
 
 
Longest Common Prefix in an Array - GFG
Longest Common Prefix in an Array - GFG
 
 
Longest Sub-Array with Sum K - GFG
Longest Sub-Array with Sum K - GFG
 
 
Longest consecutive subsequence - GFG
Longest consecutive subsequence - GFG
 
 
Majority Element - GFG
Majority Element - GFG
 
 
Max Sum Subarray of size K - GFG
Max Sum Subarray of size K - GFG
 
 
Maximum Occuring Character - GFG
Maximum Occuring Character - GFG
 
 
Maximum Product Subarray - GFG
Maximum Product Subarray - GFG
 
 
Maximum Rectangular Area in a Histogram - GFG
Maximum Rectangular Area in a Histogram - GFG
 
 
Maximum Sub Array - GFG
Maximum Sub Array - GFG
 
 
Maximum of all subarrays of size k - GFG
Maximum of all subarrays of size k - GFG
 
 
Merge Sort - GFG
Merge Sort - GFG
 
 
Merge Sort for Linked List - GFG
Merge Sort for Linked List - GFG
 
 
Merge Without Extra Space - GFG
Merge Without Extra Space - GFG
 
 
Merge two BST 's - GFG
Merge two BST 's - GFG
 
 
Minimum Number in a sorted rotated array - GFG
Minimum Number in a sorted rotated array - GFG
 
 
Minimum days to make M bouquets - GFG
Minimum days to make M bouquets - GFG
 
 
Minimum element in a sorted and rotated array - GFG
Minimum element in a sorted and rotated array - GFG
 
 
Missing number - GFG
Missing number - GFG
 
 
Missing number in array - GFG
Missing number in array - GFG
 
 
Move all zeroes to end of array - GFG
Move all zeroes to end of array - GFG
 
 
Next Greater Element - GFG
Next Greater Element - GFG
 
 
Next Greater Element 2 - GFG
Next Greater Element 2 - GFG
 
 
Next Permutation - GFG
Next Permutation - GFG
 
 
Non Repeating Character - GFG
Non Repeating Character - GFG
 
 
Nth Fibonacci Number - GFG
Nth Fibonacci Number - GFG
 
 
Nth node from end of linked list - GFG
Nth node from end of linked list - GFG
 
 
Number of NGEs to the right - GFG
Number of NGEs to the right - GFG
 
 
Overlapping Intervals - GFG
Overlapping Intervals - GFG
 
 
Parenthesis Checker - GFG
Parenthesis Checker - GFG
 
 
Possible Words From Phone Digits - GFG
Possible Words From Phone Digits - GFG
 
 

Repository files navigation

GFG

In this repo I'm compiling all of the questions that I will be solving on the GFG platform in my DSA preparation journey.

About

In this repo I'm compiling all of the questions that I will be solving on the GFG platform in my DSA preparation journey.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

1 fork
Report repository

Releases

Packages

Contributors

Languages