## Search in a sorted 2D matrix (Stored in row major order)

Given an integer ‘K’ and a row-wise sorted 2-D Matrix i.e. the matrix has the following properties: Integers in each row are sorted from left… 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
- Count the triplets such that A[i] < B[j] < C[k]
- Minimum steps to delete a string by deleting substring comprising of same characters
- Maximum Sum SubArray using Divide and Conquer | Set 2
- Lazy Propagation in Segment Tree | Set 2
- Find minimum steps required to reach the end of a matrix | Set - 1
- Sum of maximum of all subarrays | Divide and Conquer
- Generate a random permutation of elements from range [L, R] (Divide and Conquer)
- Find minimum steps required to reach the end of a matrix | Set 2
- IntroSort or Introspective sort
- Largest number N which can be reduced to 0 in K steps
- Kth smallest element in the array using constant space when array can't be modified
- Complexity Analysis of Binary Search
- Find 2^(2^A) % B
- Find the number of different numbers in the array after applying the given operation q times
- Find the value of XXXX.....(N times) % M where N is large
- Sum of i * countDigits(i)^2 for all i in range [L, R]
- Cost Based Tower of Hanoi
- Cartesian tree from inorder traversal | Segment Tree

Given an integer ‘K’ and a row-wise sorted 2-D Matrix i.e. the matrix has the following properties: Integers in each row are sorted from left… Read More »

Given an array ‘arr’, the task is to find all possible integers each of which is the bitwise AND of at least one non-empty sub-array… Read More »

Pre-requisites: Segment Tree Given an array of digits arr[]. Given a number of range [L, R] and a digit X with each range. The task… Read More »

Given an sorted array of positive numbers our tasks is to find the kth smallest sum of continuous subarray. Examples: Input : a[] = {1,… Read More »

Binary Search is searching technique which works on Divide and Conquer approach. It used to search any element in a sorted array. As compared to… Read More »

We are given a recursive function that describes Nth terms in form of other terms. In this article we have taken specific example. Now you… Read More »

Binary Search is a technique used to search element in a sorted list. In this article, we will looking at library functions to do Binary… Read More »

Prerequisite :Merge Sort and Quick Sort Quick sort is an internal algorithm which is based on divide and conquer strategy. In this: The array of… Read More »

Given two numbers and . The task is to find the number of ways in which a can be represented by a set such that… Read More »

TL;DR In this article I’m trying to explain the difference/similarities between dynamic programing and divide and conquer approaches based on two examples: binary search and… Read More »

Given N rods of different lengths. The task is to cut all the rods with some maximum integer height ‘h’ such that sum of cut-off… Read More »

Given a list of n-1 integers and these integers are in the range of 1 to n. There are no duplicates in list. One of… Read More »

Given a sorted array and a target value, find the first element that is strictly smaller than given element. Examples: Input : arr[] = {1,… Read More »

Given a sorted array and a target value, find the first element that is strictly greater than given element. Examples: Input : arr[] = {1,… Read More »

Given three numbers a, b and c, we need to find (ab) % c Now why do “% c” after exponentiation, because ab will be… Read More »