Code Room
CodingMediumcod-g655
Subject In place transformsLevel Mid–Senior~20 minCommon in Algorithms & data structures interviewsIndustries Software development, Computer games

Question

Given an n x n 2D matrix representing an image, rotate it 90 degrees CLOCKWISE in place (modify and return the same matrix; do not allocate another n x n grid). For example the top row becomes the right column. n is up to 1000. The clean approach is transpose-then-reverse-each-row, both done in place.

Implement
rotate_image(matrix: list[list[int]]) → list[list[int]]
Examples
in[[[1,2,3],[4,5,6],[7,8,9]]]out[[7,4,1],[8,5,2],[9,6,3]]
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.