Round - 1 Q1 - I was asked a question of arrays mixed with sliding window. I discussed the approach and coded the solution. It followed by one quick question that if negative numbers were allowed, will the solution work or not. Q2 - Serialize and deserialize a binary tree. We discussed various approaches before coding and coded the most optimal one (Both from Time and space perspective).
Asked about my projects and experience. Asked about Java and Spring internals
Describe some linux commands you'd use to diagnose poor performance on a running server. What are the key components of cloud computing?
Phone screen: Invert a binary tree Describe the difference between a process and a thread.
There were a total of 5 rounds: HackerRank OA: This round consisted of two LeetCode medium-level DSA questions. Problem-Solving JS Round: I was asked to write code for an LRU cache and answer some JavaScript questions. Problem-Solving JS Round: I was required to write code for deep cloning and create a polyfill for promises. Machine Coding: In this round, I had to implement a to-do app with search, filter, and complete functionality. Techno Manager Round: This round included a lot of behavioral questions and some technical questions.
Coding problems, basic Linux commands, networking, and also other technical topics relevant to the role.
Leetcode - Tries, Binary Search. Tries - string match. Time and space complexity Code parallelization Techniques. Substring questions
OS fundamentals About projects and previous exp
Q: what is your salary expectation?
dsa and design
Viewing 3351 - 3360 interview questions