## Interactive Problems in Competitive Programming

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 »

- Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
- Largest perfect square number in an Array
- Interactive Problems in Competitive Programming
- Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
- Search element in a Spirally sorted Matrix
- Minimum in an array which is first decreasing then increasing
- Minimum steps to delete a string by deleting substring comprising of same characters
- Maximum element in a sorted and rotated array
- Minimum K such that every substring of length atleast K contains a character c
- Search in a sorted 2D matrix (Stored in row major order)
- Generate a random permutation of elements from range [L, R] (Divide and Conquer)
- Largest number N which can be reduced to 0 in K steps
- Range and Update Sum Queries with Factorial
- Minimum number N such that total set bits of all numbers from 1 to N is at-least X
- Minimum operations of the given type required to make a complete graph
- Find element position in given monotonic sequence
- Numbers that are bitwise AND of at least one non-empty sub-array
- Sum of i * countDigits(i)^2 for all i in range [L, R]
- Lazy Propagation in Segment Tree | Set 2
- Find 2^(2^A) % B
- IntroSort or Introspective sort
- Find the value of XXXX.....(N times) % M where N is large

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,… Read More »

Given N vertex where N is even. Initially there is no edge between any of the vertices. You are allowed to perform operation as illustrated… Read More »

Given a number X, the task is to find the minimum number N such that total set bits of all numbers from 1 to n… Read More »