Problem Submissions Solution
Detect Loop in linked list
Difficulty: Medium
Acceptance: %
Points: 30.00
Given the head of a singly linked list, determine if the list contains a loop, where a loop exists if a node’s next pointer points back to a previous node, creating a circular structure; otherwise, the list ends with a null pointer.
The input includes the linked list and a 1-based position (pos) indicating the node to which the last node connects, forming a loop (if pos = 0, there is no loop). Return true if a loop is detected, otherwise return false.
Examples:
Input: LinkedList: 2 -> 4 -> 6 -> 8 -> 4
Output: true
Explanation: The last node connects back to the second node, forming a loop.
Input: LinkedList: 1 -> 2 -> 3 -> 4
Output: false
Explanation: The last node points to null, indicating there is no loop.
Expected Time Complexity: O(n)
Expected Space Complexity: O(1)
Constraints:
- 1 <= number of nodes <= 10^4
- 1 <= node->data <= 10^3
Companies:
Amazon Samsung Adobe Qualcomm Paytm
Topics:
Linked List
