Implement a Linked List | Dataford Interview Questions

How would you implement a linked list?

Asked in the technical phone interview stage. The candidate paraphrases this as one of two programming questions in the quant developer intern technical round.

Implement a singly linked list processor. Given operations, apply append, prepend, insert at a zero-based index, and delete the first matching value. Return the final list of values.

Contract

linked_list_operations(operations) receives a list of operation dictionaries. Each operation is {"op": "append"|"prepend", "value": integer}, {"op": "insert", "index": integer, "value": integer}, or {"op": "delete", "value": integer}. Insert indices are valid, and deleting a missing value does nothing.

Constraints

0 <= operations.length <= 1,000
Operation values are integers
Insert indices are valid for the list state at the time of insertion
Deletion removes only the first matching value

Function Signature

def linked_list_operations(operations):

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