Course Introduction | DSA In Python + Top 130 Leetcode Problems for MAANG

Book Overview & Buying
Table Of Contents

DSA In Python + Top 130 Leetcode Problems for MAANG

By : Pratik Singhal

Buy this Video

DSA In Python + Top 130 Leetcode Problems for MAANG

By: Pratik Singhal

Buy this Video

Overview of this book

This course offers a comprehensive guide to mastering Data Structures and Algorithms (DSA) with Python, focusing on solving over 130 Leetcode problems often asked in MAANG interviews. Starting with the basics—arrays, linked lists, stacks, queues, and trees—you will progress to advanced topics like dynamic programming, graphs, and heaps. Each problem is tackled step by step through live coding sessions, allowing you to understand the thought process behind the solution. You’ll also learn how to analyze time and space complexity, an essential skill for optimizing solutions in coding interviews. The course covers multiple problem-solving techniques such as sliding window, two-pointer, binary search, recursion, and dynamic programming. Live coding demonstrations ensure you gain practical, real-time experience while optimizing algorithms. By the end of the course, you’ll be equipped to solve coding challenges with confidence, armed with a solid understanding of algorithms and data structures. The course is designed for learners of all levels, offering both foundational concepts and advanced strategies to tackle coding interviews with ease.

Course Introduction

How to Improve Problem-Solving Skills?

How to Code Fast!

How to Ace Your DSA Interview?

How to Get Started with Leetcode?

Time & Space Complexity

Introduction to Time & Space Complexity

What Is Big O Notation

Checking if Big-O Notation Is Acceptable in Interviews

Calculating Time Complexity Part 1

Calculating Time Complexity Part 2

Myths About Time Complexity

Calculating Time Complexity of Recursive Algorithm

Recursion Time Complexity Example 2

Introduction to Space Complexity

Space Complexity Example 1

Space Complexity Example 2

Arrays & Lists in Python

What Are Arrays and Why Are They So Fast?

What Are Some Drawbacks of Using Arrays

How Do Resizable Arrays Work?

Using Lists in Python

Advanced List Operators - Part 1

Advanced List Operators - Part 2

Leetcode #485 - Max Consecutive Ones - Python

Leetcode #121 - Best Time to Buy and Sell Stock - Python

Leetcode #238 - Product of Array Except Self - Python

Leetcode #189 - Rotate Array - Python

Leetcode #53 - Maximum Sum Subarray - Python

Leetcode #152 - Maximum Product Subarray - Python

Leetcode #36 - Valid Sudoku - Python

Sorting

Why Is Sorting Important?

Introduction to Sorting

Bubble Sort Theory

Bubble Sort Implementation

Selection Sort Theory

Selection Sort Implementation

Insertion Sort Theory

Insertion Sort Implementation

Merge Sort Part 1 - How to Merge Two Sorted Arrays

Merge Sort Part 2 - Merge Two Sorted Arrays Implementation

Merge Sort Part 3 - Merge Sort Theory

Merge Sort Part 4 - Implementation

Quick Sort Part 1 - Partitioning Algorithm Theory

Quick Sort Part 2 - Partitioning Algorithm Implementation

Quick Sort Part 3 - Understanding How Quick Sort Works

Quick Sort Part 4 - Quick Sort Implementation

Counting Sort Part 1 - How Does Counting Sort Work and Its Importance

Counting Sort Part 2 - Implementation

Leetcode #283 - Move Zeroes - Python

Leetcode #169 - Majority Element - Python

Leetcode #75 - Sort Colors - Python

Linked Lists

Drawback of Arrays

What Is Linked List

Linked List Basic Implementation

Linked List - Insert at Top

Linked List - Insert at End

Linked List - Insert in Middle

Linked List - Delete at Top

Linked List - Delete at End Part 1

Linked List - Delete at End Part 2

Practice Problem 1 - Intersection of Two Linked Lists

Practice Problem 2 - Merge Two Sorted Lists

Practice Problem 3 - Linked List Cycle

Practice Problem 4 - Reverse Linked List

Practice Problem 5 - Palindrome Linked List

Practice Problem 6 - Linked List Cycle II

Practice Problem 7 - Find Middle of the Linked List

Practice Problem 8 - Add Two Numbers

Practice Problem 9 - Remove Nth Node from End of List

Hash Table Collision Resolution

Introduction to Hash Table

How Does Hash Table Work

Hash Table Collision Resolution

Types of Hash Tables

Unordered Hash Table in Python

Ordered Hash Table in Python

Practice Problem 1 - Contains Duplicate

Practice Problem 2 - Group Anagrams

Practice Problem 3 - Two Sum

Practice Problem 4 - Three Sum

Practice Problem 5 - Longest Consecutive Sequence

Stacks Theory + Practice Problems

Introduction to Stacks

Using Stacks in Python Part 1

Using Stacks in Python Part 2

Practice Problem 1 - Valid Parenthesis

Practice Problem 2 - Evaluate Reverse Polish Notation

Practice Problem 3 - Min Stack

Practice Problem 4 - Next Greater Element II

Practice Problem 5 - Merge Intervals

Queue

Introduction to Queue

How Is Queue Implemented?

Using Deque as a Queue in Python

Array Pattern #1 - Sliding Window Method Theory + Practice Problems

Practice Problem 1 - Longest Substring Without Repeating Characters

Leetcode #239 - Sliding Window Maximum - Python

Array Pattern #2 - Two Pointer Method Theory + Practice Problems

Leetcode #167 - Two Sum II Input Array Is Sorted - Python

Leetcode #42 - Trapping Rain Water - Python

Array Pattern #3 - Math & Geometry Practice Problems

Leetcode #73 - Set Matrix Zeroes - Python

Leetcode #54 - Spiral Matrix - Python

Binary Search

Introduction to Binary Search

Binary Search Implementation

Binary Search Pattern #1 - Binary Search Over Sorted Arrays

Leetcode #34 - Find First and Last Position of Element in Sorted Array - Python

Leetcode #153 - Find Minimum in Rotated Sorted Array - Python

Leetcode #33 - Search in a Rotated Sorted Array - Python

Leetcode #35 - Search Insert Position - Python

Binary Search Pattern #2 - Binary Search Over Range

Leetcode #875 - Koko Eating Bananas - Python

Leetcode #1552 - Magnetic Force Between Two Balls - Python

Binary Trees

Introduction to Binary Trees

Terms Related to Trees

Tree Traversal Part 1

Tree Traversal Part 2

Leetcode #94 - Binary Tree InOrder Traversal - Python

Leetcode #102 - Binary Tree Level Order Traversal - Python

Leetcode #100 - Same Tree - Python

Leetcode #101 - Symmetric Tree - Python

Leetcode #572 - Subtree of Another Tree - Python

Leetcode #104 - Maximum Depth of Binary Tree - Python

Leetcode #110 - Balanced Binary Tree - Python

Leetcode #543 - Diameter of a Binary Tree - Python

Leetcode #993 - Cousins in Binary Tree - Python

Leetcode #112 - Path Sum - Python

Leetcode #113 - Path Sum II - Python

Leetcode #1448 - Count Good Nodes in Binary Tree - Python

Leetcode #1161 - Maximum Level Sum of Binary Tree - Python

Leetcode #404 - Sum of Left Leaves - Python

Leetcode #199 - Binary Tree Right Side View - Python

Leetcode #226 - Invert Binary Tree - Python

Leetcode #105 - Construct Binary Tree from PreOrder and InOrder Traversal - Python

Heaps Theory + Practice Problems

Introduction to Heaps

Implementation of Heaps

Insertion in Heaps

Heap Insertion Implementation

Deletion in Heaps

Heapify

Practice Problem 1 - Kth Largest Element in an Array

Practice Problem 2 - Find Median from Data Stream

Practice Problem 3 - Kth Largest Element in Stream

Binary Search Tree

Introduction to Binary Search Tree

Height Balanced BST

Inserting a New Node in Binary Search Tree

Inorder Successor and Predecessor in BST

Deleting an Existing Node from Binary Search Tree

Leetcode #230 - Kth Smallest Element in BST - Python

Leetcode #98 - Validate Binary Search Tree - Python

Leetcode #235 - Lowest Common Ancestor of a Binary Search Tree - Python

Dynamic Programming

Introduction to Dynamic Programming

Practice Problem 2 - Jump Game

Practice Problem 3 - Coin Change

Practice Problem 4 - Target Sum

Practice Problem 5 - Longest Common Subsequence

Practice Problem 6 - House Robber

Practice Problem 7 - Longest Increasing Subsequence

Practice Problem 8 - Partition Equal Subset Sum

Practice Problem 9 - 0-1 Matrix

Practice Problem 10 - Integer Replacement

Practice Problem 11 - Decode Ways

Practice Problem 13 - Min Cost Climbing Stairs

Practice Problem 14 - Longest Palindromic Substring

Disjoint Set Data Structure and Union Find Algorithms

Introduction to Disjoint Set Data Structure

Understanding Disjoint Set Data Structure

Union by Rank Optimization

Disjoint Set Data Structure Python Implementation

Path Compression Optimization

Path Compression Optimization Implementation

Graphs

What Are Graphs?

Directed vs. Undirected Graphs

Weighted vs. Unweighted Graphs

Terms of Graphs Part 1

Types of Graphs Part 1

Types of Graphs Part 2

Implementing Graphs Part 1

Implementing Graphs Part 2

Implementing Graphs Part 3

Adjacency Matrix Implementation

Adjacency List Implementation

Introduction to Traversals

BFS Working

BFS Implementation

BFS Property #1

BFS Over Binary Weighted Graphs

Introduction to DFS

DFS Iterative Implementation

DFS Recursive Implementation

DFS Important Properties

Cycle Detection Part 1

Cycle Detection Part 2

Cycle Detection Part 3

Cycle Detection Implementation

What Is Topological Sorting?

Topological Sorting Example #1

Single Source Shortest Path Problem

Dijkstra's Algorithm

Dijkstra's Algorithm Implementation

Introduction to Bellman-Ford Algorithm

Bellman-Ford Algorithm Working

Bellman-Ford Algorithm Implementation

Introduction to Minimum Spanning Tree

Prim's Algorithm

Prim's Algorithm Implementation

Practice Problem 1 - Find the Town Judge

Practice Problem 1 - Course Schedule

Practice Problem 2 - Number of Islands

Practice Problem 4 - Surrounded Regions

Practice Problem 5 - Number of Enclaves

Practice Problem 6 - Network Delay Time

Practice Problem 7 - Flood Fill

Bit Manipulation

Introduction to Bitwise Operators

Common Bitwise Operators

Leetcode #136 - Single Number - Python

Leetcode #338 - Counting Bits - Python

Leetcode #287 - Find the Duplicate Number - Python

Leetcode #29 - Divide Two Integers - Python

Leetcode #268 - Missing Number - Python

Leetcode #191 - Number of 1 Bits - Python

Leetcode #7 - Reverse Integer - Python

Recursion & Backtracking

Introduction to Backtracking

Backtracking Example

Leetcode #39 - Combination Sum - Python

Leetcode #78 - Subsets - Python

Leetcode #51 - N Queens - Python

Strings

Practice Problem 1 - Minimum Add to Make Parenthesis Valid

Practice Problem 2 - Group Anagrams

Advanced Data Structures - Segment Tree

Introduction to Range Sum Query Problem

Introduction to Segment Tree - Building a Segment Tree

Answering Queries Using Segment Tree

Segment Tree Updating Values

Segment Tree Build Function Implementation

Segment Tree Query Function Implementation

Segment Tree Update Function Implementation

DSA In Python + Top 130 Leetcode Problems for MAANG

By : Pratik Singhal

DSA In Python + Top 130 Leetcode Problems for MAANG

By: Pratik Singhal

Overview of this book

Confirmation

Buy this book with your credits?

Submit Your Feedback

Create a Free Account To Continue Reading

Sign in to activate your 7-day free access