Filter interviews by
Clear (1)
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 applied via Naukri.com and was interviewed in Jun 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Jul 2021. There were 3 interview rounds.
General aptitude test with math and logic related questions. there were also coding questions which were given more weightage than the other questions.
I applied via Naukri.com and was interviewed in Oct 2020. There was 1 interview round.
I applied via LinkedIn and was interviewed in Sep 2020. There was 1 interview round.
Easy problem on java
based on 1 interview
Interview experience
Senior Engineer
33
salaries
| ₹11.4 L/yr - ₹32.2 L/yr |
Senior Software Engineer
32
salaries
| ₹11 L/yr - ₹36.9 L/yr |
Technical Lead
32
salaries
| ₹15 L/yr - ₹40.5 L/yr |
Software Engineer
25
salaries
| ₹5.1 L/yr - ₹15 L/yr |
Consultant
22
salaries
| ₹6 L/yr - ₹19 L/yr |
Gen
McAfee
Palo Alto Networks
Check Point Software Technologies