## Find the number of different numbers in the array after applying the given operation q times

Given an array of size N, initially consists of zeroes only. The task is to apply given operation q times and find the number of… Read More »

- Largest Square in a Binary Matrix with at most K 1s for multiple Queries
- Median of an unsorted array using Quick Select Algorithm
- Check if a string is a scrambled form of another string
- Count of smaller elements on right side of each element in an Array using Merge sort
- 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
- 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
- Queries to find the Minimum Weight from a Subtree of atmost D-distant Nodes from Node X
- Count number of pairs with the given Comparator
- Split a Numeric String into Fibonacci Sequence
- Find the element having maximum set bits in the given range for Q queries
- Frequency of an integer in the given array using Divide and Conquer
- Array range queries to find the number of perfect square elements with updates
- Fast Doubling method to find the Nth Fibonacci number
- Check if given Binary string follows then given condition or not
- Minimum value of K such that sum of cubes of first K natural number is greater than equal to N
- Largest substring where all characters appear at least K times | Set 2
- Calculate weight of parenthesis based on the given conditions
- Range Queries to count the number of even parity values with updates
- Split a given array into K subarrays minimizing the difference between their maximum and minimum
- Least root of given quadratic equation for value greater than equal to K
- How to implement text Auto-complete feature using Ternary Search Tree
- Array range queries to find the maximum Fibonacci number with updates
- Range Update Queries to XOR with 1 in a Binary Array.

Given an array of size N, initially consists of zeroes only. The task is to apply given operation q times and find the number of… Read More »

Given an array arr[] of integers, the task is to find the maximum sum sub-array among all the possible sub-arrays. Examples: Input: arr[] = {-2,… Read More »

Interactive Problems are those problems in which our solution or code interacts with the judge in real time. When we develop a solution for an… Read More »

Given an array arr[] of size N. There are two types of operations: Update(l, r, x) : Increment the a[i] (l <= i <= r)… Read More »

Given a sorted array arr[] of distinct elements which is rotated at some unknown point, the task is to find the maximum element in it.… Read More »

Introsort(Introspective sort) is a comparison based sort that consists of three sorting phases. They are Quicksort, Heapsort, and Insertion sort. Basic concepts of Introsort and… Read More »

Given an integer N. The following tasks are performed: The number is noted. The leading digit from N is subtracted from N and the resulting… Read More »

Given two integers A and B, the task is to calculate 22A % B. Examples: Input: A = 3, B = 5 Output: 1 223… Read More »

Given three integers X, N and M. The task is to find XXX…(N times) % M where X can be any digitfrom the range [1,… Read More »

Given a string str. You are allowed to delete only some contiguous characters if all the characters are same in a single operation. The task… Read More »

Given a range [L, R], the task is to find the sum i * countDigits(i)2 for all i ∈ [L, R] where countDigits(i) is the… Read More »

Given a spirally sorted matrix with N * N elements and an integer X, the task is to find the position of this given integer… Read More »

Given k sorted arrays of different length, merge them into a single array such that the merged array is also sorted. Examples: Input : {{3,… Read More »

Given a range [L, R] where L ≤ R, the task is to generate a random permutation of the sequence [L, L + 1, L… Read More »

Giving k sorted arrays, each of size N, the task is to merge them into a single sorted array. Examples: Input: arr[][] = {{5, 7,… Read More »