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 appeared for an interview 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.
posted on 13 Jun 2024
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
I applied via Approached by Company and was interviewed before Oct 2022. There were 4 interview rounds.
I applied via LinkedIn and was interviewed in Aug 2024. There were 2 interview rounds.
I appeared for an interview in Jul 2021.
based on 1 review
Rating in categories
Member Technical Staff
12
salaries
| ₹15 L/yr - ₹46.5 L/yr |
FireEye
CrowdStrike
Palo Alto Networks
Gen