Filter interviews by
I was interviewed in Nov 2024.
I was interviewed before Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with 2 DSA problems.
You are provided with an undirected graph composed of 'N' vertices and 'M' edges, where vertices are labeled from 1 to 'N'.
Your task is to determine if...
Detect if there exists a cycle in an undirected graph.
Use Depth First Search (DFS) to traverse the graph and detect cycles.
Maintain a visited set to keep track of visited vertices.
If a visited vertex is encountered again during DFS, a cycle exists.
Return 'Yes' if a cycle is found, 'No' otherwise.
Given a binary tree, your task is to perform a zigzag level order traversal. This traversal starts from left to right on the first level, then switches to righ...
Perform zigzag level order traversal on a binary tree.
Use a queue to perform level order traversal of the binary tree.
Alternate between left to right and right to left traversal for each level.
Handle null nodes represented by -1 in the input.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via LinkedIn and was interviewed in Jul 2020. There was 1 interview round.
Cycle detection in a directed graph
Use Depth First Search (DFS) algorithm to detect cycles in a directed graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then a cycle is detected
Zig Zag order traversal of a binary tree is a way to traverse the tree in a zigzag pattern.
Start from the root node and traverse the tree level by level.
For odd levels, traverse from right to left.
For even levels, traverse from left to right.
Use a stack to keep track of the nodes to be traversed.
Repeat until all nodes have been visited.
Query to find number of trains between 2 given stations in SQL design.
Use a JOIN statement to join the tables containing train and station information.
Filter the results based on the given stations.
Count the number of trains in the result set.
Consider the direction of travel and the order of the stations in the query.
Handle cases where there are no trains between the given stations.
Top trending discussions
I applied via Campus Placement and was interviewed before Jun 2023. There was 1 interview round.
I was interviewed before Mar 2021.
Round duration - 90 Minutes
Round difficulty - Medium
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Use Floyd's Cycle Detection Algorithm to determine if there is a cycle in the linked list.
Maintain two pointers, one moving at double the speed of the other, if they meet at any point, there is a cycle.
If one of the pointers reaches the end of the list (null), there is no cycle.
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
Find the Next Greater Element for each element in a list of integers.
Iterate through the list of integers from right to left.
Use a stack to keep track of elements for which the Next Greater Element is not yet found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the Next Greater Element as the top element of the stack or -1 if the stack is empty.
Round duration - 60 Minutes
Round difficulty - Medium
Designing an ATM machine involves considering user interface, security measures, transaction processing, and hardware components.
User interface should be intuitive and easy to navigate for users of all ages.
Implement security measures such as PIN entry, card authentication, and encryption to protect user data.
Transaction processing should be fast and reliable, with options for cash withdrawals, deposits, transfers, and...
Round duration - 45 Minutes
Round difficulty - Easy
Tip 1 : Practice DSA daily
Tip 2 : Try to think of the solution first before jumping to the solution
Tip 3 : Go through interview experience
Tip 4 : Have mock interviews
Tip 1 : Know in depth what is there in your resume
Tip 2 : Mention your skills and work properly
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
Seeking new challenges and growth opportunities in a different environment.
Desire to work on new technologies and projects
Opportunity for career advancement
Seeking a better work-life balance
Interested in a different company culture or team dynamic
DS/ALGO and problem-solving was asked in round one
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There was 1 interview round.
1 hour 10 mins, MERN Stack, Face to Face. Mongodb, medium DSA Question, callback, eventloop, NodeJS asynchronous working
I was interviewed in Jul 2024.
Static function is a function that can only be accessed within the same file, while a static variable is a variable that retains its value between function calls.
Static function is declared using the 'static' keyword before the return type, limiting its scope to the file it is defined in.
Static variable is declared using the 'static' keyword before the variable type, retaining its value between function calls.
Example o...
Synchronization technique is a method used to control access to shared resources in a multi-threaded environment.
Synchronization techniques prevent race conditions and ensure data consistency
Common synchronization techniques include locks, semaphores, and monitors
Examples include using synchronized keyword in Java or mutex in C++
Add an element to a linked list.
based on 1 interview
Interview experience
Senior Associate
69
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
68
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
39
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Zerodha
Groww
Upstox
ET Money