int N = points.length; // N is the number of points. // and add edges to the adjacency list. for (int i = 0; i < N; i++) { int x1 = points[i][0]; int y1 = points[i][1]; // Iterate from `i + 1` to ...
//after reversing just start comparing if at any time the value doesn't match it's not a palindrome, i.e. return false, else it's a palindrome and return true.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results