Question

Amazon | OA | SDE-Internship | Coding Questions and Solutions | 2022 | Set-114

Answer 1

solution

def countMovesToLeft(nums, target):
    count = 0
    last = 0
    for i in range(len(nums)):
        if nums[i] == target:
            count += i - last
            last += 1
    return count
        
return min(countMovesToLeft(nums, 1), countMovesToLeft(nums, 0))

Answer 2

Sort 1's and 0's in array to the end. Either end is fine.
Find the minimum number of adjacent swaps required to sort.

Input:
[1,1,1,0,0,0]

output:
0
Input:
[0,0,0,1,1,1]

output:
0
Input:
[0,0,0,0,1,0,1,0,0]

output:
5
Input:
[0,0,1,0,1,0]

output:
3