Two questions:

1. Given an unsorted array, determine if there is any triplet that meets a^2 + b^2 = c^2. For example, if the array is [2, 5, 3, 4, -1, 6] 3^2 + 4^2 = 5^2, so it returns True. If the array is [0, 1, 0], return False.

I'm not sure which LC question this is.

2. https://leetcode.com/problems/binary-tree-right-side-view/