## Check whether an array can be made strictly decreasing by modifying at most one element

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

- Count distinct elements in an array
- Rearrange Odd and Even values in Alternate Fashion in Ascending Order
- Sort the array of strings according to alphabetical order defined by another string
- Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
- Amazon Internship Interview Experience
- Ternary Search
- Number of pairs whose sum is a power of 2
- k-th missing element in an unsorted array
- Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
- Nagarro Interview Experience Off-campus
- Smallest subarray containing minimum and maximum values
- Comparison among Bubble Sort, Selection Sort and Insertion Sort
- Array element with minimum sum of absolute differences
- Split the array elements into strictly increasing and decreasing sequence
- Python | Sort list of list by specified index
- Iterative selection sort for linked list
- Count the triplets such that A[i] < B[j] < C[k]
- Bubble Sort for Linked List by Swapping nodes
- Maximum water that can be stored between two buildings
- Minimum operations of given type to make all elements of a matrix equal
- Average of remaining elements after removing K largest and K smallest elements from array
- Delete odd and even numbers at alternate step such that sum of remaining elements is minimized
- Find the minimum number of rectangles left after inserting one into another
- Minimum operations to make frequency of all characters equal K
- Remove elements to make array sorted
- Make palindromic string non-palindromic by rearranging its letters
- Keep track of previous indexes after sorting a vector in C++ STL
- Range Queries to Find number of sub-arrays with a given xor
- Leftmost and rightmost indices of the maximum and the minimum element of an array
- Divide array into two parts with equal sum according to the given constraints

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

Given a Binary Search Tree with two of the nodes of the Binary Search Tree (BST) swapped. The task is to fix (or correct) the… Read More »

Given a permutation from 1 to N of size N. Find the length of the longest subsequence having the property that the first and last… Read More »

Given an array, the task is to create a new sorted array in ascending order from the elements of the given array. Examples: Input :… Read More »

Given two Binary Search Trees(BST), print the elements of both BSTs in sorted form. Note: Both the BSTs will not have any common element. Examples:… Read More »

Given two arrays a1[] and a2[], print elements of a1 in such a way that the relative order among the elements will be the same… Read More »

Given two arrays, we have to check whether we can sort two arrays in strictly ascending order by swapping A[i] and B[i]. Examples: Input :… Read More »

Given an array containing distinct positive integers and an integer k. The task is to find the largest possible k-multiple set from the array of… Read More »

Given an array of integers, the task is to remove elements from the array to make array sorted. That is, remove the elements which do… Read More »

Given an integer array which represents the heights of N buildings, the task is to delete N-2 buildings such that the water that can be… Read More »

Given an array arr[], the task is to count the maximum number of elements that can be selected from the given array following the below… Read More »

The human brain can easily process visuals in spite of long codes to understand the algorithms. In this article, Bubble sort visualization has been implemented… Read More »

Given a positive integer N, the task is to find out all the combinations of positive integers that add upto the given integer N. The… 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 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 »