Split Sort | Codeforces 1863B Solution | Pinely Round 2 (Div. 1 + Div. 2) | English

In this video, I walk through the solution to problem B from Pinely Round 2 (Div. 1 + Div. 2) contest held on:
Contest link: codeforces.com...
Problem name: "Split Sort"
My Submission:
codeforces.com...
I explain the thought process and logic behind the solution and show how to implement it in code. Don't forget to like and subscribe for more coding content!
#codeforces #programming #coding #competitiveprogramming, #math, #sortings #greedy #code + solution, code + explanation, today codeforces contest solutions
Something else: / sreejithcoast

[@thesubtlesky]

at 4:53, if we take 3 as x then how permutation becomes 1 2 3 6 4 5, in the right we don't have to change the order why we have taken 3 before 6 4 5?

[@codingdynamo]

Thanks for pointing out, from 4:00 to 5:37, please refer the below example
For, 6 4 3 5 2 1
In,
Operation 1: we take 2 -> 1 | 6 4 3 5 2
Operation 2: we take 3 -> 1 2 | 6 4 3 5
Operation 3: we take 4 -> 1 2 3 | 6 4 5
Operation 4: we take 6 -> 1 2 3 4 5 6
So the illustration in 7:00 shows the numbers we need to take.

[@mdshajib2387]

I think sound is less volume

[@codingdynamo]

Sure, next time I will fix it.

[@theassassin5489]

thank you for the explanation

[@nikhilsingh3928]

jabarjasti ka solution

[@sujeetkumarmaurya8165]

your explanation is very easy😊

[@mdshajib2387]

Please next time provide high resulation video

[@codingdynamo]

Hi, TH-cam takes some time to process HD. Now resolution is increased. You can check now.

[@mdshajib2387]

@@codingdynamo Thank you..Your explanation is very nice.