## Change in Median of given array after deleting given elements

Given two arrays arr1[] and arr2[]. The array arr1[] is sorted. The task is to print the change in median after removing each element from… Read More »

- Largest Square in a Binary Matrix with at most K 1s for multiple Queries
- Check if a string is a scrambled form of another string
- Median of an unsorted array using Quick Select Algorithm
- Minimum cost of reducing Array by merging any adjacent elements repetitively
- Check if a given number is a Perfect square using Binary Search
- Minimum window size containing atleast P primes in every window of given range
- Find Second largest element in an array | Set 2
- Longest subarray having sum K | Set 2
- Queries to check if any non-repeating element exists within range [L, R] of an Array
- Range Queries for number of Armstrong numbers in an array with updates
- Queries to find the Minimum Weight from a Subtree of atmost D-distant Nodes from Node X
- Array Range Queries to find the Maximum Armstrong number with updates
- Minimum capacity of small arrays needed to contain all element of the given array
- Count number of pairs with the given Comparator
- Split a Numeric String into Fibonacci Sequence
- Frequency of an integer in the given array using Divide and Conquer
- Find the element having maximum set bits in the given range for Q queries
- Split a given array into K subarrays minimizing the difference between their maximum and minimum
- Largest substring where all characters appear at least K times | Set 2
- Fast Doubling method to find the Nth Fibonacci number
- Array range queries to find the number of perfect square elements with updates
- Check if given Binary string follows then given condition or not
- How to implement text Auto-complete feature using Ternary Search Tree
- Calculate weight of parenthesis based on the given conditions
- Minimum value of K such that sum of cubes of first K natural number is greater than equal to N
- Range Queries to count the number of even parity values with updates
- Quick Sort using Multi-threading
- Least root of given quadratic equation for value greater than equal to K
- Array range queries to find the maximum Fibonacci number with updates
- Reduce the array by deleting elements which are greater than all elements to its left

Given two arrays arr1[] and arr2[]. The array arr1[] is sorted. The task is to print the change in median after removing each element from… Read More »

Given a set of strings S and a string patt the task is to autocomplete the string patt to strings from S that have patt… Read More »

Given an integer N, the task is to find the N-th Fibonacci numbers. Examples: Input: N = 3 Output: 2 Explanation: F(1) = 1, F(2)… Read More »

Given an array arr[] of size N containing integers. The task is to find the length of the longest sub-array having sum equal to the… Read More »

Given a string str and an integer K, the task is to find the length of the longest sub-string S such that every character in… Read More »

Given a sorted array arr[] of N integers and an integer K, the task is to split the array into K subarrays such that the… Read More »

Given a sorted array arr[], and a set Q having M queries, where each query has values X and Y, the task is to find… Read More »

Given an array arr[] of N integers, the task is to delete the element from the given array if element to it’s left is smaller… Read More »

Given two strings S1 and S2 of equal length, the task is to determine if S2 is a scrambled form of S1. Scrambled string: Given… Read More »

Given a number N, the task is to find the minimum value K such that the sum of cubes of the first K natural number… Read More »

In the number guessing game, the user selects a number within a defined range and then the program guesses the number. If the number guessed… Read More »

Check if a given number N is a perfect square or not. If yes then return the number of which it is a perfect square,… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: query(start, end): Print the number of Armstrong numbers in… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: maximum(start, end): Print the maximum Armstrong number of elements… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: query(start, end): Print the number of perfect square numbers… Read More »