Tutorials
Courses

Similar Topics

Web Technologies32.1K+ articles

DSA20.0K+ articles

Mathematical5.1K+ articles

Arrays4.2K+ articles

Amazon1.8K+ articles

Sorting1.1K+ articles

Searching1.0K+ articles

Matrix744+ articles

Recursion591+ articles

Binary Search529+ articles

DSA / Algorithms / Divide and Conquer

Divide and Conquer

143+ posts

Maximize partitions that if sorted individually makes the whole Array sorted

Last Updated: 27 March 2025

Given an array arr[]. The task is to divide arr[] into the maximum number of partitions, such that, those partitions if sorted individually make the whole array sorted.Exa...read more

Divide and Conquer

Maximize sum of minimum and maximum of all groups in distribution

Last Updated: 28 January 2022

Given an array arr[], and an integer N. The task is to maximize the sum of minimum and maximum of each group in a distribution of the array elements in N groups where the ...read more

article_image

Divide and Conquer

Find maximum pairwise sum in Linked List that are equidistant from front and back

Last Updated: 09 March 2023

Given a linked list lis of length N, where N is even. The task is to maximize the sum of two equidistant nodes from the front and back ends of the given linked list.Note: ...read more

Divide and Conquer

Count of ways to choose 4 unique position elements one from each Array to make sum at most K

Last Updated: 12 November 2023

Given four arrays A[], B[], C[], D[] and an integer K. The task is to find the number of combinations of four unique indices p, q, r, s such that A[p] + B[q] + C[r] + D[s]...read more

Divide and Conquer

Geeks Premier League

Geeks-Premier-League-2022

Reduce given Array by replacing adjacent elements with their difference

Last Updated: 21 October 2022

Given an array arr[] consisting of N elements(such that N = 2k for some k ? 0), the task is to reduce the array and find the last remaining element after merging all eleme...read more

Divide and Conquer

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

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: 06 July 2025

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

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

...