Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5725 |

@blackshadows | 5685 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4908 |

@saiujwal13083 | 4156 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3511 |

@sushant_a | 3453 |

@KshamaGupta | 3318 |

@the_coder95 | 3302 |

Complete Leaderboard | |

Handle | Score |

@avaiesshaik782 | 662 |

@arpitsatnalika | 629 |

@code_it_ | 591 |

@prakharxyz | 583 |

@tujhekya | 542 |

@Rahul Jadhav 1 | 458 |

@sivanandh03 | 448 |

@satyam0460 | 433 |

@iamronak | 424 |

@imnm | 424 |

@18eumc107 | 421 |

Complete Leaderboard |

Given a number N. Find the last two digits of the Nth fibonacci number.

**Note:** If the last two digits are 02, return 2.

**Example 1:**

**Input:**
N = 13
**Output:**
33
**Explanation:**
The 13th Fibonacci number is 233.
So last two digits are 3 and 3.

**Example 2:**

**Input:**
N = 255
**Output:**
70
**Explanation:**
The 255th fibonacci number is 875715953430-
18854458033386304178158174356588264390370.
Thus, last two digits are 7 and 0.

**Your Task:**

You don't need to read input or print anything.Your task is to complete the function **fibonacciDigits()** which takes a number N as input parameter and returns the last two digits of the Nth fibonacci number.

**Expected Time Complexity:**O(K)

**Expected Auxillary Space:**O(K)

K is of the order 10^{2}.

**Constraints:**

1<=N<=10^{18}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Last two digit Fibonacci

...

Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.