Given an integer num, find two integers whose product is equal to num $+ 1$ or num $+ 2$ such that the absolute difference between the two integers is minimized.

Return the two integers in any order.

Constraints:

• $1 \leq$ num $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.