Filter interviews by
I applied via Job Fair and was interviewed in Dec 2023. There were 3 interview rounds.
Sorting an array and finding first two large numbers, along with theory questions on manual testing, Java concepts, and frameworks.
To sort an array, you can use built-in sorting functions like Arrays.sort() in Java.
To find the first two large numbers in an array, you can iterate through the array and keep track of the two largest numbers.
Theory questions on manual testing can include topics like test case design, test ...
Top trending discussions
posted on 22 Jul 2024
Find the maximum sum of a subarray within an array of integers.
Iterate through the array and keep track of the current sum and maximum sum seen so far.
If the current sum becomes negative, reset it to 0 as it won't contribute to the maximum sum.
Return the maximum sum found after iterating through the entire array.
Throttling in JavaScript is a technique used to control the rate at which a function is executed.
Throttling limits the number of times a function can be called over a specified period.
It is commonly used in scenarios like scroll events, resize events, and API requests to prevent performance issues.
Example: Debouncing a search input to limit the number of API calls made while typing.
I was interviewed in Jan 2021.
Round duration - 120 minutes
Round difficulty - Medium
Due to pandemic placement process went virtual. Test was conducted at 10 A.M.
Your task is to decode a given encoded string back to its original form.
An encoded string format is <count>[encoded_string], where the 'encoded_string...
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
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.
A...
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.
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.
An i...
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.
Round duration - 30 minutes
Round difficulty - Medium
Due to pandemic placement process went virtual. Test was conducted at 2 P.M.
Given a string 'STR' composed of lowercase English letters, identify the character that repeats first in terms of its initial occurrence.
STR =...
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 '%'.
Round duration - 45 minutes
Round difficulty - Medium
Video Call interview where the interview happened for around 45 minutes.
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...
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.
Round duration - 30 minutes
Round difficulty - Easy
Video Call interview where the interview happened for around 30 minutes.
Tip 1 : Practise 5 problems daily from websites like hackerrank, codechef, codeforces
Tip 2 : Participate in codechef, codeforces contest.
Tip 3 : Attend mock interviews and should have good communication skills.
Tip 1 : Maintain atleast 2 different projects, write powerful summary statement.
Tip 2 : Maintain skills relevant to job description, include relevant experience.
DHCP is a protocol that assigns IP addresses to devices on a network. DNS is a system that translates domain names to IP addresses.
DHCP assigns IP addresses to devices on a network
DNS translates domain names to IP addresses
DHCP reduces the need for manual IP address configuration
DNS allows users to access websites using domain names instead of IP addresses
I applied via Approached by Company and was interviewed in Aug 2021. There were 3 interview rounds.
Assignment to develop a prototype
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Will be given Requirement to write code for Restraunt. Based on that have write code for delivering orders by delivery boys.
posted on 7 Jun 2024
I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.
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
posted on 26 Jul 2024
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
Some of the top questions asked at the Turvo Associate Quality Engineer interview -
based on 2 interviews
Interview experience
Software Engineer
55
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
32
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Quality Engineer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Site Reliability Engineer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
BlackBuck
Delhivery
Shadowfax Technologies
Ecom Express