Getting Deep into Complex Algorithms for Interviews with Python

Four-Week Coding Interview Prep in PythonGetting Deep into Complex Algorithms for Interviews with Python

In this course, you'll delve deeply into algorithms and data structures, which are key topics in technical interviews. You'll tackle problems involving linked lists, binary trees, dynamic programming, and graph algorithms. Understanding these advanced topics will equip you with the tools needed to solve complex problems efficiently.

Lessons and practices

Lesson 1: Linked List Operations in Python

Determining if a Linked List is a Palindrome or Not in Python

Swapping Nodes in a Singly Linked List at Given Indices

Removing Duplicates from an Unsorted Linked List

Rotating a Singly Linked List to the Right

Detecting a Cycle in a Linked List

Lesson 2: Binary Tree Traversals in Python

Postorder Binary Tree Traversal

Implementing Preorder Traversal for a Binary Tree in Python

Finding the Second Smallest Node in a Binary Tree

Reversing a Binary Tree in Python