Filter interviews by
Clear (1)
2 DSA Questions and questions from springboot for java
Given a text need to understand and solve
Some Java based and system design api was allowed to made
Top trending discussions
I applied via Approached by Company and was interviewed in Jul 2023. There were 3 interview rounds.
Arrays, LinkedList basic dsa questions
To find the 2nd largest node in a binary tree, we can perform an in-order traversal and keep track of the two largest nodes.
Perform an in-order traversal of the binary tree
Keep track of the two largest nodes encountered
Return the second largest node when traversal is complete
I applied via Campus Placement and was interviewed before Jan 2023. There were 2 interview rounds.
Easy coding question generally A, B level question of codeforces
JavaScript questions
I applied via Recruitment Consulltant and was interviewed before Jan 2023. There were 3 interview rounds.
2 leetcode medium questions were asked
Designing a feature for a social media platform to allow users to create and share photo albums.
Allow users to create and name albums
Provide an interface for users to upload and organize photos within albums
Implement privacy settings to control who can view and contribute to albums
Include features like tagging, commenting, and liking photos within albums
Enable users to share albums with others via links or social media
Design a Zomato Ordering System for online food delivery.
Allow users to browse restaurants and menus
Implement user authentication and profile management
Enable users to place orders and make payments online
Include features like order tracking and ratings/reviews
Integrate with restaurant partners for order fulfillment
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
Topics:-
Duration-1.5 hours
Kadane's Algorithm, Even Numbers at even index & odd at odd index, print out the second highest node of the tree
ZigZag tree traversal is a method to traverse a binary tree in a zigzag pattern.
In ZigZag tree traversal, we visit the nodes of a binary tree in a zigzag pattern, moving from left to right and then right to left.
We can use a stack or a queue to implement ZigZag tree traversal.
The algorithm involves maintaining two stacks or two queues to keep track of the nodes at each level.
We start with the root node and alternate be...
I applied via Recruitment Consulltant and was interviewed before Oct 2022. There were 5 interview rounds.
2 hackerearth problem solving questions was asked.
DS/ALGO and problem-solving was asked in round one
based on 2 interviews
Interview experience
based on 2 reviews
Rating in categories
Cluster Manager
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Scientist
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm Money
Groww
Upstox
Zerodha