## Complexity Analysis of Binary Search

Complexities like O(1) and O(n) are simple to understand. O(1) means it requires constant time to perform operations like to reach an element in constant… Read More »

- Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
- Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
- Maximum element in a sorted and rotated array
- Interactive Problems in Competitive Programming
- Search element in a Spirally sorted Matrix
- Minimum steps to delete a string by deleting substring comprising of same characters
- Minimum in an array which is first decreasing then increasing
- Count the triplets such that A[i] < B[j] < C[k]
- Minimum K such that every substring of length atleast K contains a character c
- Maximum Sum SubArray using Divide and Conquer | Set 2
- Generate a random permutation of elements from range [L, R] (Divide and Conquer)
- Lazy Propagation in Segment Tree | Set 2
- Largest number N which can be reduced to 0 in K steps
- IntroSort or Introspective sort
- Sum of maximum of all subarrays | Divide and Conquer
- Minimum number N such that total set bits of all numbers from 1 to N is at-least X
- Find minimum steps required to reach the end of a matrix | Set - 1
- Minimum operations of the given type required to make a complete graph
- Find minimum steps required to reach the end of a matrix | Set 2
- Find 2^(2^A) % B
- Sum of i * countDigits(i)^2 for all i in range [L, R]
- Find the value of XXXX.....(N times) % M where N is large
- Find the number of different numbers in the array after applying the given operation q times
- Complexity Analysis of Binary Search

Complexities like O(1) and O(n) are simple to understand. O(1) means it requires constant time to perform operations like to reach an element in constant… Read More »

Given an array arr[] of length N, the task is to find the sum of the maximum elements of every possible sub-array of the array.… 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 a 2d-matrix consisting of positive integers, the task is to find the minimum number of steps required to reach the end of the matrix.… Read More »

Given a 2d-matrix consisting of positive integers, the task is to find the minimum number of steps required to reach the end(leftmost-bottom cell) of the… Read More »

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 »