1) **6 multiple choice questions** - were supposed to be simple but 1 or 2 had a frustrating lack of details which led to guess-work\n2)  **3 coding questions** -\n\ta) Same as https://leetcode.com/problems/rearrange-words-in-a-sentence/ \n\tb) Given an expression consisting of \'<\'s and \'>\'s and also given that \'>\' can be replaced by \'<>\', return whether the expression can be balanced in at most k replacements (balanced means every \'<\' is matched by a \'>\' and a \'>\' matches the most recent \'<\').\n\tExample:\n\t"<><>", k = 2: return true since the expression is already balanced.\n\t"<>>", k = 1: return true since the last \'>\' can be replaced by a \'<>\' thus making the expression balanced.\n\t">><>", k= 1: return false since the first two \'>\'s should be replaced by \'<>\' i.e. 2 replacements are needed but k is only 1.\n\t">><", k=50: return false since this expression can never be balanced as \'<\'s are not replaceable and hence will never be matched.\n3) Same as https://leetcode.com/discuss/interview-question/278341/Uber-phone-interview-Number-of-distinct-subarrays-with-at-most-k-odd-elements/ (Note that the question does specify **distinct** so it is not similar to [this](http://https://www.***.org/number-subarrays-m-odd-numbers/).

1) 6 multiple choice questions - were supposed to be simple but 1 or 2 had a frustrating lack of details which led to guess-work\n2)  3 coding questions -\n\ta)