Indeed Sdet (Software Development Engineer in Test) Interview Questions and Answers

There were 2 questions in coding one with array and in string releated

Q1. About Selenium questions
Add your answer
Q2. Other basic questions related to testing
Add your answer
Q3. Management related question
Add your answer

Q1. One program to solve
Add your answer
Q2. Other questions in selenium
Add your answer

2 question of DSA (easy, medium) in 60 minutes

Q1. Playlist Shuffle
Add your answer
Q2. Deletion in min heap
Ans. 
Deletion in min heap involves removing the root node and rearranging the heap to maintain the min heap property.
• To delete the root node in a min heap, swap it with the last node in the heap.

• Remove the last node and then heapify the heap starting from the root to maintain the min heap property.

• Example: If the min heap is [10, 20, 30, 25, 40], after deletion the heap becomes [20, 25, 30, 40].
Answered by AI
Add your answer

It was a leetcode medium, related BFS,

Q1. Basic of android like fragment activity communication
Add your answer
Q2. Why ViewModel is necessary, how does it save state
Ans. 
ViewModel is necessary in Android development to save and manage UI-related data during configuration changes.
• ViewModel helps in retaining data during configuration changes like screen rotations

• It separates UI-related data from UI controller (Activity/Fragment)

• ViewModel survives configuration changes and can be shared between fragments

• It helps in maintaining data consistency and prevents memory leaks

• ViewModel is lifecy...read more
Answered by AI
Add your answer

Hackerrank - 3 questions 2 hrs

Hackerrank test with medium questions

Q1. Machine coding round to design a shopping cart
Add your answer

3 Coding question, mix of easy medium and hard questions. Online proctored on Hackerrank

Q1. 1. A variation on 2 sum problem (based on number of digits) 2. Average of node value and its subtree (Count no of nodes where average of the subtree and the node itself equals to the node value). It was t...read more
Ans. 
2 sum problem variation based on number of digits and finding nodes where average of subtree and node value equals node value.
• For the 2 sum problem variation, use a hash table to store the digits and their indices.

• For the subtree problem, use a recursive function to traverse the tree and calculate the average.

• Examples: [1, 2, 3, 4, 5] with target 7 and tree with root 5, left child 4, right child 6, should return 2 and
Answered by AI
Add your answer

Q1. I was asked an LLD question about a system to manage and track cars and their maintenance. Also some questions based on run time polymorphism and SQL
Add your answer

Q1. Discussion with the CTO. You get to explain about the work you did and some clarifying questions.
Add your answer