000			01083 a2200181 4500
020			_a9781946556691
082			_a005.1023 RAW
100			_aRawat, Meenakshi
245			_aDynamic Programming for Coding Interviews: A Bottom-Up Approach to Problem Solving
260			_bNotion Press _aChennai _c2017
300			_a128
520			_aThe Dynamic Programming solution computes 100th Fibonacci term in less than fraction of a second, with a single function call, taking linear time and constant extra memory. A recursive solution, usually, neither pass all test cases in a coding competition, nor does it impress the interviewer in an interview of company like Google, Microsoft, etc. The most difficult questions asked in competitions and interviews, are from dynamic programming. This book takes Dynamic Programming head-on. It first explain the concepts with simple examples and then deep dives into complex DP problems
650			_aDynamic Programming
650			_aComputer Science
650			_aProgramming (Mathematics)
700			_aRawat, Kamal
942			_cBB _2ddc
999			_c44258 _d44258