Q1. Minimum number of swaps required to make a binary string palindrome. Example of a binary string - "010101".

Q2. Find the password strength by calculating the sum of count of distinct characters in all the substrings of the password.