Round 1
Questions:
- Solved a problem similar to: Painting the Walls
- Another problem based on graphs: Given a graph and a list of queries (queries will be in the form of arrays like {a, b, c, d}, we will have an array of arrays like this which are queries). If the query is a valid BFS, return 1, otherwise return 0.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Given a dictionary of words and a misspelled word, you can either insert, delete, or replace the characters in the word. Return k closest dictionary words to the given misspelled word.
- System Design: Design a Flight Booking system.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.