## k-th missing element in an unsorted array

Given an unsorted sequence a[], the task is to find the K-th missing contiguous element in the increasing sequence of the array elements i.e. consider… Read More »

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

Given an unsorted sequence a[], the task is to find the K-th missing contiguous element in the increasing sequence of the array elements i.e. consider… Read More »

Given a sorted array A of n integers. The task is to find the sum of minimum of all possible subsequences of A. Note: Considering… Read More »

Given a sorted array A of n integers. The task is to find the sum of minimum of all possible subarrays of A. Examples: Input:… Read More »

Given a NxN matrix, the task is to find the sum of bit-wise OR of all of its rectangular sub-matrices. Examples: Input : arr[][] =… Read More »

Given a NxN matrix, the task is to find the sum of bit-wise AND of all of its rectangular sub-matrices. Examples: Input : arr[][] =… Read More »

Given an array arr[] of n integers. The task is to find the maximum length of the sub-array which has the maximum average value (average… Read More »

Given a character array arr[] containing only lowercase English alphabets, the task is to print the maximum length of the subarray such that the first… Read More »

Given an array arr[] of positive integers and an integer x, the task is to minimize the sum of elements of the array after performing… Read More »

Given an array A[], the task is to find the minimum number of operations required to convert the array into B[] such that for every… Read More »

Given an array of N numbers, the task is to find the number of sub-arrays (size of the sub-array should be an even number) of… Read More »

Given an array of n integers. The task is to find the maximum length of the sub-array such that absolute difference between all the consecutive… Read More »

Given an array of N integers. The task is to eliminate the minimum number of elements such that in the resulting array the sum of… Read More »

Given an array arr[] and an integer k, the task is to find the maximum product from the array such that the frequency sum of… Read More »

Given an array arr[] of N elements, the task is to find the length of the longest sub-sequence in arr[] such that all the elements… Read More »

Given an array arr[], the task is to count the number of elements from the array which divide the sum of all other elements. Examples:… Read More »