Filter interviews by
I applied via Company Website and was interviewed in Oct 2021. There was 1 interview round.
My family background is diverse and multicultural.
My parents are from different countries and cultures.
I grew up speaking multiple languages at home.
My family values education and hard work.
I have siblings who are also pursuing careers in technology.
Top trending discussions
I applied via Campus Placement and was interviewed in Sep 2024. There were 3 interview rounds.
There were 3 coding questions totally based on dsa- hard
Use Dijkstra's algorithm to find the node with the shortest distance in a graph.
Implement Dijkstra's algorithm to calculate the shortest distance from a starting node to all other nodes in the graph.
Select the node with the smallest distance that has not been visited yet as the current node.
Update the distances of neighboring nodes from the current node if the new distance is smaller than the previously recorded distan...
posted on 30 Jul 2022
I applied via Recruitment Consulltant and was interviewed in Jun 2022. There was 1 interview round.
Zigzag traversal of a tree is a method to visit the nodes in a tree in a zigzag pattern.
Use a queue to perform a level order traversal of the tree.
For each level, alternate the direction of traversal (left to right, then right to left).
Store the values of the nodes in each level in an array of strings.
I applied via Naukri.com and was interviewed in May 2022. There were 3 interview rounds.
Math Reasoning, Probability, Graph and pie charts, Indices, Trignometry, Geometry
Verbal communication and english speaking, grammer,
I was interviewed in Oct 2024.
Polyfills,html,css basics,js intermediate level
posted on 23 Sep 2021
I applied via Recruitment Consultant and was interviewed in Aug 2021. There were 3 interview rounds.
Next greater element is a problem where we find the closest greater element for each element in an array.
Iterate through the array
For each element, compare it with the elements on its right
Find the first element greater than the current element
Store the result in a new array or data structure
Program to find all prime numbers up to given N.
Start with 2 and iterate up to N
For each number, check if it is divisible by any number from 2 to its square root
If not divisible, add it to the list of primes
Fetching unique URLs from a 10GB file with non-unique URLs.
Read the file in chunks to avoid memory issues.
Use a hash set to store unique URLs.
Iterate through each URL in the file and add it to the hash set if it doesn't already exist.
I applied via campus placement at Indian Institute of Technology (IIT), Patna and was interviewed before Nov 2023. There were 2 interview rounds.
Leetcode medium to hard
I applied via campus placement at SRM university (SRMU) and was interviewed in Sep 2022. There were 2 interview rounds.
3 data structure problem with medium to hard level leetcode type.
I applied via Campus Placement and was interviewed before Oct 2023. There was 1 interview round.
Dsa -> questions on trees, linked list, stack, dynamic programming
based on 1 review
Rating in categories
Cafe Manager
313
salaries
| ₹1.3 L/yr - ₹4.8 L/yr |
Assistant Manager
202
salaries
| ₹0.8 L/yr - ₹7.8 L/yr |
Territory Sales Manager
137
salaries
| ₹4.4 L/yr - ₹8 L/yr |
Brew Master
137
salaries
| ₹1 L/yr - ₹3.2 L/yr |
Senior Executive
126
salaries
| ₹1.8 L/yr - ₹7 L/yr |
Starbucks
Costa Coffee
Barista Coffee Company
Gloria Jean's Coffees