Telephonic: Given a binary tree of numbers and a search number has given, find out first occurence of that number and smallest distance from root node. if you have given k search numbers find their occurence and nearest from root node in a single walk.
Where you from?
1.Problem solving Arrays 2.Trees (Data Structures)
basic java.j2ee question
Data structure and algorithms
NDA. Leetcode. They are looking for your thought process more than the correctness of your solution (Like a Google Style'd interview I'd say). The interviewers were super friendly and they made sure I'm feeling good. Telephonic: 1 Telephonic 1 RPT (Remote programming test / Hackerrank) Onsite: 1 Graph Problem 1 Tree Problem (Refer to underscore library implementation) Prototypes and fundamentals in JavaScript 1 CSS Interview Digging into Positions, Display, and Flexbox. 1 Testing & Culture interview.
Questions related to current and past projects
Question are medium level from leetcode.
Based on your resume majorly an out of that grilling on your techincal Expertise. Process and AGILE Questions.
1 Depth First Search based question
Viewing 21 - 30 interview questions