## Number of subsets with zero sum

Given an array ‘arr’ consisting of integers, the task is to find the number of subsets such that their sum is equal to zero. Empty… 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 an array ‘arr’ consisting of integers, the task is to find the number of subsets such that their sum is equal to zero. Empty… Read More »

Given an array arr[] of length N, the task is to find the sum of the maximum elements of every possible sub-array of the array.… Read More »

Given an integer array of N elements. The task is to find the number of ways to split the array into two equal sum sub-arrays… Read More »

Given an array which is an original arithmetic progression with one element changed. The task is to make it an arithmetic progression again. If there… Read More »

Given an array arr[] of N integers, you can select some indexes such that every selected index has exactly one other selected index adjacent to… Read More »

Given an array arr[] of N integers and an integer X, the task is to find the maximum possible sub-array sum after applying at most… Read More »

Given an array Q[] of length N, the task is to find the permutation P[] of integers from the range [1, N + 1] such… Read More »

Given an array sequence [A1, A2 …An], the task is to find the maximum possible sum of increasing subsequence S of length k such that… Read More »

Given three array A[], B[] and C[] of N integers each. The task is to find the count of triplets (A[i], B[j], C[k]) such that… Read More »

Given a tree, and the weights (in the form of strings) of all the nodes, the task is to count the nodes whose weights are… Read More »

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

Given an integer array of size n and a number k. If the indexing is 1 based then the middle element of the array is… Read More »

Given an array arr[] of N integers from 1 to N. The task is to perform the following operations N – 1 times. Select two… Read More »

Given an integer array arr[], the task is to check if that array contains all the divisor of some integer. Examples: Input: arr[] = {… Read More »

Given an array of n integers, the task is to make two Binary Search Tree from the given array (in any order) such that the… Read More »