Divide and Conquer

260+ posts

Last Updated: 15 November 2024

Divide and Conquer algorithm is a problem-solving strategy that involves. Divide : Break the given problem into smaller non-overlapping prob...read more

Divide and Conquer

DSA

Binary Search In JavaScript

Last Updated: 10 January 2025

Binary Search is a searching technique that works on the Divide and Conquer approach. It is used to search for any element in a sorted array ...read more

Technical Scripter 2018

DSA

Advanced master theorem for divide and conquer recurrences

Last Updated: 15 February 2023

The Master Theorem is a tool used to solve recurrence relations that arise in the analysis of divide-and-conquer algorithms. The Master Theo...read more

Analysis of Algorithms

Similar Topics

DSA

22.5k+ articles

Mathematical

7.7k+ articles

Arrays

6.4k+ articles

Competitive Programming

2.3k+ articles

Algorithms

2k+ articles

Sorting

1.7k+ articles

Searching

1.7k+ articles

Dynamic Programming

1.5k+ articles

Recursion

1k+ articles

Binary Search

510+ articles

Find closest number in Sorted array

Last Updated: 07 January 2025

Given an array arr[] of sorted integers of size n. We need to find the closest value to the given number k. Array may contain duplicate valu ...read more

The Painter's Partition Problem

Last Updated: 29 April 2025

Given an array arr[] and k, where the array represents the boards and each element of the given array represents the length of each board. k ...read more

Competitive Programming

DSA

K-th Element of Merged Two Sorted Arrays

Last Updated: 03 March 2025

Given two sorted arrays of sizes m and n respectively, the task is to find the element that would be at the k-th position in the final sorte...read more

Allocate Minimum Pages

Last Updated: 09 December 2024

Given an arrayarr[]and an integerk,wherearr[i]denotes the number of pages of a book and k denotes total number of students.All the books nee...read more

Rotation Count in a Rotated Sorted array

Last Updated: 09 October 2024

Given an array arr[] having distinct numbers sorted in increasing order and the array has been right rotated (i.e, the last element will be ...read more

Modular Exponentiation (Power in Modular Arithmetic)

Last Updated: 17 February 2025

Modular Exponentiation is the process of computing: xy (mod p). where x, y, and p are integers. It efficiently calculates the remainder ...read more

Program for Square Root of Integer

Last Updated: 14 February 2025

Given a positive integer n, find its square root. If n is not a perfect square, then return floor of √n.Examples :Input: n = 4Output: 2Exp...read more

Iterative Tower of Hanoi

Last Updated: 21 March 2025

The Tower of Hanoi is a mathematical puzzle with three poles and stacked disks of different sizes. The goal is to move all disks from the so...read more

Stack

Divide and Conquer

DSA

Minimum in a Sorted and Rotated Array

Last Updated: 13 December 2024

Given a sorted array of distinct elements arr[] of size n that is rotated at some unknown point, the task is to find the minimum element in ...read more

Karatsuba algorithm for fast multiplication using Divide and Conquer algorithm

Last Updated: 06 August 2024

Given two binary strings that represent value of two integers, find the product of two strings. For example, if the first bit string is "110...read more

Strings

Divide and Conquer

DSA

Maximum Subarray Sum using Divide and Conquer algorithm

Last Updated: 24 December 2024

Given an arrayarr[],the task is to find the subarray that has the maximum sum and return its sum.Examples:Input: arr[] = [2, 3, -8, 7, -1, 2 ...read more

Median of two sorted arrays of same size

Last Updated: 02 January 2025

Given 2 sorted arrays a[] and b[], each of size n, the task is to find the median of the array obtained after merging a[] and b[]. Note: Sin...read more

statistical-algorithms

1 2 3 4 5 6 7 8 >>

1 2 3 4 5 6 >>

1 2 3 4 >>