← BNY Mellon questions
CodingReported in a candidate post, Apr 2022

Minimum moves to sort array

Filed under BNY Mellon

Given an array of distinct integers, find the minimum number of moves required to sort the array in ascending order if a single move consists of picking any element and placing it at the end of the…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related BNY Mellon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.