Filter interviews by
Be the first one to contribute and help others!
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 May 2016.
I applied via Referral and was interviewed before Apr 2021. There was 1 interview round.
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 applied via Company Website and was interviewed in Jan 2024. There was 1 interview round.
I applied via Company Website and was interviewed in Mar 2024. There was 1 interview round.
VTable is a table of function pointers used in object-oriented programming to implement polymorphism. VPtr is a pointer to the VTable.
VTable is used to store pointers to virtual functions in a class.
VPtr points to the VTable of an object to enable dynamic dispatch of virtual functions.
VTable and VPtr are used in C++ to implement polymorphism and dynamic binding.
based on 8 reviews
Rating in categories
Senior Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Devsecops Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Engineering Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Trend Micro
Palo Alto Networks
Check Point Software Technologies
Gen