Count maximum path in linked list
Last updated: June 2, 2026
Quick Overview
Given a singly linked list, count the maximum number of nodes that can be traversed in a continuous path without revisiting any node. The input will be the head of the linked list, and the output should be an integer representing the length of the longest path.
Bloomberg
June 2, 2026115
13
75 solved
Given a singly linked list, count the maximum number of nodes that can be traversed in a continuous path without revisiting any node. The input will be the head of the linked list, and the output should be an integer representing the length of the longest path.
Bloomberg uses this problem in the Onsite to evaluate your algorithmic thinking. They expect you to discuss multiple approaches, analyze trade-offs between them, and implement the optimal solution with clean, readable code.
What the Interviewer Expects
- Recognize the underlying problem pattern (sliding window, two pointers, BFS/DFS, etc.)
- Discuss multiple approaches and trade-offs before coding
- Implement an optimal solution with clean, production-quality code
- Handle all edge cases including boundary conditions and invalid input
- Optimize both time and space complexity with clear justification
- Test your solution systematically with well-chosen examples
Key Topics to Cover
How to Approach This
- Clarify input constraints and edge cases before writing code.
- Walk through your approach verbally and confirm with the interviewer before coding.
- Start with a brute force solution, then optimize. Mention time and space complexity.
- Test your solution with examples, including edge cases like empty input or duplicates.
- Consider common patterns: sliding window, two pointers, hash map, BFS/DFS, dynamic programming.
Possible Follow-up Questions
- Can you solve this iteratively instead of recursively (or vice versa)?
- What happens if the input contains duplicates?
- Can you optimize the space complexity of your solution?
- Can you solve this in a single pass?
Sharpen Your Skills on Codemia
Practice similar problems with our interactive workspace, get AI feedback, and track your progress.
Practice DSA ProblemsSample Answer
Problem Analysis
The problem requires us to traverse a singly linked list and count the maximum number of nodes that can be visited without revisiting any node. This can be seen as a graph traversal problem where each...
Approach
- Initialize a counter to keep track of the number of nodes visited.
- Start from the head of the linked list.
- Traverse the linked list using a while loop:
- For each node, increment the...
Submit Your Answer
