More Information
  • Understand concepts such as divide and conquer and greedy and recursion algorithms in Python
  • Master dynamic programming and asymptotic analysis in Python for coding
  • Grasp concepts such as linked lists, tuples, dicts, and sets in Python
  • Implement Stacks, queues/deques, and hash tables in Python
  • Master different types of decision tree such as binary trees, heaps, and priority queues
  • Implement Breadth-First, Depth-First algorithms in Python
  • Grasp Dijkstra's, Kruskal's algorithms along with Maximum Flow, and DAG Topological sorting.

This course is about data structures and algorithms. We are going to implement problems in Python. You will start by learning the basics of data structures, linked lists, and arrays in Python. You will be shown how to code tuples in Python followed by an example that shows how to program dicts and sets in Python. You will learn about the use of pointers in Python. You will then explore linear data structures in Python such as stacks, queues, and hash tables. In these you will learn how to implement a stack and code queues and deques. There will also be a demonstration on how to realize a hash table in Python. Following this you will learn how to use tree/graph data structures including binary trees, heaps and priority queues in Python. You will program priority queues and red-black trees in Python with examples. Finally, you will be shown how to apply different algorithms such as Graph traversal, Shortest Path, Minimum Spanning Tree, Maximum Flow tree, and DAG topological sorting

This course teaches all these concepts in a very practical hands-on approach without burdening you with lots of theory. By the end of the course, you will have learned how to implement various data structures and algorithms in Python.

The code bundle for this course is available at

Style and Approach

This course covers the implementation of different data structures including trees and graphs. The videos are evenly paced, for ease of understanding

  • This course will introduce you to different types of data structure in Python
  • This course covers critical data structures and topics such as linear, tree/graph data structures, and algorithms
  • Learn to implement different data structures and algorithms through examples
Course Length 2 hours 11 minutes
ISBN 9781788622066
Date Of Publication 28 Jun 2018


Harish Garg

Harish Garg is a Principal Software Developer, author, and co-founder of a software development and training company, Bignumworks. Harish has more than 19 years of experience in a wide variety of technologies, including blockchain, data science and enterprise software. During this time, he has worked for companies such as McAfee, Intel, etc.

Mithun Lakshmanaswamy

Mithun Lakshmanaswamy of BignumWorks Software LLP has been developing applications in Python for 9+ years. He has written enterprise-level distributed applications that are deployed on scores of servers and have the ability to support thousands of users simultaneously. Some of the applications he has developed are related to parsing millions of virus definitions, analyzing network packets from an enterprise setup, and so on. He is also quite proficient in teaching technical concepts and is quite involved with his current organization’s training programmes. He has worked on multiple projects working with Python, AWS and so on, implementing the concepts of concurrent and distributed computing.