Here is an updated version

updated link --> https://sheetcp.netlify.app/

Can the set bit be counted at each position throughout the range [L, R]? 1 <= L, R <= 10^12

Example : [5, 13]

5:    101
6:    110
7:    111
8:   1000
9:   1001
10:  1010
11:  1011
12:  1100
13:  1101

0th position : 5 1st position : 4 2nd position : 5 3rd position : 6

Online Assessment Problem ??

You are given three integers: A, B, and N. Your task is to determine whether it is possible to reach the value N starting from either A or B using the one of the following operations.

• Replace A with A + B.
• Replace B with A + B.

If it is possible to reach N, print the minimum number of operations required. If it is not possible print NOT POSSIBLE.

Constraints :- [-10000000000 <= A, B, N <= 10000000000].

Example 1: Input : 1, 2, 5 Output : 2 Explanation : (1, 2) -> (2, 3) -> (3, 5)

Example 2: Input : -1, 0, 5 Output : NOT POSSIBLE Explanation : (-1, 0) -> (-1, 0) State are either remain unchanged or produce Negative value for both A and B.

https://leetcode.com/discuss/interview-question/5490523/Hyper-verge-Online-Assessment-Problem