Cyclic-sort

First Missing Positive [Hard] — Cyclic Sort / Index Marking

Find the smallest missing positive integer in O(n) time O(1) space using in-place cyclic sort to place each number at its correct index.