Divide and Conquer

The idea of Divide and Conquer is that if your enemy is more powerful than you, you should divide your enemy into parts that you can conquer easily. DAC solves a very big task or a problem by breaking it into smaller sub-tasks or sub-problems; after solving, we combine all the sub-tasks in a specific manner to get the result for the big task...

Introduction to the Divide and Conquer Algorithm

By Akshat Chaturvedi

● Published At Oct 2021

In this blog post, we’ll learn one very interesting and equally important algorithm in Data Structures. We’ll understand the idea behind the Divide and Conquer in depth.... Keep reading ..

Fast Fourier Transform for polynomial multiplication

By Yukti Kumari

● Published At Nov 2021

This article explains the idea of fast fourier transform for polynomial multiplication.
... Keep reading ..

Fibonacci numbers

By Sneha Mallik

● Published At Oct 2021

This blog covers the concepts of fibonacci numbers, the matrix multiplication in fibonacci numbers and the golden ratio approach to find the Nth fibonacci number.... Keep reading ..

Tiling Problem using Divide and Conquer algorithm

By Shreya Deep

● Published At May 2022

In this article, we will learn how to solve the tiling problem using divide and conquer algorithm.... Keep reading ..

Check if a number is a palindrome or not without using any extra space.

By Sandeep kamila

● Published At Dec 2021

This article covers the approach to check if a number is a palindrome or not without using any extra space with its C++ code.... Keep reading ..

Check if the array can be split into subarrays such that the XOR of the length of the Longest Decreasing Subsequences of those subarrays is 0

By Vibhor Bhatnagar

● Published At Jan 2022

In this article, we will discuss the problem to check if the array can be split into subarrays such that the XOR of the length of the Longest Decreasing Subsequences of those subarrays is 0... Keep reading ..

Count the number of inversions in an array using merge sort

By Sandeep kamila

● Published At Jan 2022

This article discusses the approach to count the number of inversions in an array using merge sort with its C++ code.... Keep reading ..

Reduce array to longest sorted array possible by removing either half of given array in each operation

By Harsh Goyal

● Published At Jan 2022

This article will discuss to reduce the array to the longest sorted array possible by removing either half of the given array in each operation and the way to solve this problem.... Keep reading ..

Merge two sorted arrays in O(1) extra space using QuickSort partition

By Urwashi Priya

● Published At Jan 2022

This article will brief you on how to Merge two sorted arrays in O(1) extra space using QuickSort partition.... Keep reading ..

Koko Eating Bananas

By Yogesh Kumar

● Published At Dec 2021

In this blog, we will solve one of the problems of the Leetcode in a naive approach to optimized one.
... Keep reading ..

Count Negative Numbers in a Sorted Matrix

By Debarati Ghatak

● Published At Oct 2021

In this blog, we will discuss four different solutions for the problem “Count Negative Numbers in a Sorted Matrix.”
... Keep reading ..

How to find the minimum capacity of the ship to ship packages within d days.

By Gorakhnath yadav

● Published At Oct 2021

This blog focuses on the solution to the problem of finding the minimum capacity of the ship to ship packages in d days. Read further to learn the detailed solution.... Keep reading ..

Sum of middle elements of two sorted arrays

By Harsh Goyal

● Published At Dec 2021

This article will discuss the Sum of middle elements of two sorted arrays problem and various ways to solve this problem, starting from the brute force approach to the efficient approach.... Keep reading ..

Longest Substring with At Least K Repeating Characters

By aniket verma

● Published At Dec 2021

This article will brief you on finding the Longest Substring with At Least K Repeating Characters.... Keep reading ..

Median of Two Sorted Arrays

By Raksha Jain

● Published At Feb 2022

The blog discusses in detail the median of two sorted arrays. We’ll discuss many approaches to solve the problem along with time and space complexity for each method.... Keep reading ..

Longest Common Prefix using Divide and Conquer Algorithm

By Malay Gain

● Published At Jan 2022

In this article, we will learn how to find Longest Common Prefix using the Divide and Conquer Algorithm.
... Keep reading ..

## Top Problems related to Divide and Conquer

Count Inversions

Rearrange Array Numbers to form Largest Possible Number

Normal BST To Balanced BST

Median of two sorted arrays

Largest rectangle in a histogram

Kth Element of Two Sorted Arrays

Reverse Pairs

Similar Strings

TEEN PATTI

Binomial Coefficient Problem

WRONG TURN

Create a binary tree from postorder and preorder traversal

Construct Quad Tree

Count Of Range Sum

ABSOLUTE NINJA

Ninja Competition

Matrix Exponentiation

Ninja Land

Tree Queries

Longest Common Prefix