Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Misc7.7K+ articles

Strings2.1K+ articles

Binary Search530+ articles

subsequence434+ articles

Divide and Conquer143+ articles

Algorithms-Searching29+ articles

Ternary Search12+ articles

In-house+ articles

Algorithms-Divide and Conquer

9 posts

Divide and Conquer Interview Questions

Last Updated: 05 September 2025

Divide and Conquer (DC) is a problem-solving paradigm where a problem is broken into smaller independent subproblems, solved recursively, and combined to form the final so...read more

Algorithms-Divide and Conquer

Advantages and Disadvantages of Divide and Conquer Algorithms

Last Updated: 23 July 2025

Divide and Conquer is an algorithmic paradigm in which the problem is solved using the Divide, Conquer, and Combine strategy.A typical divide-and-conquer algorithm solves ...read more

article_image

Algorithms-Divide and Conquer

Rearrange Even and Odd Index Elements in K Operations

Last Updated: 23 July 2025

Given an array arr[] of size N (N is even) and a positive integer K, the task is to apply an operation to the array arr[] for K times. Applying the operation once will shi...read more

Algorithms-Divide and Conquer

Binary Exponentiation

Finding Minimum Time for Workers to Meet at a Point

Last Updated: 23 July 2025

Given N workers standing on a road of infinite length and two arrays point[] and time[] each of size N, such that point[i] is point where the ith worker is standing and ti...read more

Algorithms-Divide and Conquer

Algorithms-Searching

Minimizing Distance Between Two Walkers

Last Updated: 23 July 2025

Given the starting and ending coordinates of path of two persons, the task is to find the minimum distance between the persons at any point of time. The first persons walk...read more

article_image

Algorithms-Divide and Conquer

Algorithms-Searching

Minimizing Maximum Absolute Subarray Sums

Last Updated: 23 July 2025

Given an array arr[] of size N, we can choose any real number X which when subtracted from all the elements of the array then the maximum absolute subarray sum among all t...read more

Algorithms-Divide and Conquer

Algorithms-Searching

Minimize the Maximum Distance between runners

Last Updated: 23 July 2025

Given two arrays dist[] and speed[] of size N (number of runners) and a positive integer T (duration of a race), where dist[i], speed[i] indicating the initial distance an...read more

Algorithms-Divide and Conquer

Algorithms-Searching

Minimize count of alternating subsequences to divide given Binary String with subsequence number

Last Updated: 23 July 2025

Given a binary string S of length N. The task is to find the following:The minimum number of subsequences, string S can be divided into, such that the subsequence does not...read more

Divide and Conquer

Algorithms-Divide and Conquer

Search for an element in a Mountain Array

Last Updated: 23 July 2025

Given a mountain array arr[] and an integer X, the task is to find the smallest index of X in the given array. If no such index is found, print -1.Examples:Input: arr = {1...read more

Algorithms-Divide and Conquer