Divide and Conquer Algorithm | Master Algorithms in 7 Days | Day 3 | FACE Prep's #WeekOfCode

In this video, we'll discuss the Divide & conquer algorithm. This video is part of FACE Prep's Week Of Code - Mastering Algorithms.

What is Week of Code?
FACE Prep's Week of Code is a 7-day event wherein you'll spend around 30 mins every day learning concepts of programming/coding.

********Today's Playground***********

Here's the schedule of this 7-day event.
Day 1 (30 April):
Thinking Recursively

Day 2 (1 May):
Dynamic Programming

Day 3 (2 May):
Divide & Conquer Methods

Day 4 (4 May): Greedy Method/Strategy

Day 5 (5 May):
Backtracking Method

Day 6 (6 May):
Branch and Bound Method

Day 7 (7 May):
Playground Solutions Discussion and More

Do like and share this video. Post all your questions in the comments below.

Check out the ProGrad Data Structures & Algorithms Bootcamp here:

One-stop placement prep:

More on Algorithms:

More on Data Structures:

[KishoreKumar-pfku]

This is easily one of the most underrated videos on Divide and Conquer. I was shocked to see it has only 8k views. This is gold.

[ahmedmimo]

in the max part of maxSubArray, why do we have to calculate maxleft and maxright when it will be eventually divided to be only one number?

[satishshingade]

where were you i struggled a lot understanding dynamic programming and now divide and con...please upload similar kind of videos

[balus]

Sir in left array (-1, 4, -3, 3, -3, -2)

We can only choose 4 as subarray that is the max 4 in this array, but if calculate from end it will give -1 .pls clarify this doubts sir

[mk-mltn]

Can u explain how the former approach have complexity O(n)

[satishsr]

in python, recursion depth exceeding error coming

[tvrao]

stair case, house robber, minimum cost path problems are explained by many resource perosns in youtube, including me, bored of listening to them, chose some new problems to create interest