## Count inversions in an array | Set 4 ( Using Trie )

Inversion Count for an array indicates – how far (or close) the array is from being sorted. If the array is already sorted then inversion… Read More »

- Optimal Strategy for a Game | Set 2
- Sliding Window Maximum (Maximum of all subarrays of size k) using stack in O(n) time
- Building Heap from Array
- Find k closest numbers in an unsorted array
- Amazon Internship Interview Experience
- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Create linked list from a given array
- Maximum sum such that no two elements are adjacent | Set 2
- Maximum Sum Subsequence of length k
- Sort an array without changing position of negative numbers
- Maximum absolute difference in an array
- Maximum element in a sorted and rotated array
- Given two arrays count all pairs whose sum is an odd number
- Find maximum xor of k elements in an array
- Kth smallest element in a subarray
- Count the triplets such that A[i] < B[j] < C[k]
- Find the longest string that can be made up of other strings from the array
- Find minimum difference between any two elements | Set 2
- Partition an array of non-negative integers into two subsets such that average of both the subsets is equal
- Introduction to Data Structures | 10 most commonly used Data Structures
- Count of integers of length N and value less than K such that they contain digits only from the given set
- Number of subsets with zero sum
- Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum
- Maximum sum combination from two arrays
- Greatest contiguous sub-array of size K
- Remove duplicate elements in an Array using STL in C++
- Find the smallest positive number missing from an unsorted array | Set 3
- Minimum cost to reach end of array array when a maximum jump of K index is allowed
- Find the minimum number of operations required to make all array elements equal
- Pair with largest sum which is less than K in the array

Inversion Count for an array indicates – how far (or close) the array is from being sorted. If the array is already sorted then inversion… Read More »

Given an array Arr of positive intergers and a value X. The task is to find the number of values that is greater than or… Read More »

Given an array Arr[] of N of positive integers. The task is to find positions of all the elements which are equal to the sum… Read More »

Given an array arr[] of integers and another integer D, the task is to perform D left rotations on the array and print the modified… Read More »

Given an array arr[] of size N. The task is to find the number of subsequences whose sum is even and the number of subsequences… Read More »

Given an array arr[] of N integers, the task is to remove the elements from both the ends of the array i.e. in a single… Read More »

Given the length of an array of integers N and an integer K. The task is to modify the array in such a way that… Read More »

Given an array arr[] of N integers. The task is to find the sum of elements till the smallest index such that there are no… Read More »

Given an array Arr of non-negative integers of size N. The task is to find the maximum possible xor between two numbers present in the… Read More »

Given an array of N integers. Given two single digit numbers T1 and T2 and a number X. The task is to find out the… Read More »

Given an array Arr[]. The task is to count the number of elements Arr[i] in the given array such that one or more smaller elements… Read More »

Given an array of integers A. The task is to minimise the sum of the elements of the array using the following rule: Choose two… Read More »

Given an array A consisting of positive integer, of size N. If the element in the array at index i is K then you can… Read More »

Given an array arr[] of size N and an integer K, the task is to delete K continuous elements from the array such that the… Read More »

Given an array arr[] of N integers, the task is to swap the first and the last element then the third and the third last… Read More »