## Check whether an array can be made strictly decreasing by modifying at most one element

Given an array arr[] of positive integers, the task is to find whether it is possible to make this array strictly decreasing by modifying at… Read More »

- MakeMyTrip Interview Experience 2019
- Make all numbers of an array equal
- Count distinct elements in an array
- Reach the numbers by making jumps of two given lengths
- Sum of XOR of all subarrays
- Coviam Software Developer Internship Experience
- Rearrange Odd and Even values in Alternate Fashion in Ascending Order
- Find k closest numbers in an unsorted array
- Sliding Window Maximum (Maximum of all subarrays of size k) using stack in O(n) time
- Program for K Most Recently Used (MRU) Apps
- Optimal Strategy for a Game | Set 2
- Minimum operations required to make all the array elements equal
- Longest subsequence such that adjacent elements have at least one common digit
- Count pairs in array whose sum is divisible by K
- A Sum Array Puzzle
- Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
- Amazon Internship Interview Experience
- Python | Using 2D arrays/lists the right way
- Count of pairs (x, y) in an array such that x < y
- Maximum of all Subarrays of size k using set in C++ STL
- Number of pairs whose sum is a power of 2
- k-th missing element in an unsorted array
- Minimum elements to be removed such that sum of adjacent elements is always even
- Number of unique pairs in an array
- Length of the longest alternating subarray
- Remove minimum elements from either side such that 2*min becomes more than max | Set 2
- Array Manipulation and Sum
- Given two arrays count all pairs whose sum is an odd number
- Building Heap from Array
- Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )

Given an array arr[] of positive integers, the task is to find whether it is possible to make this array strictly decreasing by modifying at… Read More »

Given an array arr[] and an integer X, the task is to find the indices such that: The sum of elements on the found indices… Read More »

Given an unsorted array arr[] of size n, the task is to find the minimum difference between any pair in the given array. Input: arr[]… Read More »

Given a permutation from 1 to N of size N. Find the length of the longest subsequence having the property that the first and last… Read More »

Given an array arr[] of N elements. The task is to find the number of sub-sequences which have at least two consecutive elements such that… Read More »

Given an array arr[] of size N, the task is to generate and print all permutations of the given array. Examples: Input: arr[] = {1,… Read More »

Given an array of integers. The task is to rearrange elements of the array such that no two adjacent elements in the array are same.… Read More »

Given an array, the task is to create a new sorted array in ascending order from the elements of the given array. Examples: Input :… Read More »

Given an integer array ‘arr’ of length N and an integer ‘k’, select some non-overlapping subarrays such that each sub-array if of length at most… Read More »

Given an integer N, for every integer i in the range 2 to N, assign a positive integer such that the following conditions hold :… Read More »

Given two arrays a1[] and a2[], print elements of a1 in such a way that the relative order among the elements will be the same… Read More »

Given an array arr[] of size N, the task is to generate and print all possible combinations of R elements in array. Examples: Input: arr[]… Read More »

Given an array arr[] of N integers, the task is to find the longest sub-sequence in the given array such that for all pairs from… Read More »

Given an array “arr[0..n-1]” of integers. The task is to calculate the sum of Bitwise OR of all pairs, i.e. calculate the sum of “arr[i]… Read More »

Given an array of integers arr[], the task is to find the sum of all the Mersenne numbers from the array. A number is a… Read More »