Hi, I had 4 tasks: 60 minutes.

1. correct one line in the code that would give the correct answers
2. 10 MCQs
3. Visible nodes in a binary tree (available on geek for geeks)
4. given an array like [-2,3,5,-9], return 1,0 or -1 if the product of all elements in the array is positive, 0 or negative respectively.

Fairly easy and standard questions, was able to solve in 40-45 minutes.

The questions may not be repeated but I just wanted to give back to the leetcode community who has been extremely helpful throughout.