Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Apr 2022. There were 2 interview rounds.
Top trending discussions
posted on 12 Aug 2024
I applied via Job Portal and was interviewed in Jul 2024. There was 1 interview round.
To find the distance between two nodes in a binary tree, we can find the distance from the root to each node and then calculate the distance between the two nodes.
Calculate the distance from the root to each node using a recursive function
Find the lowest common ancestor of the two nodes
Calculate the distance from each node to the lowest common ancestor and add them together to get the total distance
A valid sudoku of 9*9 is a grid where each row, column, and 3x3 subgrid contains the numbers 1-9 without repetition.
Each row must contain the numbers 1-9 without repetition
Each column must contain the numbers 1-9 without repetition
Each 3x3 subgrid must contain the numbers 1-9 without repetition
I was interviewed in Aug 2021.
Round duration - 90 minutes
Round difficulty - Hard
The round was online. It had 3 coding questions to be solved. Was asked about why are the javascript and jquery used? What is the difference between angular 8 and angular?
Given two strings, str1
and str2
, determine whether str2
contains any permutation of str1
as a substring.
str1 = “ab”
str2 = “aoba”
True
In a city with ‘N’ junctions and ‘M’ bi-directional roads, each junction is connected to other junctions with specified travel times. No road connects a junction to itself, ...
This approach will use DFS(Depth First Search) to make a recursive function in which we pass the currCost, which is the current cost. If the light is not green when we reach that junction, we have to add the waiting time in currCost. After that, we will call the recursive function on all the adjacent unvisited junctions by incrementing the currCost with the weight of the edge. We will maintain a vari...
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
Algorithm is as follows:
Tip 1 : practice coding questions
Tip 2 : Search and study previous interview questions
Tip 1 : Mention the things according to role
Tip 2 : just write a clear one page resume
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Sales Executive
349
salaries
| ₹0.9 L/yr - ₹5 L/yr |
Senior Executive
283
salaries
| ₹1.6 L/yr - ₹7.4 L/yr |
Team Lead
281
salaries
| ₹2 L/yr - ₹7 L/yr |
Executive
280
salaries
| ₹0.9 L/yr - ₹5.5 L/yr |
Sales Officer
240
salaries
| ₹1 L/yr - ₹5 L/yr |
Quess
ManpowerGroup
Randstad
Kelly Services