Magnet Sort
There is an array $A$ with $N$ elements. Each element of $A$ has a **fixed** *polarity*: either north or south. Chef is allowed to perform some (possibly zero) operations on the array $A$. In one operation, Chef can: - Pick some subarray of array $A$, such that, the **first** and **last** elements of the subarray have **different polarities**, and, rearrange the elements in this subarray any wa
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start