Loading the journal
LeetCodeThree-Way Partitioning / Two PointersSolved Nov 17, 2025
9 recent
Go step by step: try it yourself before the video and the visual. Progress saves on this device.
Community-reported · source · updated 2026-10-08. ● asked in the last 6 months.
Step 1
Know these before you start
Tick what you already know
Concept videoWatch the concept video if the pattern is new to you.
Step 2
Try it on paper
5–10 minutes, no code yet
Given an array nums with n objects colored red, white, or blue (represented by the integers 0, 1, and 2, respectively), sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white, and blue.
Step 6
Get it accepted
All test cases pass
Step 7
Review it so it sticks
Re-solve from memory after
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · solution code · optimal solution