Filter interviews by
Clear (1)
I applied via Recruitment Consultant and was interviewed in May 2021. There were 3 interview rounds.
Top trending discussions
I was interviewed before Mar 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given a binary tree of integers, return the level order traversal of the binary tree.
The first line contains an integer 'T', representing the number of te...
Return the level order traversal of a binary tree given in level order with null nodes represented by -1.
Create a queue to store nodes for level order traversal
Start with the root node and add it to the queue
While the queue is not empty, dequeue a node, print its value, and enqueue its children
Repeat until all nodes are traversed in level order
Round duration - 45 minutes
Round difficulty - Easy
A deadlock in DBMS occurs when two or more transactions are waiting for each other to release locks, causing them to be stuck indefinitely.
Deadlock is a situation where two or more transactions are unable to proceed because each is waiting for the other to release locks.
To prevent deadlocks, DBMS uses techniques like deadlock detection and prevention algorithms.
Joins in DBMS are used to combine rows from two or more ta...
Round duration - 60 Minutes
Round difficulty - Medium
Design a system for Twitter
Key components: user profiles, tweets, hashtags, timelines
Architecture: microservices, load balancers, databases, caching
Scalability: sharding, replication, CDN
Real-time processing: streaming APIs, push notifications
Round duration - 60 Minutes
Round difficulty - Medium
You are provided with an array of ‘N’ integers and ‘Q’ queries. Each query requires calculating the maximum subarray sum in a specified range of the array.
The first ...
Implement a function to calculate maximum subarray sum queries in a given range of an array.
Iterate through each query and calculate the maximum subarray sum within the specified range using Kadane's algorithm.
Keep track of the maximum sum found so far and update it as needed.
Return the maximum subarray sum for each query in the test case.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use a single scan over the array to sort it in-place.
Maintain three pointers for 0s, 1s, and 2s and swap elements accordingly.
Example: Input: [0, 2, 1, 2, 0], Output: [0, 0, 1, 2, 2]
Round duration - 20 Minutes
Round difficulty - Medium
Tip 1 : Prepare DS and Algo
Tip 2 : Prepare Dynamic programming
Tip 1 : Good in DS and algo that will be help in the interview that is very neccassry
Tip 2 : Prepare DBMS
I applied via Campus Placement and was interviewed in Jul 2022. There were 3 interview rounds.
10 core subject MCQs along with 3 coding questions
1 Fizz Buzz questions
2 third largest string in array of strings
3 operation on numbers given by strings
Top view of binary tree is the nodes visible when viewed from the topmost node.
Top view shows the nodes visible from the root node's perspective.
Nodes are printed in the order of their horizontal distance from the root node.
If two nodes have the same horizontal distance, the node that appears first in the level order traversal is printed first.
I applied via LinkedIn and was interviewed in Oct 2024. There was 1 interview round.
1st round is coding assessment round based on graph and hashmaps
1. max of sub-array
2.snake-to-camel
Topics - array , tree , string baics
platorm - hackerank
It was on hacker rank. 2 questions easy to medium
I applied via Naukri.com and was interviewed before May 2023. There were 3 interview rounds.
based on 2 reviews
Rating in categories
Engineer
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Embedded Software Engineer
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Innovaccer
Indus OS
Postman
Freshworks