Reverse Linked List: which companies ask it and how to practise

Reverse Linked List is a Easy problem that 34 companies are reported to ask. This page shows who, how often and how recently, what the question tests, and how to practise it out loud with an interviewer who asks follow-ups. We link to the original problem statement instead of copying it.

Which companies ask Reverse Linked List?

Public company lists attribute Reverse Linked List, a Easy problem, to 34 companies. The most frequent askers are Luxoft, Yahoo and Zenefits. 9 reports are from the last six months. It mainly tests linked list and recursion. Use this as a practice guide, not a promise.

Practise this kind of question aloud

Who asks Reverse Linked List

34 companies appear in the public lists for this question. By how often each is reported: Luxoft (very often), Yahoo (very often), Zenefits (very often), Zynga (very often), Yelp (very often), X (very often), Qualcomm (very often), Adobe (very often), Nokia (very often) and Snap (very often), and 24 more. 9 of them were reported in the last six months, Nokia, Apple and Bloomberg among them.

These are candidate reports collected in public lists, not statements from the companies. They are a good guide to what to practise and a poor guide to what you will be asked: interviewers change questions, and the same company asks different questions by team and level. Last reviewed 25 October 2026.

What Reverse Linked List tests

It is rated Easy, so interviewers expect a correct, complete solution and a clear statement of the time and space cost, often in the first 15 to 20 minutes, with time left for a variation.

Linked lists test pointer discipline: what you save before you overwrite a link, the head and tail edge cases, and whether a dummy node simplifies the code.

Recursion needs a base case, a smaller call, and a clear picture of the stack. Say the depth and whether you could do it iteratively.

How to practise it

Do not just solve it silently. In a real interview you explain the approach before you code, write while you talk, and defend the solution to follow-ups. Set a timer, say the brute force and its cost first, then improve it, and finish by stating the time and space complexity and two edge cases you tested.

On giveinterview you can take this kind of question as a spoken interview: the AI interviewer opens with the problem, watches you code, asks cross-questions and ends with a scorecard. Your first 3 single-question interviews are free for life, every interview report is free, and a new account also gets 6 welcome credits.

Read the original statement here: https://leetcode.com/problems/reverse-linked-list/ (opens the publisher's page). The statement is theirs; we do not reproduce it.

Questions to practise next

If you can solve Reverse Linked List, try these next, chosen because they share its main topic and many of the same companies: LRU Cache (Medium), Merge k Sorted Lists (Hard), Merge Two Sorted Lists (Easy), Add Two Numbers (Medium), LFU Cache (Hard) and Reverse Nodes in k-Group (Hard). Each has its own page in the questions list.

Frequently asked questions

Is Reverse Linked List asked at Amazon?

Amazon appears in the public lists for Reverse Linked List, reported often. Treat that as a reason to practise it, not a promise you will be asked it.

How hard is Reverse Linked List?