There were 4 questions to be completed in 75 minutes.

1. https://leetcode.com/discuss/interview-question/989768/amazon-oa-2020-transaction-logs
2. https://leetcode.com/problems/maximal-square/
3. https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/
4. String Reduction : Given a string , reduce string such that all of its substrings are distinct.
   Eg : s = "abab" substr = { a , b , ab , ba , aba , bab , abab }.
   output : Delete one 'a' and one 'b' - > return 2

I was able to solve all 4 of them.