Implement A Doubly Linked List | Dataford Interview Questions

Implement a doubly linked list.

Represent operations as arrays: ["append", value], ["prepend", value], ["delete", value], ["forward"], and ["backward"]. Delete only the first matching value. Return one array for each traversal operation, preserving query order.

Use the function signature below. Values are integers, and a delete operation for a missing value does nothing.

Example: [["append", 2], ["append", 3], ["prepend", 1], ["backward"]] returns [[3, 2, 1]].

Constraints: At most 10^4 operations, and each operation has valid syntax.

Constraints

0 <= len(operations) <= 10^4
Each operation is a valid array with one or two elements
Values are integers
Delete removes only the first matching value
A missing value can be deleted without changing the list

Function Signature

def implement_doubly_linked_list(operations):

Your question is Implement A Doubly 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