GitHub - amritmaurya1504/LeetCode_GFG: LeetCode & GeeksForGeeks Solved Problems

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 521 Commits
0001-two-sum		0001-two-sum
0012-integer-to-roman		0012-integer-to-roman
0013-roman-to-integer		0013-roman-to-integer
0031-next-permutation		0031-next-permutation
0038-count-and-say		0038-count-and-say
0044-wildcard-matching		0044-wildcard-matching
0049-group-anagrams		0049-group-anagrams
0072-edit-distance		0072-edit-distance
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0075-sort-colors		0075-sort-colors
0115-distinct-subsequences		0115-distinct-subsequences
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0136-single-number		0136-single-number
0217-contains-duplicate		0217-contains-duplicate
0219-contains-duplicate-ii		0219-contains-duplicate-ii
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0242-valid-anagram		0242-valid-anagram
0268-missing-number		0268-missing-number
0322-coin-change		0322-coin-change
0347-top-k-frequent-elements		0347-top-k-frequent-elements
0392-is-subsequence		0392-is-subsequence
0485-max-consecutive-ones		0485-max-consecutive-ones
0494-target-sum		0494-target-sum
0516-longest-palindromic-subsequence		0516-longest-palindromic-subsequence
0518-coin-change-ii		0518-coin-change-ii
0523-continuous-subarray-sum		0523-continuous-subarray-sum
0540-single-element-in-a-sorted-array		0540-single-element-in-a-sorted-array
0583-delete-operation-for-two-strings		0583-delete-operation-for-two-strings
0645-set-mismatch		0645-set-mismatch
0692-top-k-frequent-words		0692-top-k-frequent-words
0718-maximum-length-of-repeated-subarray		0718-maximum-length-of-repeated-subarray
0766-toeplitz-matrix		0766-toeplitz-matrix
0859-buddy-strings		0859-buddy-strings
0976-largest-perimeter-triangle		0976-largest-perimeter-triangle
1004-max-consecutive-ones-iii		1004-max-consecutive-ones-iii
1092-shortest-common-supersequence		1092-shortest-common-supersequence
1143-longest-common-subsequence		1143-longest-common-subsequence
1312-minimum-insertion-steps-to-make-a-string-palindrome		1312-minimum-insertion-steps-to-make-a-string-palindrome
1662-check-if-two-string-arrays-are-equivalent		1662-check-if-two-string-arrays-are-equivalent
1832-check-if-the-sentence-is-pangram		1832-check-if-the-sentence-is-pangram
2095-delete-the-middle-node-of-a-linked-list		2095-delete-the-middle-node-of-a-linked-list
2451-odd-string-difference		2451-odd-string-difference
Alien Dictionary - GFG		Alien Dictionary - GFG
Anagram - GFG		Anagram - GFG
BFS of graph - GFG		BFS of graph - GFG
Binary Search - GFG		Binary Search - 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
Bubble Sort - GFG		Bubble Sort - GFG
Burning Tree - GFG		Burning Tree - 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
Cheapest Flights Within K Stops - GFG		Cheapest Flights Within K Stops - 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 two arrays are equal or not - GFG		Check if two arrays are equal or not - GFG
Chocolate Distribution Problem - GFG		Chocolate Distribution Problem - GFG
Coin Change - GFG		Coin Change - GFG
Common Subsequence - GFG		Common Subsequence - GFG
Construct Tree from Inorder & Preorder - GFG		Construct Tree from Inorder & Preorder - GFG
Container With Most Water - GFG		Container With Most Water - GFG
Count Occurences of Anagrams - GFG		Count Occurences of Anagrams - GFG
Count Reverse Pairs - GFG		Count Reverse Pairs - GFG
Count Substring - GFG		Count Substring - GFG
Count nodes of linked list - GFG		Count nodes of linked list - GFG
Count number of substrings - GFG		Count number of substrings - GFG
Count pairs with given sum - GFG		Count pairs with given sum - GFG
Course Schedule - GFG		Course Schedule - GFG
DFS of Graph - GFG		DFS of Graph - GFG
Delete a node from BST - GFG		Delete a node from BST - 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
Delete nodes having greater value on right - GFG		Delete nodes having greater value on right - 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
Distance from the Source (Bellman-Ford Algorithm) - GFG		Distance from the Source (Bellman-Ford Algorithm) - GFG
Distinct Difference - GFG		Distinct Difference - GFG
Doubly linked list Insertion at given position - GFG		Doubly linked list Insertion at given position - GFG
Edit Distance - GFG		Edit Distance - GFG
Eventual Safe States - GFG		Eventual Safe States - GFG
Find a pair with given target in BST - GFG		Find a pair with given target in BST - 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 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
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
Flattening a Linked List - GFG		Flattening a Linked List - GFG
Flood fill Algorithm - GFG		Flood fill Algorithm - GFG
Floor in a Sorted Array - GFG		Floor in a Sorted Array - GFG
Floyd Warshall - GFG		Floyd Warshall - GFG
Fraction pairs with sum 1 - GFG		Fraction pairs with sum 1 - GFG
Fruit Into Baskets - GFG		Fruit Into Baskets - 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
Implementing Dijkstra Algorithm - GFG		Implementing Dijkstra Algorithm - GFG
Inorder Successor in BST - GFG		Inorder Successor in BST - GFG
Inorder Traversal (Iterative) - GFG		Inorder Traversal (Iterative) - GFG

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

About

Releases

Packages

Languages

amritmaurya1504/LeetCode_GFG

Folders and files

Latest commit

History

About

Topics

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages