Filter interviews by
I applied via Approached by Company and was interviewed in Aug 2024. There were 2 interview rounds.
Leetcode hard: 1. Similar to Queens problem DP based, 2. Coin change problem
SSR renders the initial page on the server side while client rendering renders the page on the client side.
SSR improves SEO as search engines can crawl the fully rendered page on the server side.
Client rendering provides faster initial load times as only data is fetched initially and UI is rendered on the client side.
SSR is better for static content websites while client rendering is better for dynamic content websites...
I was interviewed before Nov 2023.
Top trending discussions
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
I applied via Recruitment Consulltant and was interviewed in Feb 2023. There were 5 interview rounds.
DSA questions of medium level.
I applied via Campus Placement and was interviewed before May 2023. There were 3 interview rounds.
Test was conducted on Interviewbit 4 DSA questions, 10 MCQs
based on 2 interviews
Interview experience
Software Engineer
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineering Manager
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
10
salaries
| ₹0 L/yr - ₹0 L/yr |
SDE (Software Development Engineer)
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Freshworks
Zoho
BrowserStack
CleverTap