Leetcode Problem 356. Line Reflection

356. Line Reflection

Leetcode Solutions

Initialize a HashSet to store unique points as strings in the format 'x@y' to handle large numbers.
Find the minimum and maximum x-values among all points.
Calculate the line of symmetry's x-coordinate as the average of the minimum and maximum x-values.
Iterate through each point and calculate its reflection across the line of symmetry.
Check if the reflected point exists in the HashSet.
If all points have their reflections in the set, return true. Otherwise, return false.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen