2D Array Memory Layout | Dataford Interview Questions

How is a 2D array stored in memory? Implement a function that calculates the linear memory offset of an element in either row-major or column-major storage. The function receives the array dimensions, element coordinates, and storage order, then returns the zero-based offset in the contiguous memory block.

Constraints

1 <= rows, cols <= 10000
0 <= row < rows
0 <= col < cols
order is either "row-major" or "column-major"
The array is stored contiguously without padding

Function Signature

def memory_offset(rows, cols, row, col, order):

Your question is 2D Array Memory Layout. 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

1 <= rows, cols <= 10000
0 <= row < rows
0 <= col < cols
order is either "row-major" or "column-major"
The array is stored contiguously without padding

Function Signature

def memory_offset(rows, cols, row, col, order):

Your question is 2D Array Memory Layout. 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.