LEETCODE (75) in Java | Array Medium | SORT COLORS

In this video, we solve the popular LeetCode (75) -
Sort Colors problem using the efficient Dutch National Flag algorithm.

👨‍💻 Problem Statement:
Given an array nums containing 0 (red), 1 (white), and 2 (blue), sort them so that same colors are adjacent in the order red, white, and blue. Do this without using any library sort function.

💡 Approach Used:
One-pass
Constant space
Efficient in-place sorting with three pointers (low, mid, high)

Time Complexity: O(n)
Space Complexity: O(1)

📚 Topics Covered:

Arrays
Two Pointers
In-place Sorting
Dutch National Flag Problem

#array #leetcode #programming #coding #datastructure #engineering #java