Reverse Array in O(n) | Dataford Interview Questions

Reverse an array in O(n) time complexity without using high-level language-specific reverse helpers. Implement reverse_array(arr) to reverse the input list in place and return it. The input is a Python list of values, and the output must contain the same values in reverse order.

Constraints

0 <= len(arr) <= 100000
Array elements may be integers, strings, or other values.
Reverse the list in place.
Do not use reverse(), reversed(), slicing, or another high-level reversal helper.

Function Signature

def reverse_array(arr):

Your question is Reverse Array in O(n). 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

Constraints

0 <= len(arr) <= 100000
Array elements may be integers, strings, or other values.
Reverse the list in place.
Do not use reverse(), reversed(), slicing, or another high-level reversal helper.

Function Signature

def reverse_array(arr):

Your question is Reverse Array in O(n). 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.