Round 1
Questions: A is organising a party and A will invite his friends with the condition that his friends do not know each other. There is a direct edge from person1 to person2 if they are friends. How many persons can A invite at max? For example:
- A -> B
- A -> C
- A -> D
- B -> C
Here A can invite either [B, D] or [C, D], so the answer is 2.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions: Given a correctly parenthesized string, every second first character is getting removed and there are m ways to balance the whole string again. You need to keep doing the same operation until the string becomes empty. For example:
- Input: (())
- After the first round, it will be ()) -> so you can remove any two ) (the second or third one). So there are two ways, then you will get (), after removing it will become ), then only one way. So total 2 * 1 ways.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions: Design a deployment system.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.