Delete Node in Linked List | Dataford Interview Questions

Delete Node in a Linked List (LeetCode 237).

Asked in the coding round stage. Only main logic written.

The function receives a serialized singly linked list and the index of the node to delete. Build the linked-list representation internally, remove the specified node, and return the remaining values as a list.

Input and Output

values is a non-empty list of integers. delete_index is a valid zero-based index. Return a list containing the values after deletion.

Constraints

1 <= len(values) <= 1000
-10^9 <= values[i] <= 10^9
0 <= delete_index < len(values)

Function Signature

def delete_node(values, delete_index):

Your question is Delete Node in 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