Rudder Analytics Interview Questions, Process, and Tips

Easy questions related to time and work

Python code to form patterns like star or palimdrome number

Q1. How much salary you want for first year
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

This was the MCQ round and consisted of 19 MCQ's.

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round and was held after the aptitude and GD round. It was in the evening. 
 

Q1. How do you detect a loop in a linked list?
Ans. 
To detect a loop in a linked list, we can use the Floyd's Cycle Detection Algorithm.
• Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.

• If there is a loop, the two pointers will eventually meet at some point within the loop.

• To detect the start of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.
Answered by AI
View 1 more answer
Q2. How would you implement merge sort on a linked list?
Ans. 
Merge sort on a linked list involves dividing the list into halves, sorting each half, and then merging the sorted halves.
• Divide the linked list into two halves using slow and fast pointers

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer