Self-contained Sorting Program | Dataford Interview Questions

Sorting-related coding problem: implement the sort yourself as a complete runnable program (not just a LeetCode-style function)

Asked in the round 2 stage.

Required Interface

Implement def merge_sort(values):, accepting a list of integers and returning a new list containing the same values in ascending order. Do not call sorted() or .sort().

Constraints

0 <= len(values) <= 5,000
Each value is an integer between -10^9 and 10^9
Return a new list
Do not modify the input list
Do not use sorted() or list.sort()

Function Signature

def merge_sort(values):

Your question is Self-contained Sorting Program. 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