Quick Overview

Remove every even one-based position from a singly linked list in place while preserving the order of the remaining nodes. Handle empty, one-node, two-node, repeated-value, and million-node inputs without allocating a second list.

Remove Even-Positioned Nodes from a Linked List

Company: Oracle

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Remove every even one-based position from a singly linked list in place while preserving the order of the remaining nodes. Handle empty, one-node, two-node, repeated-value, and million-node inputs without allocating a second list.

Loading…