Implement a Linked List | Dataford Interview Questions

How would you implement a specific type of linked list?

Implement a doubly linked list supporting append, prepend, insert_after, delete, forward, and backward operations. Implement doubly_linked_list_operations(operations), returning one traversal result for each traversal operation. Values are integers. insert_after and delete affect the first matching value; missing values leave the list unchanged.

Constraints

1 <= operations.length <= 1000
Each operation is valid and contains the fields required by its operation type
Values and targets are integers
Only the first matching value is inserted after or deleted

Function Signature

def doubly_linked_list_operations(operations):

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

Problem

How would you implement a specific type of linked list?

Constraints

1 <= operations.length <= 1000
Each operation is valid and contains the fields required by its operation type
Values and targets are integers
Only the first matching value is inserted after or deleted

Function Signature

def doubly_linked_list_operations(operations):

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.