1. Find the least common ancestor (LCA) in a binary tree. Pointer from node to parent is NOT present. Design the tree node and write the method that returns the LCA 2. Given a circularly rotated array [3 5 6 7 8 -3 -1 -1 1 2] design an algorithm to find an element in an efficient way.
General questions about skills and interests
Do you know about garbage collection?
Phone Screening: Concepts of OOP Second Interview: Coding exercise about data structure Questions from Resume and previous work experience (Database, Normalization, Generics, Run Time Complexity, Stacks) Other behavioral questions (problems faced and approach to solve it)
1 round - first question was similar to activity selection problem. Where the meetings start and end times were given and we had to attend max meetings possible and return boolean array respectively. It was extended to scheduling minimum meeting rooms afterwards. 2 round - I had to design an application with certain features as asked by the interviewer. Then discussion went beyond designing to deployment and testing etc.
Interfaces in Java
They asked standard STAR format questions.
Core on .net and angular based questions
The first round: Why do I want to work there? What is my role at my current employer and what do I work on there? What experience do I have with Java and Linux? How comfortable am I with OOP? Second Round: TBD
Why QA Explain Object Oriented Programming
Viewing 1621 - 1630 interview questions