Time: 100 minutes

Q1. Number of flips to make binary string alternate.
Given a binary string, that is it contains only 0s and 1s. We need to make this string a sequence of alternate characters by flipping some of the bits, our goal is to minimize the number of bits to be flipped.
Examples :

Input : str = “001”
Output : 1
Minimum number of flips required = 1
We can flip 1st bit from 0 to 1 

Input : str = “0001010111”
Output : 2
Minimum number of flips required = 2
We can flip 2nd bit from 0 to 1 and 9th 
bit from 1 to 0 to make alternate 
string “0101010101”.

Q2. "Smallest substring with each letter occurring both in uppercase and lowercase" Same as Q2 here: https://leetcode.com/discuss/interview-question/963586/Microsoft-or-OA-or-Codility/785106
Q3. https://leetcode.com/problems/maximal-network-rank/

Passed all of the online test cases for all 3 questions.
Result: Pass. Got the result after one week.