Interesting that Amazon is using Hackerrank instead of AMCAT now. \n\nFirst question: \nexact same question as this one: https://leetcode.com/discuss/interview-question/1475585/Amazon-or-OA-or-Minimum-Coin-Flips\n\nSecond question: \nSimilar to this question but with some pretty big difference. \nhttps://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/\n\nThe amazon question is given an array of only 1s and 0s where you can only make adjacent swaps, return the min number of swaps required to have all 1s or 0s on one side. \n\nEg. [0, 1, 0, 1] would return 1 since it takes 1 swap to have it as [0, 0, 1, 1] which is the minimum. \n[1, 1, 0, 0] would be a valid array except it is not in the minimum as it would take 3 swaps. \n\nWould be interesting to see what people can come up with second one since I didn\'t manage to pass all test cases for second question. \n

Interesting that Amazon is using Hackerrank instead of AMCAT now. \n\nFirst question: \nexact same question as this one: https://leetcode.com/discuss/interview-