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 #{ # Driver Code Starts #Initial Template ...
Daily Submission of POTD Solved on GeeksForGeeks. Contribute to lokesh-6/GFG-POTD development by creating an account on GitHub.
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 ...
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 ...
HKServerSolution 交流 & 建议:https://t.me/hkserversolution 爱听歌交流群:https://t.me/musictools666 利器社群在 TG 上的分支:http://t.me/fun_makers 圆角水群:https://t.me/UoVzCloud 中文独立博客:https://t.me/indieBlogs Telegram 蛤丝总群:https://t.me/joinchat/EgReJ0BeLkTPKtZLJ1HipA 黑...
HKServerSolution 交流 & 建议:https://t.me/hkserversolution 爱听歌交流群:https://t.me/musictools666 利器社群在 TG 上的分支:http://t.me/fun_makers 圆角水群:https://t.me/UoVzCloud 中文独立博客:https://t.me/indieBlogs Telegram 蛤丝总群:https://t.me/joinchat/EgReJ0BeLkTPKtZLJ1HipA 黑...