About the book:
Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming.
Algorithm Design Techniques is a detailed, friendly guide that teaches you how to apply common algorithms to the practical problems you face every day as a programmer.
What's Inside:
• Enumeration of possible solutions for the problems.
• Performance trade-offs (time and space complexities) between the algorithms.
• Covers interview questions on data structures and algorithms.
• All the concepts are discussed in a lucid, easy to understand manner.
• Interview questions collected from the actual interviews of various software companies will help the students to be successful in their campus interviews.
• Python-based code samples were given the book.
Product details
Publisher : CareerMonk Publications; First Edition (9 January 2018); CareerMonk Publications
Language : English
Paperback : 550 pages
ISBN-10 : 8193245253
ISBN-13 : 978-8193245255
Item Weight : 760 g
Dimensions : 17.78 x 2.79 x 25.4 cm
Net Quantity : 1 Count
Importer : CareerMonk Publications
Packer : CareerMonk Publications
Generic Name : Book
Best Sellers Rank: #133,780 in Books (See Top 100 in Books)
#915 in Computer Science Books
Customer Reviews: 4.2
78 ratings
Amazon Price History
This is our record of Amazon price changes for
Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer and Dynamic Programming (8193245253)
since we began monitoring it.
| Price Type |
Lowest Ever |
Highest Ever |
Current + |
Average |
| Amazon |
(Jun 07, 2026) |
(Jun 07, 2026) |
0,00 € (Jun 07, 2026) |
|