Filter interviews by
I was interviewed in Jan 2024.
Find the maximum distance between any two leaf nodes of a binary tree.
Traverse the tree to find the maximum depth of left and right subtrees
Calculate the maximum distance by adding the depths of left and right subtrees
Design a least recently used cache system.
Use a combination of a hash map and a doubly linked list to keep track of the least recently used items.
When a new item is accessed, move it to the front of the list.
If the cache is full, remove the least recently used item from the end of the list.
Calculate top 20 percentile of student details based on score in a student table.
Calculate the 80th percentile score using formula: 80th_percentile = 0.8 * total_students
Sort the scores in descending order and find the score at 80th percentile position
Retrieve student details with scores greater than or equal to the 80th percentile score
Top trending discussions
Code Snept question with 3-4 Reasoning question. Google form
Pen paper coding round. String , Array . Linkedlist , graph, questions
To find the nearest prime number, iterate from the given number in both directions until a prime number is found.
Start iterating from the given number in both directions to find the nearest prime number.
Check if a number is prime by dividing it by all numbers less than its square root.
Keep track of the closest prime number found during the iteration.
Find the second maximum number in an array of strings.
Convert the array of strings to an array of integers.
Sort the array in descending order.
Return the second element in the sorted array.
posted on 5 Dec 2024
I applied via Campus Placement
posted on 17 Oct 2024
I applied via Walk-in
To implement a queue using a stack, use two stacks and simulate the queue operations.
Use two stacks, one for enqueue operation and one for dequeue operation.
For enqueue operation, simply push elements onto the stack used for enqueueing.
For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.
Then pop from the dequeue stack to simulate dequeue operation.
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
Create a Node class with data and next pointer
Initialize a head pointer to null
Add nodes by updating next pointers
Traverse the list by following next pointers
posted on 11 Jan 2025
Coding Rount
DSA Round + Puzzle
SQL + Project Discussion
JS
I applied via Campus Placement
Dsa problems dp and tress problem
Coding for international
posted on 23 Aug 2024
I applied via campus placement at National Institute of Technology (NIT), Karnataka and was interviewed in Jul 2024. There was 1 interview round.
Question based on array string linkedlist
I applied via LinkedIn and was interviewed in Mar 2024. There were 2 interview rounds.
Coding exercise related to probability
Tech stack for real time applications includes WebSocket, Node.js, Redis, and MongoDB.
Use WebSocket for real-time communication between client and server
Node.js for server-side logic and handling multiple connections efficiently
Redis for caching and storing real-time data
MongoDB for persistent data storage and retrieval
Senior Software Engineer
12
salaries
| ₹14.5 L/yr - ₹29.5 L/yr |
Software Engineer
7
salaries
| ₹8.5 L/yr - ₹18 L/yr |
Devops Engineer
7
salaries
| ₹10 L/yr - ₹10 L/yr |
Technical Support Engineer
7
salaries
| ₹4.5 L/yr - ₹10.5 L/yr |
Customer Success Manager
5
salaries
| ₹9 L/yr - ₹17 L/yr |
Freshworks
Zoho
InMobi
Mu Sigma