Faster and better experience!
Filter interviews by
I appeared for an interview in Jan 2024.
I applied via Recruitment Consulltant and was interviewed before Feb 2023. There were 3 interview rounds.
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...
based on 3 interviews
Interview experience
based on 6 reviews
Rating in categories
Senior Software Engineer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Accountant
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Market Analyst
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Dell
Hewlett Packard Enterprise
IBM
Cisco