Quick Overview

Reverse a finite singly linked list represented by nested two-item Python lists. Reuse the existing node objects without allocating replacements, and handle empty, single-node, and very long chains.

Reverse a Singly Linked List

Company: Grammarly

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: Reverse a finite singly linked list represented by nested two-item Python lists. Reuse the existing node objects without allocating replacements, and handle empty, single-node, and very long chains.

Loading…