Last_Of_UsOO's blog

OA Problems
By Last_Of_UsOO, history, 6 months ago, In English

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

  • Vote: I like it
  • -1
  • Vote: I do not like it

»
6 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Last_Of_UsOO (previous revision, new revision, compare).

→ Reply
»
6 months ago, # |
  Vote: I like it 0 Vote: I do not like it

anyBody give that Approach !!

→ Reply
»
6 months ago, # |
  Vote: I like it 0 Vote: I do not like it

I guess here you could recursion with some memoization to reach A or B from N

→ Reply