Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Feb 2022. There were 3 interview rounds.
Simple coding round. Have to complete the working code in a stipulated time.
Top trending discussions
I applied via AngelList and was interviewed in Sep 2020. There was 1 interview round.
I applied via Referral
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
posted on 22 Jun 2023
I applied via Naukri.com
MCQ test based on Java,if you are confident with the basics of Java you could easily crack it
posted on 20 Sep 2024
Mainly focus on java
posted on 16 Dec 2024
I applied via Naukri.com
1. How to make an immutable class?
2.How to achieve loosely coupling?
3. Write an program to to print the 2 table like this upto 10 (2 × 1 = 2) like this pattern in java?
4. Remove duplicates from an integer array and sort in descending order multiple by 2 find the number count that are greater then 10 ?
5. Some basic of oops concept ?
based on 1 interview
Interview experience
Software Engineer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Associate
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Freshworks
Zoho
Jio Haptik
yellow.ai