Q1. You are given an array of non-negative integers arr[] of size n, and a non-negative integer B.

Your task is to find and return any one pair of distinct elements (a, b) from the array such that: arr[i] * arr[j] = B

If such a pair exists, return the pair. If no such pair exists, return an empty result.

Q2. https://leetcode.com/problems/binary-tree-cameras/description/

Q3. https://leetcode.com/problems/detonate-the-maximum-bombs/description/