## Sort elements of the array that occurs in between multiples of K

Given an array arr[] and an integer K. The task is to sort the elements that are in between any two multiples of K. Examples:… Read More »

- Remove duplicates from unsorted array
- Coin game of two corners (Greedy Approach)
- Sort elements by frequency | Set 5 (using Java Map)
- Minimum number of swaps required to sort an array | Set 2
- Design a Hit Counter
- MakeMyTrip Interview Experience 2019
- Next greater element in same order as input
- Minimum number of items to be delivered
- Program to find the Hidden Number
- Make all numbers of an array equal
- Reach the numbers by making jumps of two given lengths
- Longest subarray having maximum sum
- Count distinct elements in an array
- Calculate the total fine to be collected
- Program for K Most Recently Used (MRU) Apps
- Check whether an Array is Subarray of another Array
- Program to check if an array is palindrome or not using Recursion
- Largest palindromic number in an array
- Check if an array is sorted and rotated
- Rearrange Odd and Even values in Alternate Fashion in Ascending Order
- Sum of all odd frequency elements in an array
- How do Dynamic arrays work?
- Multidimensional Arrays in Java
- Generating subarrays using recursion
- Coviam Software Developer Internship Experience
- Find triplets in an array whose AND is maximum
- Convert a String to Integer Array in C/C++
- For each element in 1st array count elements less than or equal to it in 2nd array | Set 2
- Length of the longest Subarray with only Even Elements
- Minimum operations required to make all the array elements equal

Given an array arr[] and an integer K. The task is to sort the elements that are in between any two multiples of K. Examples:… Read More »

Given a string str which represents the ASCII Sentence, the task is to convert this string into its equivalent character sequence. Examples: Input: str =… Read More »

Given three arrays A[], B[] and C[] of N integers. We can choose N elements from these array such that for every index i only… Read More »

Given an integer K and an array arr[], the task is to count all the sub-arrays whose product is divisible by K. Examples: Input: arr[]… Read More »

Given an unsorted array, trim the array such that twice of minimum is greater than maximum in the trimmed array. Elements should be removed from… Read More »

Given an array arr[], the task is to count maximum count of pairs which give the same sum. Examples: Input: arr[] = {1, 2, 3,… Read More »

Given a string str, the task is to count how many times the keys will be pressed in total if there is a mobile like… Read More »

Given an array of N sorted ranges and a number K. The task is to find the index of the range in which K lies.… Read More »

Given an array of size n, the task is to find the minimum number of steps required to make all the elements of the array… Read More »

Given an array A and positive integer K. The task is to find maximum number elements for which the absolute difference of any of the… Read More »

Given an array of integers, the task is to find the AND of all elements of each subset of the array and print the minimum… Read More »

Given a string array str[], the task is to find the first string from the given array whose reverse is also present in the same… Read More »

Given an array arr[] and an integer K, the task is to find out the minimum product of a subsequence where adjacent elements of the… Read More »

Given two numbers N and P. The task is to generate an array of all positive elements, and in one operation you can choose a… Read More »

Given an array A[] and positive integer K, the task is to count total number of pairs in the array whose sum is divisible by… Read More »