Turvo Associate Quality Engineer Interview Questions and Answers

Round duration - 120 minutes
Round difficulty - Medium

Due to pandemic placement process went virtual. Test was conducted at 10 A.M.

Q1. 
Decode String Problem Statement
Your task is to decode a given encoded string back to its original form.
Explanation:
An encoded string format is <count>[encoded_string], where the 'encoded_string...read more
Ans. 
The task is to decode an encoded string back to its original form by repeating the encoded string 'count' times.
• Parse the input string to extract the count and the encoded string within the brackets

• Use recursion to decode the encoded string by repeating it 'count' times

• Handle nested encoded strings by recursively decoding them

• Output the decoded string for each test case
Answered by AI
Add your answer
Q2. 
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...read more
Ans. 
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
• Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

• Once the loop is detected, use two pointers approach to find the start of the loop.

• Adjust the pointers to remove the loop and return the modified linked list.

• Example: For input 5 2 and 1 2 3 4 5, output should be 1 2 3 4 5.
Answered by AI
Add your answer
Q3. 
Infix to Postfix Conversion
You are provided with a string EXP which represents a valid infix expression. Your task is to convert this given infix expression into a postfix expression.
Explanation:
An i...read more
Ans. 
Convert a given infix expression to postfix expression.
• Use a stack to keep track of operators and operands.

• Follow the rules of precedence for operators (*, / have higher precedence than +, -).

• Handle parentheses by pushing them onto the stack and popping when closing parenthesis is encountered.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Due to pandemic placement process went virtual. Test was conducted at 2 P.M.

Q1. 
Find First Repeated Character in a String
Given a string 'STR' composed of lowercase English letters, identify the character that repeats first in terms of its initial occurrence.
Example:
Input:
STR =...read more
Ans. 
The task is to find the first repeated character in a given string of lowercase English letters.
• Iterate through the string and keep track of characters seen so far in a set.

• If a character is already in the set, return it as the first repeated character.

• If no repeated character is found, return '%'.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Video Call interview where the interview happened for around 45 minutes.

Q1. 
Maximum Sum Path in a Binary Tree Problem Statement
You are provided with a binary tree consisting of N nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...read more
Ans. 
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
• Traverse the binary tree to find all possible paths and calculate their sums.

• Keep track of the maximum sum encountered during traversal.

• Consider paths that may include the same node twice.

• Implement a recursive function to explore all paths in the tree.

• Optimize the solution to avoid redundant calculations.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Video Call interview where the interview happened for around 30 minutes.

Assignment to develop a prototype

Q1. Face to face questions
Add your answer
Q2. Java Question Technical & coding
Add your answer
Q3. Mongodb & Mysql Question
Add your answer

Will be given Requirement to write code for Restraunt. Based on that have write code for delivering orders by delivery boys.

Q1. OOPS Concepts, Java Basics, Collections, MultiThreading
Add your answer

Q1. Shortest path sum with negative integers allowed in matrix. Path starts from top left to bottom right.
Ans. 
Use dynamic programming to find the shortest path sum with negative integers allowed in a matrix.
• Implement dynamic programming to store the minimum sum at each cell

• Consider negative integers when calculating the sum of the path

• Start from the top left cell and iterate through the matrix to find the shortest path sum
Answered by AI
View 1 more answer

Q1. Write spring code
Ans. 
Spring code is used for building Java applications with ease and efficiency.
• Use @ComponentScan annotation to automatically detect and register Spring beans

• Use @Autowired annotation for dependency injection

• Use @RequestMapping annotation to map HTTP requests to specific handler methods
Answered by AI
Add your answer
Q2. Design pattern questions asked
Add your answer