Practice Mirror Reflection
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
There is a special square room with mirrors on each of the four walls. Except for the southwest corner, there are receptors on each of the remaining corners, numbered 0, 1, and 2. The square room has walls of length p and a laser ray from the southwest corner first meets the east wall at a distance q from the 0th receptor. Given the two integers p and q, return the number of the receptor that the ray meets first. The test cases are guaranteed so that the ray will meet a receptor eventually.
Source: Mirror Reflection on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
p = 2, q = 1
2
# Example 2
p = 3, q = 1
1
Constraints
Related LeetCode Problems
Practice more problems similar to Mirror Reflection.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.