Update: Just finished the OA.

I was able to solve both questions.

Question 1: Minimum number of swaps required to make a binary string a palindrome. Luckily, I had seen this 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.

Update: Just finished the OA.

I was able to solve both questions.

Question 1: Minimum number of swaps required to make a binary string a palindrome

Luckily, I had seen this 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.