Name		Name	Last commit message	Last commit date
Latest commit History 140 Commits
0 - 1 Knapsack Problem		0 - 1 Knapsack Problem
All Unique Permutations of an array		All Unique Permutations of an array
Anti Diagonal Traversal of Matrix		Anti Diagonal Traversal of Matrix
Array Pair Sum Divisibility Problem		Array Pair Sum Divisibility Problem
BFS of graph		BFS of graph
Binary Search		Binary Search
Candy		Candy
Check if all leaves are at same level		Check if all leaves are at same level
Count Inversions		Count Inversions
Count digit groupings of a number		Count digit groupings of a number
Count possible ways to construct buildings		Count possible ways to construct buildings
Course Schedule		Course Schedule
Cyclically rotate an array by one		Cyclically rotate an array by one
Distribute candies in a binary tree		Distribute candies in a binary tree
DollarSum		DollarSum
Easy		Easy
Equilibrium Point		Equilibrium Point
Find duplicate rows in a binary matrix		Find duplicate rows in a binary matrix
Find element occuring once when all other are present thrice		Find element occuring once when all other are present thrice
First non-repeating character in a stream		First non-repeating character in a stream
Floor in a Sorted Array		Floor in a Sorted Array
Fractional Knapsack		Fractional Knapsack
Geekina Hate 1s		Geekina Hate 1s
Given a linked list of 0s, 1s and 2s, sort it.		Given a linked list of 0s, 1s and 2s, sort it.
Grinding Geek		Grinding Geek
Hard/Boolean Parenthesization		Hard/Boolean Parenthesization
Implement strstr		Implement strstr
Insertion Sort for Singly Linked List		Insertion Sort for Singly Linked List
Kadane's Algorithm		Kadane's Algorithm
Largest Sum Subarray of Size at least K		Largest Sum Subarray of Size at least K
Leaders in an array		Leaders in an array
Longest Increasing Subsequence		Longest Increasing Subsequence
Longest subarray with sum divisible by K		Longest subarray with sum divisible by K
Lowest Common Ancestor in a Binary Tree		Lowest Common Ancestor in a Binary Tree
Max Sum without Adjacents		Max Sum without Adjacents
Medium		Medium
Merge 2 sorted linked list in reverse order		Merge 2 sorted linked list in reverse order
Midpoint		Midpoint
Minimize the Heights I		Minimize the Heights I
Nth node from end of linked list		Nth node from end of linked list
Palindrome String		Palindrome String
Paths from root with a specified sum		Paths from root with a specified sum
Peak element		Peak element
Product array puzzle		Product array puzzle
Remove loop in Linked List		Remove loop in Linked List
Reverse First K elements of Queue		Reverse First K elements of Queue
Reverse array in groups		Reverse array in groups
Search Pattern (KMP-Algorithm)		Search Pattern (KMP-Algorithm)
Sequence of Sequence		Sequence of Sequence
Smallest Positive missing number		Smallest Positive missing number
Smallest window containing 0, 1 and 2		Smallest window containing 0, 1 and 2
Spirally traversing a matrix		Spirally traversing a matrix
Split Array Largest Sum		Split Array Largest Sum
Stickler Thief		Stickler Thief
Stock buy and sell		Stock buy and sell
Subarray with 0 sum		Subarray with 0 sum
Techfest and the Queue		Techfest and the Queue
Top k numbers in a stream		Top k numbers in a stream
Value equal to index value		Value equal to index value
Vertex Cover		Vertex Cover
Water the plants		Water the plants
Winner of an election		Winner of an election
README.md		README.md

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Gfg-Geetanjali

About

Releases

Packages

Languages

geetanjalikandpal21/Gfg-Geetanjali

Folders and files

Latest commit

History

Repository files navigation

Gfg-Geetanjali

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages