JavaScript Challenge - Reverse a Singly-Linked List

This community-built FAQ covers the “Reverse a Singly-Linked List” code challenge in JavaScript. You can find that challenge here, or pick any challenge you like from our list.

Top Discussions on the JavaScript challenge Reverse a Singly-Linked List

There are currently no frequently asked questions or top answers associated with this challenge – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this challenge. Ask a question or post a solution by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this challenge, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!
You can also find further discussion and get answers to your questions over in #get-help.

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head to #get-help and #community:tips-and-resources. If you are wanting feedback or inspiration for a project, check out #project.

Looking for motivation to keep learning? Join our wider discussions in #community

Learn more about how to use this guide.

Found a bug? Report it online, or post in #community:Codecademy-Bug-Reporting

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

Hello everyone, :smiley:

I resolved that challenge and want to share my answer with you :

function reverseLinkedList(linkedList) {
//linkedList argument represents the head of the Linked List

let prevPointer = null
let currentPointer = linkedList
let nextPointer = null

while (currentPointer !== null) {

//the pointer that should come after the current pointer now comes before the current pointer
prevPointer =
//the first pointer will be the last so the next pointer of the current pointer should be null for the first iteration = nextPointer
//the pointer that will be the next pointer must be the current pointer
nextPointer = currentPointer
//the current pointer should now be the previous pointer of the initial current pointer
currentPointer = prevPointer

return nextPointer

Enjoy coding everyone ! :jigsaw: :wink: