We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
The single example given is too trivial. The question require another with larger values so that the wrapped values from mod arithmetic are visible. This is where I was caught out and I feel cheated and the exercise was a waste of time.
There is another general issue involving using mod arithmetic. Unless it is required for the Maths involved in the problem why create test cases whose outputs will overflow the native machine numerical limits? Why do this and then require mod arithmetic so that so wrapped nonsense value is required for the answer?
I didnt think much of the editorial either.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Fibonacci LCM
You are viewing a single comment's thread. Return to all comments →
The single example given is too trivial. The question require another with larger values so that the wrapped values from mod arithmetic are visible. This is where I was caught out and I feel cheated and the exercise was a waste of time. There is another general issue involving using mod arithmetic. Unless it is required for the Maths involved in the problem why create test cases whose outputs will overflow the native machine numerical limits? Why do this and then require mod arithmetic so that so wrapped nonsense value is required for the answer? I didnt think much of the editorial either.