i
StockTake Online
Filter interviews by
Be the first one to contribute and help others!
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...
I was interviewed in Oct 2024.
Polyfills,html,css basics,js intermediate level
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 Naukri.com and was interviewed in Jul 2023. There was 1 interview round.
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
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 Referral and was interviewed before Mar 2023. There were 2 interview rounds.
It was 1 hour long and was asked to pass all the test cases.
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 Netaji Subhas Institute of Technology (NSIT) and was interviewed before Dec 2021. There were 3 interview rounds.
Coding Rond consisted of 3 questions
Project Lead
9
salaries
| ₹4.4 L/yr - ₹4.5 L/yr |
Social Media Manager
3
salaries
| ₹4.7 L/yr - ₹7.8 L/yr |
Taco Bell
TAJSATS AIR CATERING
Country Inns & Suites
Ibis