Data Structure and Algorithmic Thinking with Python: Data Structure and Algorithmic Puzzles

 Peeling Data Structures and Algorithms [re-printed on 21-January-2016]:

 Table of Contents: goo.gl/VLEUca

 Sample Chapter: goo.gl/8AEcYk

 Source Code: goo.gl/L8Xxdt

 Errata: goo.gl/EVftls

 Found issue? goo.gl/forms/uLXGYpyuzX

 Videos: goo.gl/BcHq74

The sample chapter should give you a very good idea of the quality and style of our book. In particular, be sure you are comfortable with the level and with our Python coding style. This book focuses on giving solutions for complex problems in data structures and algorithm. It even provides multiple solutions for a single problem, thus familiarizing readers with different possible approaches to the same problem.

“Data Structure and Algorithmic Thinking with Python” is designed to give a jump-start to programmers, job hunters and those who are appearing for exams. All the code in this book are written in Python. It contains many programming puzzles that not only encourage analytical thinking, but also prepares readers for interviews. This book, with its focused and practical approach, can help readers quickly pick up the concepts and techniques for developing efficient and effective solutions to problems.

Topics Covered:

• Organization of chapters
• Introduction
• Recursion and Backtracking
• Linked Lists
• Stacks
• Queues
• Trees
• Priority Queue and Heaps
• Disjoint Sets ADT
• Graph Algorithms
• Sorting
• Searching
• Selection Algorithms [Medians]
• Symbol Tables
• Hashing
• String Algorithms
• Algorithms Design Techniques
• Greedy Algorithms
• Divide and Conquer Algorithms
• Dynamic Programming
• Complexity Classes
• Miscellaneous Concepts

Table of Contents

Chapter 1. Introduction
Chapter 2. Recursion and Backtracking
Chapter 3. Linked Lists
Chapter 4. Stacks
Chapter 5. Qucues
Chapter 6. Trees
Chapter 7. Priority Queues and Heaps
Chapter 8. Disjoint Sets ADT
Chapter 9. Graph Algorithms
Chapter 10. Sorting
Chapter 11. Searching
Chapter 12. Selection Algorilhm s IMedians
Chapter l3. Symbol Tables
Chapter 14. Hashing
Chapter 15. String Algorithms
Chapter 16. Algorithms Design Techniques
Chapter 17. Greedy Algorithms
Chapter 18. Divide and Conquer Algorithms
Chapter 19. Dynamic Programming
Chapter 20. ComplcxiLy Classcs
Chapter 21. MisccI lancous Concepts