i
Zopper
Filter interviews by
Detect cycle in a linked list by using Floyd's Tortoise and Hare algorithm.
Use two pointers, slow and fast, to traverse the linked list
If there is a cycle, the two pointers will eventually meet at some point
Time complexity of this algorithm is O(n)
To find the starting point of a cycle in a linked list, we can use Floyd's Tortoise and Hare algorithm.
Use Floyd's Tortoise and Hare algorithm to detect a cycle in the linked list
Once a cycle is detected, reset one pointer to the head and move both pointers at the same pace until they meet at the starting point of the cycle
Top trending discussions
I applied via Campus Placement and was interviewed before Jun 2021. There were 5 interview rounds.
It has aptitude and coding based questions.For coding you can choose any coding language
There will be a GD for 7-10 people on random topic
posted on 7 May 2021
I applied via Naukri.com and was interviewed in Apr 2021. There was 1 interview round.
posted on 30 Jul 2022
I applied via Naukri.com and was interviewed before Jul 2021. There were 2 interview rounds.
I applied via Walk-in and was interviewed before Jan 2021. There were 4 interview rounds.
I applied via Referral and was interviewed before Apr 2021. There were 2 interview rounds.
A company designed the test basically to understand the nature of the interviewee. Simple test.
based on 1 interview experience
based on 3 reviews
Rating in categories
Relationship Manager
62
salaries
| ₹2.8 L/yr - ₹5.5 L/yr |
Software Engineer
55
salaries
| ₹9 L/yr - ₹15 L/yr |
Territory Sales Manager
47
salaries
| ₹3.2 L/yr - ₹6.5 L/yr |
Senior Software Engineer
38
salaries
| ₹13.1 L/yr - ₹37 L/yr |
Area Sales Manager
31
salaries
| ₹5 L/yr - ₹10.1 L/yr |
Duck Creek Technologies
Ascent HR Technologies Private Limited
FinThrive
Subex