First question
My first question was the same one this
https://leetcode.com/discuss/interview-question/1982251/amazon-oa-usa-sde2-minimum-swaps-to-make-a-binary-string-palindrome
I did not get it. The swaps don't need to be adjacent. I was able to get the palindrome part but my swap numbers were always bigger than expected (so not optimal).

Second Question
My 2nd question was the same as this
https://leetcode.com/discuss/interview-question/1594897/amazon-oa-questions-find-password-strength
I was also unable to answer this one. I tried to implement the solutions in Python. I tried translating some of the provided answers but none of them passed all the test cases.