Linked List From Scratch | Dataford Interview Questions

Implement a linked list from scratch.

Create a singly linked list supporting append, prepend, delete, get, and to_list operations without using Python's built-in linked-list implementation. The input is a list of operation dictionaries, and the output contains each operation's result: null for insertions, a boolean for deletion, a value or null for lookup, and an array for traversal. For example, [append(4), prepend(2), get(1), to_list()] returns [null, null, 4, [2, 4]]; deleting 2 returns true and leaves [4].

Constraints

0 <= operations.length <= 10^4
Each operation is valid and has the fields required by its operation type
Values are integers in the range -10^9 to 10^9
The list is singly linked
delete removes only the first matching value

Function Signature

def run_linked_list(operations):

Your question is Linked List From Scratch. 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 linked list from scratch.

Constraints

0 <= operations.length <= 10^4
Each operation is valid and has the fields required by its operation type
Values are integers in the range -10^9 to 10^9
The list is singly linked
delete removes only the first matching value

Function Signature

def run_linked_list(operations):

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