0% completed
Reverse a Queue (easy)
Problem Statement
Given the head of a singly linked list, return the head of the reversed list.
Examples
Example 1:
- Input:
[3, 5, 2] - Expected Output:
[2, 5, 3] - Justification: Reversing the list
[3, 5, 2]gives us[2, 5, 3].
Example 2:
- Input:
[7] - Expected Output:
[7] - Justification: Since there is only one element in the list, the reversed list remains the same.
Example 3:
- Input:
[-1, 0, 1] - Expected Output:
[1, 0, -1] - Justification: The list is reversed, so the elements are in the order
.....
.....
.....
odhran.19
· 2 years ago
I want some clarity on what implementation of a Queue we should expect to see in the problem set. In the first problem the queue is implemented as a list, in Python.
It was not clear that the front of the 'queue' should be the 0 index of the list?
Why show a Queue that uses Node and .next, .enqueue, .dequeue functions if these are not used?
In a real interview leetcode/hackerrank/coderpad what approach should we use?
SK
· 3 years ago
Why are we using peek() instead of remove() and pop() ?
Daven L
· 2 years ago
Is it possible to get more detailed feedback on these queue questions?
I am getting Unknown Error - Check your Input
I don't know what type queue is, so I tried printing it to see if it is of type Node or if it is a list in order to begin working through this problem.
Leopoldo Hernandez
· 2 years ago
However... this doesn't have them and uses arrays instead. What is the point of teaching stacks and queues?
Moshe Peretz
· 2 years ago
i wrote "while(queue.isEmpty())" but its show me runtime erorr that isEmpty is not function
erickchhuang
· 10 months ago