Amazon Senior Sdet Engineer Interview Questions, Process, and Tips

Q1. Find string in array
Ans. 
Search for a specific string in an array of strings.
• Iterate through the array and compare each string with the target string.

• Use a loop to go through each element in the array and check for a match.

• Consider using built-in methods like indexOf() or includes() for efficient searching.

• Handle cases where the target string is not found in the array.
Answered by AI
Add your answer
Q2. Find string in array
Ans. 
Search for a specific string in an array of strings.
• Iterate through the array and compare each string with the target string.

• Use a loop to go through each element in the array and check for a match.

• Consider using built-in methods like indexOf or includes for efficient searching.
Answered by AI
Add your answer
Q3. Subarray in given array
Ans. 
Find all subarrays in a given array of strings
• Iterate through the array and consider each element as the starting point of a subarray

• For each starting point, iterate through the array to find all possible subarrays

• Store each subarray found in a separate list
Answered by AI
Add your answer
Q4. Stack for balance paranthesis
Ans. 
Use stack data structure to check for balanced parentheses in a string.
• Create an empty stack to store opening parentheses

• Iterate through the string and push opening parentheses onto the stack

• When encountering a closing parenthesis, pop from the stack and check if it matches the corresponding opening parenthesis

• If stack is empty at the end and all parentheses have been matched, the string is balanced
Answered by AI
Add your answer
Q5. Mean heap fo minimising the cost
Ans. 
A mean heap is a data structure that minimizes the cost of accessing the smallest element.
• Mean heap is a type of binary heap where the value of each node is less than or equal to the values of its children.

• It is useful for finding the minimum element quickly, as the root node always contains the smallest value.

• Insertion and deletion operations in a mean heap have a time complexity of O(log n).
Answered by AI
Add your answer

DSA medium level 2 question based on graph and recursion

Q1. DSA question on dynamic programming
Add your answer
Q2. Question on graph (topological sort)
Add your answer

Q1. Asking for my Hobbies
Add your answer
Q2. Ctc was discussed with me
Add your answer

Prime numbers usung sieve if erastothenesis