Minimum swaps for search
Filed under Nutanix
The question
Given an unsorted array and a search element, implement an algorithm to find the number of swaps required to reach the correct location.
No write-up yet. Related questions below have one.
Related Nutanix questions
Collected from public candidate posts and coding forums. Updated Nov 2026.