gfg-potd

Binary Tree to DLL

gfg-potd

Given a Binary Tree (BT), convert it to a Doubly Linked List (DLL) in place. The left and right pointers […]

Mirror Tree

gfg-potd

Given a Binary Tree, convert it into its mirror.             Examples: Input: 1   / \   2 3 Output: 3

Minimum Cost Of Ropes

gfg-potd

Given an array arr containing the lengths of the different ropes, we need to connect these ropes to form one rope. The cost to

Circle Of Strings

gfg-potd

Given an array arr of lowercase strings, determine if the strings can be chained together to form a circle.A string X can be chained

Sort 0s, 1s and 2s

gfg-potd

Given an array arr containing only 0s, 1s, and 2s. Sort the array in ascending order. Examples: Input: arr[]= [0, 2, 1, 2, 0]

Minimum Jumps

gfg-potd

Given an array arr[] of non-negative integers. Each array element represents the maximum length of the jumps that can be made forward from that

Nth Natural Number

gfg-potd

Given a positive integer n. You have to find nth natural number after removing all the numbers containing the digit 9. Examples :

Kadane’s Algorithm

gfg-potd

Given an integer array arr[]. Find the contiguous sub-array(containing at least one number) that has the maximum sum and return its sum. Examples:

Missing in Array

gfg-potd

Given an array arr of size n−1 that contains distinct integers in the range of 1 to n (inclusive), find the missing element. The array

Scroll to Top