Swiggy Delivery List Middle Node
Swiggy Delivery List Middle Node
EasyLinked Lists100% accepted
Swiggy needs to split a delivery queue at the middle. Given the head of a singly linked list, return the middle node. If two middle nodes exist, return the second one.
Approach
Find the middle node of a linked list using slow/fast pointers.
Input
5
1 2 3 4 5
Output
3 4 5
More Linked Lists problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards