Find the minimum number of rectangles left after inserting one into another
Given width and height of N rectangles. The task is to find the minimum number of rectangles left after inserting one into another. Note :… Read More »
Category Archives: Sorting
Largest number not greater than N which can become prime after rearranging its digits
Given a number N, the task is to find the largest number less than or equal to the given number N such that on rearranging… Read More »
Product of all Subsequences of size K except the minimum and maximum Elements
Given an array A[] containing N elements and an integer K. The task is to calculate the product of all elements of subsequences of size… Read More »
Sum of elements in 1st array such that number of elements less than or equal to them in 2nd array is maximum
Given two unsorted arrays arr1[] and arr2[], the task is to find the sum of elements of arr1[] such that number of elements less than… Read More »
Print 2-D co-ordinate points in ascending order followed by their frequencies
Given two arrays x[] and y[] where x[i] represents the x coordinate and y[i] represents the corresponding y coordinate of a 2-D point, the task… Read More »
Delete odd and even numbers at alternate step such that sum of remaining elements is minimized
Given an array arr[] of N elements. At any step, we can delete a number of a different parity from the just previous step, i.e.,… Read More »
Split the array elements into strictly increasing and decreasing sequence
Given an array of N elements. The task is to split the elements into two arrays say a1[] and a2[] such that one contains strictly… Read More »
Divide array into two parts with equal sum according to the given constraints
Given an array arr[] of N integers, the task is to select an integer x (which may or may not be present in the array)… Read More »
Shell-Metzner Sort
Given an array arr[] of N integers, the task is to sort the array using Shell-Metzner sort. Input: arr[] = {0, -2, 8, 5, 1}… Read More »
Bubble Sort for Linked List by Swapping nodes
Given a singly linked list, sort it using bubble sort by swapping nodes. Example: Input: 10->30->20->5 Output: 5->10->20->30 Input: 20->4->3 Output: 3->4->20 Recommended: Please try… Read More »
Range Queries to Find number of sub-arrays with a given xor
Given an array arr[] of size n and q queries and an integer k. Each query consists of an index range [l, r] and the… Read More »
Generate original array from difference between every two consecutive elements
Given N – 1 differences between two consecutive elements of an array containing N numbers which are in range of 1 to N. The task… Read More »
Find the number of elements greater than k in a sorted array
Given a sorted array arr[] of integers and an integer k, the task is to find the count of elements in the array which are… Read More »
Iterative selection sort for linked list
Given a linked list, the task is to sort the linked list in ascending order by using selection sort. Examples: Input : 1->4->2->2->3 Output :… Read More »
Check if the string contains consecutive letters and each letter occurs exactly once
Given string str. The task is to check if the string contains consecutive letters and each letter occurs exactly once. Examples: Input: str = “fced”… Read More »
