1) Home assignment: A data structure question in an Android application. Very close to a real-life scenario. 2) Technical Excellence: Walkthrough on the home assignment, questions around the solution with 3 engineers. 3) Skills Technical Round: Talking around Android programming, incident handling, and implementing a mobile system design with 2 engineers. 4) Talking around agile working, team, and communication with a manager.
online assessment: multiple choices, code correction, etc. Virtual onsite: behavioral question, algorithm and system design.
Question 4: Given a tree, where each node holds an integer value, find if there exists a path from the root node to a leaf node that equals a given sum.
Why did you choose this project?
Had to solve 3 scenarios on the woven platform. Scenarios were real world
Lots of linked list questions
2 Algorithmic Questions 1 Database Question 1 Js Question
<3> on given a string "horse" as a function parameter it must return the string "rose" or convert that string to this. he specified that u can use add , remove, replace methods. similarly if we give the string "Take" it must return "Tap". ❓ Problem restated Input: a string (e.g. "horse"). Expected output: another string (e.g. "rose", "Tap"). Constraint: You can use operations like add, remove, replace.
<2> Can you try question 1 using an extra array
<4> lets say there are five kids, each kid would have scored some marks lets say [2,5,7,9,4]. now we have to give cookies to every kid. each kid must receive atleast one cookie. the kid with higher and higher marks must recieve more and more cookies compared to the other kids. the function must return the lowest (minimum) possible total number of cookies required to satisfy the condition. ❓ Problem restated Kids’ scores: [2, 5, 7, 9, 4]. Rules: Each kid must get at least 1 cookie. If one kid has higher marks than an adjacent kid, that kid must get more cookies. Goal: Minimize total cookies distributed.
Viewing 1111 - 1120 interview questions