## Find the minimum of maximum length of a jump required to reach the last island in exactly k jumps

Given an array arr[] of integers, where the ith integer represents the position where an island is present, and an integer k (1 ≤ k… Read More »

- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Optimal File Merge Patterns
- Find Intersection of all Intervals
- Given count of digits 1, 2, 3, 4, find the maximum sum possible
- Find the maximum possible value of a[i] % a[j] over all pairs of i and j
- Maximum number of candies that can be bought
- Minimum number of pairs required to make two strings same
- Minimum elements to be removed such that sum of adjacent elements is always odd
- Minimum operations to make frequency of all characters equal K
- Rectangle with minimum possible difference between the length and the width
- Greedy approach vs Dynamic programming
- Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum
- Maximum distance between two unequal elements
- Minimum cuts required to convert a palindromic string to a different palindromic string
- Check whether a subsequence exists with sum equal to k if arr[i]> 2*arr[i-1]
- Count all possible N digit numbers that satisfy the given condition
- Count common elements in two arrays containing multiples of N and M
- Find the minimum number of steps to reach M from N
- Find smallest number K such that K % p = 0 and q % K = 0
- Divide a number into two parts
- Maximal Disjoint Intervals
- Count possible moves in the given direction in a grid
- Find the sum of digits of a number at even and odd places
- Find n positive integers that satisfy the given equations
- Minimum LCM and GCD possible among all possible sub-arrays
- Find the Kth smallest element in the sorted generated array
- Count the pairs of vowels in the given string
- Create a Sorted Array Using Binary Search
- Minimum deletions required such that any number X will occur exactly X times
- Maximum count of sub-strings of length K consisting of same characters

Given an array arr[] of integers, where the ith integer represents the position where an island is present, and an integer k (1 ≤ k… Read More »

Given an array of N elements and you can perform two operations on it: Increase any of the array element by X once. Decrease any… Read More »

Given a binary array of N elements and two initial values a and b. We can cross the i-th element if: If a[i] == 0,… Read More »

Given a number N, the task is to find the largest number less than or equal to the given number N such that on rearranging… Read More »

Given an array arr[] of random integers, the task is to push all the zero’s in the array to the start and all the one’s… Read More »

Given an array arr[] of N positive integers. The task is to find the maximum possible value of a[i] % a[j] over all pairs of… Read More »

Given a string str consisting of lowercase English alphabets, the task is to count the number of adjacent pairs of vowels. Examples: Input: str =… Read More »

Given N monsters, each monster has initial health h[i] which is an integer. A monster is alive if its health is greater than 0. In… Read More »

Given a merged sequence which consists of two sequences which got merged, one of them was strictly increasing and the other was strictly decreasing. Elements… Read More »

Given an integer N. The task is to generate a symmetric matrix of order N*N having the following properties. Main diagonal should contain only 0’s… Read More »

Given an array, arr[] of N integers, where arr[i] represents the number of distinct characters in the prefix of length (i + 1) of a… Read More »

Given a number N, the task is to find the sum of digits of a number at even and odd places. Examples: Input: N =… Read More »

You have an unlimited amount of banknotes worth A and B dollars (A not equals to B). You want to pay a total of S dollars using exactly N notes. The… Read More »

Given an integer N containing the digit 4 at least once. The task is to divide the number into two parts x1 and x2 such… Read More »

Given a number N. At every step, subtract the largest perfect square( ≤ N) from N. Repeat this step while N > 0. The task… Read More »