Update: Just done with the OA. I was able to solve both questions. Question 1: Minimum number of swaps required to make binary string a palindrome Luckily I had seen the question previously while browsing Amazon OA questions (Discussion link ) Question 2: Question Image I was able to come up with a sliding window approach, this took me 1 hour to finish but I passed all the test cases.