class Solution: def firstElement (self, n): # code here if n == 0 or n == 1: return 1 a, b = 1, 1 mod = 1000000007 c = 0 for i in range(n - 2): c = (a + b) % mod a = b % mod b = c % mod return c % mod #{ # Dr
Repository files navigation README POTD-gfg Hi, There I will be updating this respository with my codes everyday after solving in the platform to maintain my code base.About No description, website, or topics provided. Resources Readme Activity Stars 0 stars Watchers 1 watching Forks ...
Daily Submission of POTD Solved on GeeksForGeeks. Contribute to lokesh-6/GFG-POTD development by creating an account on GitHub.
Nitish-Naik/GFG-POTDPublic NotificationsYou must be signed in to change notification settings Fork0 Star0 Code Issues Pull requests Actions Projects Security Insights Additional navigation options Commit Browse filesBrowse the repository at this point in the history ...