Linked List Operations | Dataford Interview Questions

Create your own linked list that supports dynamically adding, inserting at an index, iterating, and deleting.

Implement linked_list_operations(operations) using linked nodes rather than Python's built-in list for storage. Each operation is a list: ['add', value], ['insert', index, value], ['delete', index], or ['iterate']. Return one result per operation: True for successful mutation, the deleted value or None for deletion, and a value array for iteration. Insert indices may range from 0 through the current size; invalid indices return False.

Constraints

1 <= operations.length <= 1000
Each operation is one of ['add', value], ['insert', index, value], ['delete', index], or ['iterate']
Values are integers in the range -10^9 through 10^9
Insert indices must be in the range 0 through the current size to succeed
Delete indices must be in the range 0 through current size - 1 to succeed

Function Signature

def linked_list_operations(operations):

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

Create your own linked list that supports dynamically adding, inserting at an index, iterating, and deleting.

Constraints

1 <= operations.length <= 1000
Each operation is one of ['add', value], ['insert', index, value], ['delete', index], or ['iterate']
Values are integers in the range -10^9 through 10^9
Insert indices must be in the range 0 through the current size to succeed
Delete indices must be in the range 0 through current size - 1 to succeed

Function Signature

def linked_list_operations(operations):

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