Sort and Reverse Linked List | Dataford Interview Questions

Write a program to sort a linked list and reverse it in place.

Given the head of a singly linked list, sort the nodes in ascending order, then reverse the links in place so the returned list is in descending order. Do not create replacement data nodes; the input list is represented as an array of values in the test cases, and the function receives and returns a ListNode.

Constraints

0 <= number of nodes <= 1000
-10^9 <= node value <= 10^9
The list is singly linked
Return the original nodes in a new order; do not create replacement data nodes

Function Signature

def sort_and_reverse(head):

Your question is Sort and Reverse Linked List. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write a program to sort a linked list and reverse it in place.

Constraints

0 <= number of nodes <= 1000
-10^9 <= node value <= 10^9
The list is singly linked
Return the original nodes in a new order; do not create replacement data nodes

Function Signature

def sort_and_reverse(head):

Your question is Sort and Reverse Linked List. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.