Giving back to the community\nMicrosot OTA Questions \n3 questions, 60 min time limit on Codelitiy \n\nQ1) Given a string of letters, continaing both uppercase and lowercase letters, return the number of different characters where all lowercase of that charecter appear before any uppercase letter \n\nEx : aaAbcCABBc\nHere the output is 2, a and b, c is not counted\n\nQ2) Given 2 balls Red and White, return the minum number of swaps required where we want to arrange all the red balls into consistent segment ( in one move, you can swap adjacent ones)\n\nEx: WRRWRW\nout: WRRRWW, function returns 2\n\nQ3) Given a String S representing positive digit containing n numbers, and given k ( number of moves), you can replace any number other then 5, return the maximun number possible within k moves\n\nEx: 165232, k=3 output: 565552\n\nCould\'nt solve the third one, as i ran out of time.

Giving back to the community\nMicrosot OTA Questions \n3 questions, 60 min time limit on Codelitiy \n\nQ1) Given a string of letters, continaing both uppercase 