Filter interviews by
I applied via Naukri.com and was interviewed in Oct 2022. There was 1 interview round.
Top trending discussions
I applied via Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
To find a loop in a linked list, we use Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.
If there is a loop in the linked list, the two pointers will eventually meet.
To detect the meeting point, we reset one of the pointers to the head of the linked list and move both pointers at the same speed.
The meeting point is the start of the loop.
LRU, MRU and LFU are caching algorithms used to manage memory in computer systems.
LRU stands for Least Recently Used and removes the least recently used items from the cache when the cache is full.
MRU stands for Most Recently Used and removes the most recently used items from the cache when the cache is full.
LFU stands for Least Frequently Used and removes the least frequently used items from the cache when the cache i...
I was interviewed before Jun 2016.
I was interviewed before Aug 2016.
For loop is used for iterating over a range of values while for each loop is used for iterating over elements of an array.
For loop is used when the number of iterations is known beforehand.
For each loop is used when the number of iterations is not known beforehand.
For loop can be used with any iterable object.
For each loop can only be used with arrays and other iterable objects.
For loop uses an index variable to access...
I applied via Referral and was interviewed before May 2023. There were 2 interview rounds.
To resolve space issue with GET API request, consider pagination, compression, caching, and optimizing query parameters.
Implement pagination to limit the number of results returned in each request.
Use compression techniques like Gzip to reduce the size of the response data.
Implement caching mechanisms to store frequently accessed data and reduce the number of requests.
Optimize query parameters to only request necessary
posted on 13 Jun 2024
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
The task was a Codility type
I was interviewed in Jan 2025.
Online test was hackerrank was was og avg difficulty
Assignment was straightforward which could be done using trie. Did it in 1/6th throughout time for given queries then mentioned allowed still no reply. Keep on asking engineering manager and hr to which they replied not upto the mark.
Around 1 hour with 2 coding and few aptitude questions.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Senior Software Engineer
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer Test
10
salaries
| ₹0 L/yr - ₹0 L/yr |
McAfee
Palo Alto Networks
Gen
Trend Micro