Minimum Number Of Swaps

Given an integer array, you need to swap the smallest number to the front of the array a[0], and swap the largest number to the end of the array a[n-1]...

Solve the problem:
def minNumberOfSwaps(arr): """ :type arr: List[int] :rtype: int """

Get one-to-one training from Google Facebook engineers

Top-notch Professionals

Learn from Facebook and Google senior engineers interviewed 100+ candidates.
Most recent interview questions and system design topics gathered from aonecode alumnus.
One-to-one online classes. Get feedbacks from real interviewers.

Customized Private Class

Already a coding expert? - Advance straight to hard interview topics of your interest.
New to the ground? - Develop basic coding skills with your own designated mentor.
Days before interview? - Focus on most important problems in target company question bank.