Name	Name	Last commit message	Last commit date
Latest commit History 363 Commits
0 - 1 Knapsack Problem - GFG	0 - 1 Knapsack Problem - GFG
0001-two-sum	0001-two-sum
0021-merge-two-sorted-lists	0021-merge-two-sorted-lists
0075-sort-colors	0075-sort-colors
0083-remove-duplicates-from-sorted-list	0083-remove-duplicates-from-sorted-list
0141-linked-list-cycle	0141-linked-list-cycle
0203-remove-linked-list-elements	0203-remove-linked-list-elements
0206-reverse-linked-list	0206-reverse-linked-list
0215-kth-largest-element-in-an-array	0215-kth-largest-element-in-an-array
0217-contains-duplicate	0217-contains-duplicate
0234-palindrome-linked-list	0234-palindrome-linked-list
0237-delete-node-in-a-linked-list	0237-delete-node-in-a-linked-list
0328-odd-even-linked-list	0328-odd-even-linked-list
0344-reverse-string	0344-reverse-string
0374-guess-number-higher-or-lower	0374-guess-number-higher-or-lower
0802-find-eventual-safe-states	0802-find-eventual-safe-states
0817-linked-list-components	0817-linked-list-components
0852-peak-index-in-a-mountain-array	0852-peak-index-in-a-mountain-array
0876-middle-of-the-linked-list	0876-middle-of-the-linked-list
1019-next-greater-node-in-linked-list	1019-next-greater-node-in-linked-list
1313-decompress-run-length-encoded-list	1313-decompress-run-length-encoded-list
1389-create-target-array-in-the-given-order	1389-create-target-array-in-the-given-order
1551-minimum-operations-to-make-array-equal	1551-minimum-operations-to-make-array-equal
1662-check-if-two-string-arrays-are-equivalent	1662-check-if-two-string-arrays-are-equivalent
1669-merge-in-between-linked-lists	1669-merge-in-between-linked-lists
1721-swapping-nodes-in-a-linked-list	1721-swapping-nodes-in-a-linked-list
1877-minimize-maximum-pair-sum-in-array	1877-minimize-maximum-pair-sum-in-array
1920-build-array-from-permutation	1920-build-array-from-permutation
2091-removing-minimum-and-maximum-from-array	2091-removing-minimum-and-maximum-from-array
2095-delete-the-middle-node-of-a-linked-list	2095-delete-the-middle-node-of-a-linked-list
2130-maximum-twin-sum-of-a-linked-list	2130-maximum-twin-sum-of-a-linked-list
2149-rearrange-array-elements-by-sign	2149-rearrange-array-elements-by-sign
2161-partition-array-according-to-given-pivot	2161-partition-array-according-to-given-pivot
2221-find-triangular-sum-of-an-array	2221-find-triangular-sum-of-an-array
2294-partition-array-such-that-maximum-difference-is-k	2294-partition-array-such-that-maximum-difference-is-k
2413-smallest-even-multiple	2413-smallest-even-multiple
Alien Dictionary - GFG	Alien Dictionary - GFG
Alternate positive and negative numbers - GFG	Alternate positive and negative numbers - GFG
Armstrong Numbers - GFG	Armstrong Numbers - GFG
BFS of graph - GFG	BFS of graph - GFG
Binary Search Trees - GFG	Binary Search Trees - GFG
Bipartite Graph - GFG	Bipartite Graph - GFG
Bottom View of Binary Tree - GFG	Bottom View of Binary Tree - GFG
Bubble Sort - GFG	Bubble Sort - GFG
Buy Stock with Cooldown - GFG	Buy Stock with Cooldown - GFG
Ceil The Floor - GFG	Ceil The Floor - GFG
Check if array is sorted - GFG	Check if array is sorted - GFG
Chocolates Pickup - GFG	Chocolates Pickup - GFG
City With the Smallest Number of Neighbors at a Threshold Distance - GFG	City With the Smallest Number of Neighbors at a Threshold Distance - GFG
Connecting the graph - GFG	Connecting the graph - GFG
Copy Set Bits in Range - GFG	Copy Set Bits in Range - GFG
Count Digits - GFG	Count Digits - GFG
Count nodes of linked list - GFG	Count nodes of linked list - GFG
DFS of Graph - GFG	DFS of Graph - 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
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
Distance from the Source (Bellman-Ford Algorithm) - GFG	Distance from the Source (Bellman-Ford Algorithm) - GFG
Doubly linked list Insertion at given position - GFG	Doubly linked list Insertion at given position - GFG
Eventual Safe States - GFG	Eventual Safe States - 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 element that appears once in sorted array - GFG	Find the element that appears once in sorted array - GFG
First and last occurrences of x - GFG	First and last occurrences of x - GFG
Flattening a Linked List - GFG	Flattening a Linked List - GFG
Floor in BST - GFG	Floor in BST - GFG
Floor in a Sorted Array - GFG	Floor in a Sorted Array - GFG
Floyd Warshall - GFG	Floyd Warshall - GFG
Geek Jump - GFG	Geek Jump - GFG
Geek's Training - GFG	Geek's Training - 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
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
Implementing Dijkstra Algorithm - GFG	Implementing Dijkstra Algorithm - GFG
Infix to Postfix - GFG	Infix to Postfix - GFG
Insertion Sort - GFG	Insertion Sort - GFG
Introduction to Doubly Linked List - GFG	Introduction to Doubly Linked List - GFG
Introduction to Trees - GFG	Introduction to Trees - GFG
Job Sequencing Problem - GFG	Job Sequencing Problem - GFG
Knapsack with Duplicate Items - GFG	Knapsack with Duplicate Items - GFG
LCM And GCD - GFG	LCM And GCD - GFG
Largest BST - GFG	Largest BST - GFG
Largest Divisible Subset - GFG	Largest Divisible Subset - GFG
Largest Element in Array - GFG	Largest Element in Array - GFG
Largest subarray with 0 sum - GFG	Largest subarray with 0 sum - 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
Longest String Chain - GFG	Longest String Chain - GFG
Longest Sub-Array with Sum K - GFG	Longest Sub-Array with Sum K - GFG
Max Sum without Adjacents - GFG	Max Sum without Adjacents - GFG
Maximum sum increasing subsequence - GFG	Maximum sum increasing subsequence - GFG
Merge Sort - GFG	Merge Sort - GFG
Minimum Spanning Tree - GFG	Minimum Spanning Tree - GFG
Minimum element in a sorted and rotated array - GFG	Minimum element in a sorted and rotated array - GFG
Mirror Tree - GFG	Mirror Tree - GFG
Missing number - GFG	Missing number - 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

Name

Last commit message

Last commit date