Code Room
CodingEasycod-g1412
Subject Two pointersLevel Entry–Mid~10 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given two integer arrays a and b, return True if b is exactly a reversed — same length, and b read left to right equals a read right to left. Compare using one pointer moving forward through a and one moving backward through b (or an index formula); do not materialize a reversed copy of either array. Example: a = [1, 2, 3], b = [3, 2, 1] returns True, while a = [1, 2], b = [1, 2] returns False.

Implement
is_reverse_of(a: list[int], b: list[int]) → bool
Examples
in[[1,2,3],[3,2,1]]outtrue
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.