tag:blogger.com,1999:blog-2682781734368178743.post5381821053975293449..comments2011-01-09T10:32:36.933-08:00avid gardenernoreply@blogger.comBlogger3125tag:blogger.com,1999:blog-2682781734368178743.post-33305638640890076982011-01-09T10:32:36.933-08:002011-01-09T10:32:36.933-08:00

there are many interesting DP problems <br />visit <br />http://coders-stop.blogspot.com/

Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-2682781734368178743.post-11587467714762367112010-01-19T14:44:08.628-08:002010-01-19T14:44:08.628-08:00

Hey,<br /><br />There is a method to find the nth fibonacci number in O(logn) time also. Just look up the wiki page of fibonacci numbers.<br /><br />http://avidullu.wordpress.com

avidulluhttp://avidullu.wordpress.com/noreply@blogger.comtag:blogger.com,1999:blog-2682781734368178743.post-71951152174822240112009-11-21T23:50:04.494-08:002009-11-21T23:50:04.494-08:00

WAP:<br /><br />bool IsFibonacci(int n)<br />{<br /> // ...<br />}

Rajendrahttp://www.blogger.com/profile/17760611913302573590noreply@blogger.com