Matrix coordinate mapping

Turn a Camera Frame Clockwise

Original & variantRotate Image ↗

Original examples and wording. The question below states the exact input format and output contract.

01. The question

A square camera frame contains integer pixel labels. Return a new frame rotated 90° clockwise. Keep the original unchanged; this variant deliberately uses an output matrix rather than an in-place rotation.

Camera frame3 rows × 3 columns
r / c012
0246
1135
2789

Rows grow downward, columns grow rightward. Follow [row, col] → [col, n − 1 − row].

Before revealing the idea, predict the result and describe what information you would need to track.

02. Worked example

Inputframe = [[2,4,6],[1,3,5],[7,8,9]]

Output[[7,1,2],[8,3,4],[9,5,6]]

  1. Top-left 2 lands at top-right [0,2].
  2. Bottom-left 7 lands at top-left [0,0].
  3. Each original cell has exactly one destination.

Try your code

Define solve(data, parameter="") and return your result. Your code runs locally, not on a server.

Edit your test cases

Use 1-10 objects with data and an optional string parameter. Expected outputs are computed from the lesson. An optional expected field must be correct.

Input contract & reference code

Example data: [[2,4,6],[1,3,5],[7,8,9]]. Parameter: "". Numeric parameters arrive as strings; convert them with int(parameter) when needed.

The example and generated cases use the question’s exact variant. This checks behavior on a small test batch—not performance on every possible input.

Python runtime notices

Python downloads only when you run code, using compressed runtime assets. Code is not saved or uploaded. Enable JavaScript to run it.

Five-second execution limit per batch. Standard-library Python only; additional packages and network access are unavailable. Stop ends execution without blocking the lesson.

03. The idea

Try sketching your own approach first. What would you track, and why would it work?

Reveal the idea
  1. Allocate an n × n output matrix.
  2. Send [row,col] to [col,n-1-row].
  3. Read only from the original so no value is overwritten.

04. Watch it happen

Use Step to move slowly, or Play to follow the whole trace. Change a preset or load your own input.

Input & settings

A square 1-5 by 1-5 integer matrix, values -99 to 99. Original stays unchanged.

Red = current item / blue = active window or cells / green = completed work. A value docks at its actual destination; the original input stays unchanged. Positions start at 0.

Working state / what changes

Ready to begin

Enable JavaScript to step through the animation. The worked example and solution below remain readable without it.

Python / why it changes

The line behind the step

def turn_frame(frame):
    n = len(frame)
    turned = [[0] * n for _ in range(n)]
    for row in range(n):
        for col in range(n):
            turned[col][n - 1 - row] = frame[row][col]
    return turned
How to use this walkthrough

Hover or focus a control for its label. Play forms the input and follows values into the working state. Step shows one change; Back and the slider restore exact snapshots. Reduced motion uses instant updates. Saved snapshots and sorted heap displays are teaching overhead, not algorithm complexity.

05. Python solution

def turn_frame(frame):
    n = len(frame)
    turned = [[0] * n for _ in range(n)]
    for row in range(n):
        for col in range(n):
            turned[col][n - 1 - row] = frame[row][col]
    return turned

06. Cost & edge cases

Time
O(n²)
Space
O(n²) output
  • A one-pixel frame stays the same.
  • This is an output-copy variant, not the in-place Blind 75 contract.

Keep going