Linked List Implementation | Dataford Interview Questions

Implement a simple linked list data structure.

Create a singly linked list supporting append, prepend, and deletion of the first matching value. The list must preserve insertion order and support conversion to a Python list.

Use implement_linked_list(operations), where each operation is a dictionary such as {"op": "append", "value": 4} or {"op": "delete", "value": 4}. Return the final list of values. Deleting a missing value has no effect.

Constraints

0 <= operations.length <= 10^4
Each value is an integer.
Each operation is append, prepend, or delete.
Deleting a value that is not present has no effect.

Function Signature

def implement_linked_list(operations):

Your question is Linked List Implementation. 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

Implement a simple linked list data structure.

Create a singly linked list supporting append, prepend, and deletion of the first matching value. The list must preserve insertion order and support conversion to a Python list.

Constraints

0 <= operations.length <= 10^4
Each value is an integer.
Each operation is append, prepend, or delete.
Deleting a value that is not present has no effect.

Function Signature

def implement_linked_list(operations):

Your question is Linked List Implementation. 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.