Filter interviews by
I appeared for an interview in Jan 2025.
Max diameter of a tree in Java is the longest path between any two nodes in a tree.
The diameter of a tree can be calculated by finding the longest path between any two nodes in the tree.
This can be done by finding the longest path from the root to a leaf node, and then finding the longest path from another leaf node to the root.
The sum of these two paths gives the diameter of the tree.
I applied via Naukri.com and was interviewed in Sep 2024. There was 1 interview round.
Search in Rotated sorted array
Top trending discussions
Implement thread safe load balancer.
focus on input validations and cover all corner cases in tests
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
Concurrency is the ability of a system to execute multiple tasks simultaneously.
Concurrency allows multiple tasks to run concurrently, improving performance and efficiency.
Concurrency can be achieved through multithreading or multiprocessing.
Example: A web server handling multiple requests simultaneously using multithreading.
ACID principles are a set of properties that guarantee database transactions are processed reliably.
Atomicity: Transactions are all or nothing. If one part of the transaction fails, the entire transaction is rolled back.
Consistency: Transactions bring the database from one valid state to another. All constraints are satisfied.
Isolation: Transactions are isolated from each other until they are completed.
Durability: Once...
posted on 25 Jun 2024
I applied via Approached by Company
Implement rate limiting for a platform serving 100K requests per second.
Use a token bucket algorithm to limit the rate of incoming requests.
Set a maximum number of tokens in the bucket to control the rate.
Refill the bucket at a constant rate to allow bursts of requests.
Track the timestamp of the last request to enforce the rate limit.
Consider using a distributed rate limiting system for scalability.
Monitor and adjust t...
I applied via Recruitment Consultant and was interviewed in Sep 2021. There was 1 interview round.
I applied via Referral and was interviewed in Jan 2024. There were 2 interview rounds.
Codility Test with leetcode medium questions
Built a react feature
Identify the specific feature to be built
Design the component hierarchy and state management
Implement the feature using React components and hooks
Test the feature for functionality and user experience
Refactor and optimize the code for performance
A timer can be implemented using a combination of system time and a loop that checks for elapsed time.
Get the current system time at the start of the timer
Enter a loop that continuously checks the difference between the current system time and the start time
When the desired time has elapsed, perform the desired action or trigger an event
useEffect is a hook in React that allows you to perform side effects in functional components.
useEffect is used to handle side effects in React components.
It takes two arguments: a function and an optional array of dependencies.
The function inside useEffect is executed after the component renders.
The optional array of dependencies determines when the effect should run.
If the array of dependencies is empty, the effect r...
I applied via LinkedIn and was interviewed in Jan 2024. There was 1 interview round.
Merge two sorted arrays into the first array
Start from the end of both arrays and compare elements
Place the larger element at the end of the first array
Continue this process until all elements are merged
To scale a monolith architecture and improve response time, use horizontal scaling and implement caching.
Implement horizontal scaling by adding more instances of the monolith application behind a load balancer
Use a distributed cache to store frequently accessed data and reduce database queries
Implement caching at different levels such as application-level caching, database query caching, and HTTP response caching
Use a ...
Design a cache class with get(), put(), and initialization methods.
Define a class with a data structure to store key-value pairs.
Implement a get() method to retrieve a value from the cache based on a given key.
Implement a put() method to add or update a key-value pair in the cache.
Implement an initialization method to set the initial capacity and eviction policy of the cache.
Consider using a hash map or a linked list t...
based on 3 interviews
Interview experience
based on 21 reviews
Rating in categories
4-6 Yrs
₹ 10-42 LPA
Assistant Manager
196
salaries
| ₹4.6 L/yr - ₹16 L/yr |
Software Engineer
184
salaries
| ₹12.9 L/yr - ₹33 L/yr |
Senior Software Engineer
183
salaries
| ₹12.2 L/yr - ₹42 L/yr |
Senior Manager
138
salaries
| ₹11.5 L/yr - ₹44 L/yr |
Manager
92
salaries
| ₹8.5 L/yr - ₹30 L/yr |
Angel One
HighRadius
Broadridge Financial Solutions
AGS Transact Technologies