Filter interviews by
I was interviewed before Jun 2023.
Use Floyd's Tortoise and Hare algorithm to find a cycle in a linked list.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps until they meet.
If they meet, there is a cycle in the linked list.
Example: 1 -> 2 -> 3 -> 4 -> 2 (cycle at node 2)
Top trending discussions
I applied via Naukri.com and was interviewed before Sep 2020. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Jun 2024. There were 2 interview rounds.
HackerRank sorting problem it will last for 30 min in the task
posted on 28 Nov 2024
I applied via Approached by Company and was interviewed in May 2024. There were 2 interview rounds.
Count duplicates in a string using java
Tell me about your framework
I applied via LinkedIn and was interviewed in Apr 2024. There were 2 interview rounds.
Profit and loss average , simple intesest
Fibonacci numbers , prime numbers , even odd numbers
posted on 5 Jun 2024
Logical question related to programming
Medium leveln coding round
based on 1 review
Rating in categories
Senior Recruitment Associate
250
salaries
| ₹3 L/yr - ₹8.5 L/yr |
Recruitment Associate
136
salaries
| ₹2.5 L/yr - ₹5.2 L/yr |
Recruitment Specialist
118
salaries
| ₹3.8 L/yr - ₹10.6 L/yr |
Payroll Specialist
92
salaries
| ₹2 L/yr - ₹7 L/yr |
Principal Consultant
72
salaries
| ₹3.5 L/yr - ₹11 L/yr |
Keka HR Payroll Software
Darwinbox
SAP
Ramco Systems