Quick sort series - II | Problems solved using quick sort logic | Coders Camp

Hello Everyone. As my article on "How quick sort works and the problem that can be solved using partition login" in LeetCode has got good response, I planned to do a series of videos on the same.

This video explains solution for three easy level problems that uses the logic of quick sort to run in linear time.
1. Sort Binary Array
2. Separate Negative and positive numbers
3. Rearrange positive and negative numbers

Code:
Separate Negative and Positive numbers:
Rearrange positive and negative numbers:

Upcoming videos will have more problems that can be solved using partition method.