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