## Average of remaining elements after removing K largest and K smallest elements from array

Given an array of N integers. The task is to find the average of the numbers after removing k largest elements and k smallest element… Read More »

- Sorting in Java
- Elements that occurred only once in the array
- Sort elements by frequency | Set 5 (using Java Map)
- Quick Sort vs Merge Sort
- Python list sort()
- Print the nodes of binary tree as they become the leaf node
- Sort first k values in ascending order and remaining n-k values in descending order
- In-Place Algorithm
- Merge Sort with O(1) extra space merge and O(n lg n) time
- Sort only non-prime numbers of an array in increasing order
- Number of elements greater than K in the range L to R using Fenwick Tree (Offline queries)
- Check if it is possible to sort the array after rotating it
- Sort first half in ascending and second half in descending order | Set 2
- Maximum Sum of Products of Two Arrays
- Stable QuickSort
- Print array elements in alternatively increasing and decreasing order
- Sort a nearly sorted array using STL
- Water drop problem
- Find the largest number that can be formed with the given digits
- Count number of triplets with product equal to given number | Set 2
- Check if array can be sorted with one swap
- Number of anomalies in an array
- Number of paths from source to destination in a directed acyclic graph
- Maximum sum by picking elements from two arrays in order
- Minimum Increment / decrement to make array elements equal
- Sort an array of pairs using Java Pair and Comparator
- Find a point such that sum of the Manhattan distances is minimized
- Java 8 | Arrays parallelSort() method with Examples
- Count number of triplets in an array having sum in the range [a, b]
- Find closest value for every element in array

Given an array of N integers. The task is to find the average of the numbers after removing k largest elements and k smallest element… Read More »

Given an array arr[] of N integers and an index range [a, b]. The task is to sort the array in this given index range… Read More »

Given an array of strings dates[], the task is to sort these dates in ascending order. Note: Each date is of the form dd mmm… Read More »

Given two arrays of size N and two integers X and Y indicating the maximum number of elements one can pick from array A and… Read More »

Given a sequence of Words and the Order of the alphabet. The order of the alphabet is some permutation of lowercase letters. The task is… Read More »

Given an array of integers, find the closest smaller or same element for every element. If all elements are greater for an element, then print… Read More »

Given an array containing N elements. It is allowed to do the below move any number of times on the array: Choose any L and… Read More »

Given an array of integers, find the closest element for every element. Examples: Input : arr[] = {10, 5, 11, 6, 20, 12} Output :… Read More »

Given an array containing N elements. Find if it is possible to sort it in non-decreasing order using atmost one swap. Examples: Input : arr[]… Read More »

Given an integer K and an array arr each of whose element x represents a square with two of its vertices as (0, 0) and… Read More »

Given a matrix of distinct elements. The task is to sort the rows of matrix in descending order followed by sorting the columns in ascending… Read More »

Given an array of N elements, the task is to convert it into a permutation (Each number from 1 to N occurs exactly once) by… Read More »

Given a binary tree. First print all leaf nodes, after that remove all the leaf nodes from the tree and now print all the new… Read More »

Given an integer and an integer array , the task is to find the minimum possible sum of all the elements of the array after… Read More »