Courses
Tutorials
Practice

Similar Topics

Web Technologies37.4K+ articles

Misc8.8K+ articles

Mathematical7.8K+ articles

Arrays6.5K+ articles

Competitive Programming3.3K+ articles

Strings3.3K+ articles

Greedy2.1K+ articles

Algorithms2.0K+ articles

Sorting1.8K+ articles

Searching1.7K+ articles

DSA / Algorithms / Divide and Conquer

Divide and Conquer

278+ posts

Comparison among Greedy, Divide and Conquer and Dynamic Programming algorithm

Last Updated: 11 December 2024

Greedy algorithm, divide and conquer algorithm, and dynamic programming algorithm are three common algorithmic paradigms used to solve problems. Here's a comparison among ...read more

Dynamic Programming

Divide and Conquer

Technical Scripter

Technical Scripter 2022

Minimum time required by n cars to travel through all of the m roads

Last Updated: 22 March 2023

Given m roads and n cars. The cars are numbered from 1 to n. You are also given an array arr[] of size m, each road has a value arr[i] - the index of a car that runs fast ...read more

Divide and Conquer

Technical Scripter

Technical Scripter 2022

Update and Print for all the Query

Last Updated: 03 May 2023

Given an array arr[] of length N consisting of a positive integer, the task is to complete the Q queries and print values accordingly which consists of two types of operat...read more

Divide and Conquer

Binary Search Tree

Divide and Conquer definition & meaning in DSA

Last Updated: 11 April 2023

Divide and Conquer is a type of algorithm which involves breaking down a difficult problem into smaller subproblems, solving the subproblems individually and then merging ...read more

Divide and Conquer

Definitions and Meanings

C++ Program To Find Power Without Using Multiplication(*) And Division(/) Operators

Last Updated: 17 January 2023

Method 1 (Using Nested Loops):We can calculate power by using repeated addition. For example to calculate 5^6. 1) First 5 times add 5, we get 25. (5^2) 2) Then 5 times add...read more

Divide and Conquer

C++ Basic Programs

C++ Program For Binary Search

Last Updated: 14 October 2024

Binary Search is a popular searching algorithm which is used for finding the position of any given element in a sorted array. It is a type of interval searching algorithm ...read more

Divide and Conquer

Python Program for Find cubic root of a number

Last Updated: 27 July 2023

Given a number n, find the cube root of n.Examples:Input: n = 3Output: Cubic Root is 1.442250Input: n = 8Output: Cubic Root is 2.000000Recommended PracticeCube root of a ...read more

Divide and Conquer

Python Programs

Convex Hull Algorithm

Last Updated: 08 August 2024

The Convex Hull Algorithm is used to find the convex hull of a set of points in computational geometry. The convex hull is the smallest convex set that encloses all the po...read more

article_image

Divide and Conquer

Divide and Conquer Notes for GATE Exam [2024]

Last Updated: 28 April 2025

Those preparing for the GATE (Graduate Aptitude Test in Engineering) exam in 2024 face many algorithmic challenges. Among the various algorithmic paradigms, "Divide and Co...read more

article_image

Divide and Conquer

Divide and Conquer Algorithm

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 problems.Conquer : Solve Smaller Pr...read more

Divide and Conquer

Advantages and Disadvantages of Divide and Conquer Algorithms

Last Updated: 04 March 2024

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

Divide and Conquer

Algorithms-Divide and Conquer

Find the Closest Subsequence Sum to Target

Last Updated: 14 June 2024

Given an integer array arr[] and an integer target. The task is to find a subsequence of arr such that the absolute difference between the sum of its elements and target i...read more

Divide and Conquer

Interview-Questions

Search in row wise sorted matrix

Last Updated: 19 December 2024

Given a row-wise sorted matrixmat[][]and an integerx, the task is to check ifxis present inmat[][]or not. Note that there is no ordering among column elements.Examples:Inp...read more

Divide and Conquer

Search in matrix where only individual columns are sorted

Last Updated: 15 April 2025

Given an n * m semi-sorted 2D matrix, mat[][] where each column is individually sorted in ascending order but the rows are not sorted, and a target element x. The task is ...read more

Divide and Conquer

QuickSort Based Practice Problems

Last Updated: 15 November 2024

Problems based on Partitioning AlgorithmSorting an Array of Two Types.Stable Binary SortingStable Binary Sorting with O(1) SpaceThree Way Partitioning Around a RangeThree ...read more

Divide and Conquer

...