Mobilewalla Interview Questions and Answers

3 coding questions were asked

Q1. Cycle detection of linked list after creating it from Scratch
Ans. 
Use Floyd's Tortoise and Hare algorithm to detect cycles 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.

• If they meet at some point, there is a cycle in the linked list.

• Example: 1->2->3->4->2 (cycle exists between 4 and 2)
Answered by AI
Add your answer

Q1. One variation of 2 sum problem and the other is celebrity problem of stack
Add your answer

Q1. Questions about my projects
Add your answer

Q1. They copy pasted questions from leetcode
Add your answer

Copy paste ques from leetcode

Again even 3rd round was copy paste from leetcode .