Spotnana Senior Engineering Manager Interview Questions and Answers

Q1. Based on core concepts of JavaScript and React fundamentals.
Add your answer

Q1. Advance topics of React and JavaScript and easy and medium level of DS algo
Add your answer

Q1. More like technical discussion on services that helps them to manage their product and problem solving if discussion not go long.
Add your answer

Q1. Compensation and others formalities
Add your answer

Q1. Internal Working Of Hashmap, Java 8 features and two DSA questions one was based on the array and the second one was based on LinkedList. The first interview round was very excellent that's why they conduc...read more
Add your answer
Q2. Detect loop in a LinkedList,
Ans. 
Detect loop in a LinkedList
• Use two pointers, one moving at twice the speed of the other

• If there is a loop, the faster pointer will eventually catch up to the slower one

• If there is no loop, the faster pointer will reach the end of the list
Answered by AI
Add your answer

Q1. System Design HLD and LLD round which was the final round.
Add your answer
Q2. HLD and LLD Designing round: Desing Architecture for ChatBot and Company Employee Data Management System.
Add your answer

Q1. Basic js question closure, async defer and all
Add your answer
Q2. Create autosuggest debounce, pollyfill
Ans. 
Autosuggest debounce is a feature that delays the search suggestions until the user stops typing, and a polyfill is a piece of code that provides functionality that is not natively supported by the browser.
• Implement a debounce function to delay the autosuggest feature until the user stops typing.

• Use a polyfill to provide support for the autosuggest feature in browsers that do not natively support it.

• Example: Implement ...read more
Answered by AI
Add your answer

Q1. A programming question
Add your answer
Q2. React-native architecture and flatlist
Add your answer
Q3. Kadanes algorithm
Ans. 
Kadane's algorithm is used to find the maximum subarray sum in an array of integers.
• Iterate through the array and keep track of the maximum sum ending at each index.

• At each index, choose between extending the previous subarray or starting a new subarray.

• Example: For array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum subarray sum is 6 (from index 3 to 6).
Answered by AI
Add your answer
Q4. Scalablity, performance
Add your answer

Q1. Android activity lifecycle
Add your answer
Q2. Android MVVM architecture
Add your answer

It was a ideal machine coding round. Consisting of a question to be completed within 45 mins. For a given manager to employee hierarchy, count direct + indirect repartees.

Q1. Print the nodes of a n-ary tree in an arc wise manner as seen from the outside.
Ans. 
Print nodes of n-ary tree in arc wise manner from outside
• Traverse the tree level by level from outside to inside

• Use a queue to keep track of nodes at each level

• Print the nodes at each level in a clockwise or anticlockwise manner
Answered by AI
Add your answer

Mostly DSA expect DP, graph problems

Q1. Graph traversal + DP
Add your answer