You have been given an array/list 'ARR' of integers. Your task is to find the second largest element present in the 'ARR'.

Note:

You are given the root node of a binary tree consisting of ‘N’ nodes. Your task is to find the number of good nodes in the given binary tree.

There is a chessboard of dimensions 15 X 15, and Alice and Bob start playing a game on it. The game is not chess, and involves just one coin.