- Coding ( 5 questions ) - Given an mathematical expression in a String find missing digits - `123?5 * 23 = 2345?23` - Here `A * B = C` and missing digits will always be in A and C - There will be only one digit and always be an unique solution - Given a level-order traversal of tree where NULL nodes are represented as #, return `preOrder` traversal of that tree - Given roman Representation, find the smallest representation (HARD) - LL -> 100 - Output: C -> 100