Both rounds of the interview had technical challenges around a Medium on HackerRank. First problem was about creating a DataStructure capable of handling insertions and deletions all in O(1) as well as having a function that returns a random element.
1. Coding Interview: - Least common ancestor of two nodes in binary tree - Account’s grouping based on related email -> Graph 2. Behavioural Interview. Talk about my role at previous company 3. Hiring Manager Interview - System Design: Design a Google Docs - Run through systems architecture at Previous company
Java data structure, leetcode medium DP question
Why did you choose our company?
Typical leetcode questions. Questions on arrays, string manipulation, and binary trees were asked
What are some bugs and potential improvements in the given code?
Tell me about yourself and a problem you had
Related to my resume and projects that I had worked on
What was the difficult situation have been into?
mostly questions asked about OOPs and networking
Viewing 7401 - 7410 interview questions