## Find array such that no subarray has xor zero or Y

Given two integers X (1 ≤ X ≤ 15) and Y. The task is to find an array of the maximum possible length N such… Read More »

- Make all numbers of an array equal
- Optimal Strategy for a Game | Set 2
- Sliding Window Maximum (Maximum of all subarrays of size k) using stack in O(n) time
- Sum of XOR of all subarrays
- Find k closest numbers in an unsorted array
- Count pairs in array whose sum is divisible by K
- Building Heap from Array
- Amazon Internship Interview Experience
- Program for K Most Recently Used (MRU) Apps
- Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
- Longest subsequence such that adjacent elements have at least one common digit
- k-th missing element in an unsorted array
- Minimum operations required to make all the array elements equal
- Count of pairs (x, y) in an array such that x < y
- Maximum sum such that no two elements are adjacent | Set 2
- Number of unique pairs in an array
- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
- Maximum element in a sorted and rotated array
- Length of the longest alternating subarray
- Minimum elements to be removed such that sum of adjacent elements is always even
- Given two arrays count all pairs whose sum is an odd number
- Array Manipulation and Sum
- Remove minimum elements from either side such that 2*min becomes more than max | Set 2
- Sort an array without changing position of negative numbers
- Count array elements that divide the sum of all other elements
- Create linked list from a given array
- Find minimum difference between any two elements | Set 2
- Find two numbers whose divisors are given in a random order
- Maximum absolute difference in an array

Given two integers X (1 ≤ X ≤ 15) and Y. The task is to find an array of the maximum possible length N such… Read More »

Given two string arrays s1[] and s2[]. The task is to find the count of pairs (s1[i], s2[j]) such that s1[i] = s2[j]. Note that… Read More »

Given a binary array arr[], the task is to find the length of the longest sub-array of the given array such that if the sub-array… Read More »

Given an integer array arr of size N. The task is to find the maximum possible elements in the array which are divisible by 2… Read More »

Given an array arr[] and two integers K and D, the task is to find exactly K pairs (arr[i], arr[j]) from the array such that… Read More »

Given an array of size N and an integer K. The task is to partition the array in K segments such that bitwise AND of… Read More »

Given an array arr[] and an integer K, the task is to find the count of pairs (arr[i], arr[j]) from the array such that |arr[i]… Read More »

Given an array arr[] of integers and an integer K, we can perform the Bitwise OR operation between any array element and K any number… Read More »

Given a sorted array of N integers. The task is to find the longest subsequence such that every element in the subsequence is reachable by… Read More »

Given an array arr[] and an integer sum, the task is to find the number of pairs of integers in the array whose sum is… Read More »

Given a multi-dimensional array and the task is to convert this array into an XML file. To converting the multi-dimensional array into an xml file,… Read More »

Given an array of N integers, the task is to arrange them in a circular arrangement in such a way that the element is strictly… Read More »

Given an array a of size N. The task is to find an index ‘i’ (1 <= i <= N) such that (a[1] ^ …… Read More »

Given an array arr[] and two integers X and Y. The task is to check whether it is possible to make all the elements equal… Read More »

Given an array of size N. The task is to partition the given array into two subsets such that the average of all the elements… Read More »