Skip to content

Adi-070/Leetcode-GFG_solutions

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1,195 Commits
0055-jump-game
0055-jump-game
 
 
0056-merge-intervals
0056-merge-intervals
 
 
0135-candy
0135-candy
 
 
0215-kth-largest-element-in-an-array
0215-kth-largest-element-in-an-array
 
 
0238-product-of-array-except-self
0238-product-of-array-except-self
 
 
0303-range-sum-query-immutable
0303-range-sum-query-immutable
 
 
0347-top-k-frequent-elements
0347-top-k-frequent-elements
 
 
0435-non-overlapping-intervals
0435-non-overlapping-intervals
 
 
0455-assign-cookies
0455-assign-cookies
 
 
0724-find-pivot-index
0724-find-pivot-index
 
 
1603-running-sum-of-1d-array
1603-running-sum-of-1d-array
 
 
2714-left-and-right-sum-differences
2714-left-and-right-sum-differences
 
 
Add two numbers represented by linked lists - GFG
Add two numbers represented by linked lists - GFG
 
 
Anagram - GFG
Anagram - GFG
 
 
Arranging the array - GFG
Arranging the array - GFG
 
 
Array Operations - GFG
Array Operations - GFG
 
 
Array Subset of another array - GFG
Array Subset of another array - GFG
 
 
Array to BST - GFG
Array to BST - GFG
 
 
BFS of graph - GFG
BFS of graph - GFG
 
 
Binary Tree to BST - GFG
Binary Tree to BST - GFG
 
 
Binary Tree to DLL - GFG
Binary Tree to DLL - GFG
 
 
Bipartite Graph - GFG
Bipartite Graph - 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
 
 
Check for BST - GFG
Check for BST - GFG
 
 
Check if Linked List is Palindrome - GFG
Check if Linked List is Palindrome - 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 subtree - GFG
Check if subtree - GFG
 
 
Check if two Nodes are Cousins - GFG
Check if two Nodes are Cousins - GFG
 
 
Check if two arrays are equal or not - GFG
Check if two arrays are equal or not - GFG
 
 
Check if two strings are k-anagrams or not - GFG
Check if two strings are k-anagrams or not - GFG
 
 
Check perfect square - GFG
Check perfect square - GFG
 
 
Children Sum Parent - GFG
Children Sum Parent - GFG
 
 
Clone Graph - GFG
Clone Graph - GFG
 
 
Clone a linked list with next and random pointer - GFG
Clone a linked list with next and random pointer - GFG
 
 
Common elements - GFG
Common elements - GFG
 
 
Complete Binary Tree - GFG
Complete Binary Tree - GFG
 
 
Count Leaves in Binary Tree - GFG
Count Leaves in Binary Tree - GFG
 
 
Count Primes In Range - GFG
Count Primes In Range - GFG
 
 
Count nodes of linked list - GFG
Count nodes of linked list - GFG
 
 
Count pairs with given sum - GFG
Count pairs with given sum - GFG
 
 
Count zeros in a sorted matrix - GFG
Count zeros in a sorted matrix - GFG
 
 
Counting elements in two arrays - GFG
Counting elements in two arrays - GFG
 
 
Course Schedule - GFG
Course Schedule - GFG
 
 
DFS of Graph - GFG
DFS of Graph - 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 a node from BST - GFG
Delete a node from BST - GFG
 
 
Delete middle element of a stack - GFG
Delete middle element of a stack - 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 a directed graph - GFG
Detect cycle in a directed graph - 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
 
 
Difficulty: Medium
Difficulty: Medium
 
 
Distribute candies in a binary tree - GFG
Distribute candies in a binary tree - GFG
 
 
Does array represent Heap - GFG
Does array represent Heap - GFG
 
 
Equilibrium Point - GFG
Equilibrium Point - GFG
 
 
Equilibrium index of an array - GFG
Equilibrium index of an array - GFG
 
 
Eventual Safe States - GFG
Eventual Safe States - GFG
 
 
Find All Four Sum Numbers - GFG
Find All Four Sum Numbers - GFG
 
 
Find Common Nodes in two BSTs - GFG
Find Common Nodes in two BSTs - GFG
 
 
Find Missing And Repeating - GFG
Find Missing And Repeating - GFG
 
 
Find Pair Given Difference - GFG
Find Pair Given Difference - GFG
 
 
Find Transition Point - GFG
Find Transition Point - 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 minimum and maximum element in an array - GFG
Find minimum and maximum element in an array - GFG
 
 
Find missing in second array - GFG
Find missing in second array - GFG
 
 
Find number of closed islands - GFG
Find number of closed islands - GFG
 
 
Find the closest pair from two arrays - GFG
Find the closest pair from two arrays - 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 first node of loop in linked list - GFG
Find the first node of loop in linked list - GFG
 
 
Find whether path exist - GFG
Find whether path exist - GFG
 
 
Finding middle element in a linked list - GFG
Finding middle element in a linked list - GFG
 
 
First Repeating Element - GFG
First Repeating Element - GFG
 
 
First negative integer in every window of size k - GFG
First negative integer in every window of size k - GFG
 
 
Fixing Two nodes of a BST - GFG
Fixing Two nodes of a BST - GFG
 
 
Fixing Two swapped nodes of a BST - GFG
Fixing Two swapped nodes of a BST - GFG
 
 
Flatten binary tree to linked list - GFG
Flatten binary tree to linked list - GFG
 
 
Flood fill Algorithm - GFG
Flood fill Algorithm - GFG
 
 
Get min at pop - GFG
Get min at pop - 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
 
 
Height of Heap - GFG
Height of Heap - GFG
 
 
Implement two stacks in an array - GFG
Implement two stacks in an array - GFG
 
 
Implementing Dijkstra Algorithm - GFG
Implementing Dijkstra Algorithm - GFG
 
 
Incomplete Array - GFG
Incomplete Array - GFG
 
 
Index Of an Extra Element - GFG
Index Of an Extra Element - GFG
 
 
Inorder Traversal (Iterative) - GFG
Inorder Traversal (Iterative) - GFG
 
 
Inorder Traversal - GFG
Inorder Traversal - GFG
 
 
Insertion Sort - GFG
Insertion Sort - GFG
 
 
Intersection Point in Y Shaped Linked Lists - GFG
Intersection Point in Y Shaped Linked Lists - GFG
 
 
Intersection of two arrays - GFG
Intersection of two arrays - GFG
 
 
Is Binary Tree Heap - GFG
Is Binary Tree Heap - GFG
 
 

Repository files navigation

Collection of LeetCode solutions

LeetCode Topics

Array
0055-jump-game
0056-merge-intervals
0135-candy
0215-kth-largest-element-in-an-array
0238-product-of-array-except-self
0303-range-sum-query-immutable
0347-top-k-frequent-elements
0435-non-overlapping-intervals
0455-assign-cookies
0724-find-pivot-index
1603-running-sum-of-1d-array
2714-left-and-right-sum-differences

Two Pointers
0455-assign-cookies

Greedy
0055-jump-game
0135-candy
0435-non-overlapping-intervals
0455-assign-cookies

Sorting
0056-merge-intervals
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
0435-non-overlapping-intervals
0455-assign-cookies

Dynamic Programming
0055-jump-game
0435-non-overlapping-intervals

Prefix Sum
0238-product-of-array-except-self
0303-range-sum-query-immutable
0724-find-pivot-index
1603-running-sum-of-1d-array
2714-left-and-right-sum-differences

Design
0303-range-sum-query-immutable

Divide and Conquer
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements

Heap (Priority Queue)
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements

Quickselect
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements

Hash Table
0347-top-k-frequent-elements

Bucket Sort
0347-top-k-frequent-elements

Counting
0347-top-k-frequent-elements

About

Collection of LeetCode/GFG solutions

Topics

java algorithms data-structures leetcode-solutions gfg-solutions

Resources

Readme
Activity

Stars

2 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages