Zero to Hero - Python DSA (Self Paced)
Unlock your coding potential with our comprehensive online course, "Python + DSA (Basic to Advanced) with 500+ LeetCode Questions." This meticulously structured course is designed to guide you through the fundamentals of Python and advanced Data Structures and Algorithms, ensuring a solid foundation with practical, hands-on coding experiences.
Course Instructor:
Code and Debug
₹2499.00 ₹4999.00 50% OFF
/CourseBundles(45162)/3142819-python-dsa.png)
Course Overview
Schedule of Classes
Course Curriculum
17 Subjects
Important Links
1 Learning Materials
Get all the important links
DSA Roadmap
External Link
Basics of programming - Z2H
17 Learning Materials
Understanding Time and Space Complexity
What is Time and Space Complexity?
Video
00:36:05
What is Time Limit Exceeded (TLE) error?
Video
00:05:19
Time Complexity of common python operations
Video
00:13:54
Basic Maths Logic Buildup
Extraction of Digits from an Integer
Video
00:06:03
Count the number of Digits in an Integer
Video
00:08:21
Check if a number is Palindrome or Not
Video
00:09:20
Armstrong Number
Video
00:08:39
Print factors/divisors of a number
Video
00:21:53
Introduction to Hashing
[Pre Requirement] Store Frequency in Dictionary
Video
00:16:39
Learn basics of hashing
Video
00:27:36
Recursion Basics
Theory - What is Recursion?
Video
00:24:52
Recursion using Parameters
Video
00:18:20
Parameterized vs Functional Recursion
Video
00:16:07
Factorial of a number using Recursion
Video
00:08:55
Reverse an Array using Recursion/Loop
Video
00:14:49
Check if a String is Palindrome or Not
Video
00:20:46
Find the Fibonacci number
Video
00:11:07
Sorting Algorithms - Z2H
5 Learning Materials
All Sorting Algorithms
Selection Sort
Video
00:12:28
Bubble Sort
Video
00:16:48
Insertion Sort
Video
00:16:58
Merge Sort
Video
00:31:01
Quick Sort
Video
00:28:39
Array/List Problems - Z2H
32 Learning Materials
Easy Level Problems
Find the Largest Element in an Array
Video
00:08:54
Find the Second Largest Element in an Array Without Sorting
Video
00:14:07
Check if the array is sorted
Video
00:04:26
Remove Duplicates from a Sorted Array
Video
00:19:10
Right Rotate an array by one place
Video
00:09:21
Right rotate an array by K places
Video
00:21:22
Leetcode 283: Move Zeros to the End of the List
Video
00:17:19
Implementing Linear Search
Video
00:03:57
Merge 2 Sorted Arrays Without Duplicates
Video
00:13:48
Leetcode 268: Find Missing Number in an Array
Video
00:13:49
Leetcode 485: Max Consecutive Ones
Video
00:08:51
Medium Level Problems
Leetcode 1: Two Sum Problem
Video
00:15:49
Sort an array of 0's 1's and 2's
Video
00:28:33
Kadane's Algorithm, maximum subarray sum
Video
00:18:45
Leetcode 169 - Majority Element
Video
00:20:13
Best time to Buy and Sell Stock
Video
00:16:22
Rearrange element by sign
Video
00:17:22
Leaders in an Array
Video
00:11:56
Longest Consecutive Sequence
Video
00:29:52
Learn 2D List and Matrix
Video
00:24:57
Leetcode 73 - Set Matrix Zeroes
Video
00:29:23
Rotate Matrix by 90 degrees
Video
00:26:03
Leetcode 54 - Print the matrix in spiral manner
Video
00:20:45
Hard Level Problems
3Sum Problem - Leetcode 15
Video
00:39:45
Largest Subarray with 0 Sum
Video
00:10:32
Merge Overlapping Subintervals - Leetcode 56
Video
00:21:12
Merge two sorted arrays without extra space
Video
00:21:46
Find the repeating and missing numbers
Video
00:25:58
Pascal's Triangle
Video
00:28:58
4Sum Problem
Video
00:38:15
Count Inversions
Video
00:31:57
Leetcode 493 - Reverse Pairs
Video
00:20:58
Binary Search - Z2H
27 Learning Materials
Binary Search on 1D Arrays/List
Introduction to Binary Search
Video
00:34:11
Implementation of Lower and Upper Bound
Video
00:21:44
Leetcode 35 - Search Insert Position
Video
00:06:29
Floor/Ceil in Sorted Array
Video
00:09:55
Leetcode 34: Find the first or last occurrence of a given number in a sorted array
Video
00:15:15
Count occurrences of a number in a sorted array with duplicates
Video
00:09:29
Leetcode 33: Search in Rotated Sorted Array I
Video
00:17:34
Leetcode 81: Search in Rotated Sorted Array II
Video
00:11:24
Leetcode 153: Find minimum in Rotated Sorted Array
Video
00:16:02
Find out how many times has an array been rotated
Video
00:08:55
Single element in a Sorted Array
Video
00:23:44
Find peak element
Video
00:18:58
Binary Search on Answers
Find square root of a number in log n
Video
00:20:09
Find the Nth root of a number using binary search
Video
00:13:45
Koko Eating Bananas
Video
00:22:35
Minimum days to make M bouquets
Video
00:25:02
Find the smallest Divisor
Video
00:21:43
Capacity to Ship Packages within D Days
Video
00:20:15
Aggressive Cows
Video
00:25:58
Allocate Books
Video
00:29:10
Painter's partition
Video
00:04:41
Minimize Max Distance to Gas Station
Video
00:39:38
Median of Two Sorted Arrays
Video
00:36:32
Binary Search on 2D Arrays
Find the row with maximum number of 1's
Video
00:10:56
Search in a 2D Matrix - I
Video
00:13:43
Search a 2D Matrix II
Video
00:19:52
Find Peak Element-II
Video
00:18:05
Linked List (Single LL, Double LL) - Z2H
22 Learning Materials
Learn Singly Linked List
Introduction to LinkedList
Video
00:10:57
Insertion, Deleting, Length, Insertion of Nodes in SLL
Video
00:41:00
Medium problems of SLL
Middle of a LinkedList [TortoiseHare Method]
Video
00:14:22
Reverse a LinkedList
Video
00:18:26
Detect a loop in LL
Video
00:16:38
Find the starting point in LL
Video
00:17:05
Length of Loop in LL
Video
00:16:00
Segrregate odd and even nodes in LL
Video
00:22:26
Delete the middle node of LL
Video
00:07:37
Remove Nth node from the back of the LL
Video
00:19:09
Check if LL is palindrome or not
Video
00:25:29
Sort a LL of 0's 1's and 2's by changing links
Video
00:22:35
Find the intersection point of 2 LL
Video
00:15:06
Add 1 to a number represented by LL
Video
00:15:16
Add 2 numbers in LL
Video
00:16:24
Learn Doubly Linked List
Introduction to DLL
Video
00:04:20
Traversal, Insertion, Deletion in a DLL
Video
00:22:48
Medium Level Problems of DLL
Reverse a DLL
Video
00:16:55
Delete all occurrences of a key in DLL
Video
00:14:07
Find pairs with given sum in DLL
Video
00:26:04
Remove duplicates from sorted DLL
Video
00:09:00
Hard problems of LL
Videos to be added soon
Bit Manipulation - Z2H
6 Learning Materials
Bit Manipulation Basics
Introduction to Bit Manipulation
Video
00:33:32
Solve basic problems
Video
00:32:50
Interview Problems
Count number of bits to be flipped to convert A to B
Video
00:09:31
Find the number that appears odd number of times
Video
00:08:02
Power Set
Video
00:14:59
Find xor of numbers from L to R
Video
00:10:50
Advance Recursion - Z2H
13 Learning Materials
Mandatory to learn
Generate all the subsequences
Video
00:35:03
Generate all subsequences with Sum = K
Video
00:32:16
Check if there exists a subsequence with sum K
Video
00:21:46
Count All Subsequences with Sum K
Video
00:23:20
Generate Subsequences Problems
Generate all binary strings
Video
00:23:20
Generate Parentheses
Video
00:24:47
Combination Sum
Video
00:23:42
Combination Sum-II
Video
00:32:27
Subset Sum-I
Video
00:15:31
Combination Sum - III
Video
00:21:03
Letter Combinations of a Phone number
Video
00:20:01
Hard problems on recursion
N Queens
Video
00:47:33
Rat in a Maze
Video
00:29:48
Stacks and Queues - Z2H
16 Learning Materials
Learn the basics
Implement Stack using Arrays
Video
00:20:17
Implement Queue using Arrays
Video
00:13:40
Deque Module
Video
00:08:53
Implement Stack using Queue
Video
00:12:10
Implement Queue using Stack
Video
00:11:40
Implementing Stack and Queue using Doubly Linked List
Video
00:08:44
Valid Parenthesis
Video
00:15:27
Implement Min Stack
Video
00:10:16
Prefix, Infix, Postfix conversions
All conversions
Video
00:45:29
Monotonic Stack/Queue Problems
Next Greater Element 1
Video
00:19:12
Next Greater Element 2
Video
00:11:52
Sum of subarray minimum
Video
00:20:32
Asteroid Collision
Video
00:17:19
Trapping Rainwater
Video
00:29:42
Sum of Subarray Minimum
Video
00:17:59
Remove K Digits
Video
00:14:25
Sliding Window and Two Pointers - Z2H
9 Learning Materials
Medium level Problems
Maximum point you can obtain from cards
Video
00:11:01
Longest Substring Without Repeating Characters
Video
00:28:08
Max Consecutive Ones III
Video
00:27:51
Fruit Into Baskets
Video
00:29:50
Binary Subarrays With Sum
Video
00:19:27
Count Number of Nice Subarrays
Video
00:04:15
Longest Substring With At Most K Distinct Characters
Video
00:21:49
Subarray With K different Integers
Video
00:08:56
Number of Substrings Containing All Three Characters
Video
00:16:32
Greedy Algorithms - Z2H
13 Learning Materials
Easy Level Problems
Assign Cookies
Video
00:12:05
Fractional Knapsack Problem
Video
00:19:12
Greedy algorithm to find minimum number of coins
Video
00:09:09
Lemonade Change
Video
00:10:16
Medium/Hard Level Problems
N meetings in one room
Video
00:14:46
Jump Game
Video
00:09:33
Jump Game 2
Video
00:21:00
Minimum Platforms
Video
00:17:42
Job Sequencing Problem
Video
00:08:31
Candy
Video
00:35:08
Program for Shortest Job First (or SJF) CPU Scheduling
Video
00:07:46
Insert Intervals
Video
00:14:06
Merge Intervals
Video
00:06:40
Binary Trees - Z2H
11 Learning Materials
Learn Traversal
Introduction to Trees
Video
00:15:43
Code Implementation of BT
Video
00:08:34
Depth First Search (DFS)
Video
00:22:35
Breadth First Search (BFS)
Video
00:11:28
Medium Level Problems
Height of a Binary Tree
Video
00:17:44
Diameter of Binary Tree
Video
00:10:27
Balanced Binary Tree
Video
00:09:18
Maximum path sum
Video
00:13:42
Top View of Binary Tree
Video
00:14:44
Bottom View of Binary Tree
Video
00:08:25
Right/Left View of Binary Tree
Video
00:19:13
Binary Search Trees - Z2H
12 Learning Materials
Introduction
Introduction to Binary Search Tree
Video
00:07:41
Search in a Binary Search Tree
Video
00:07:00
Find Min/Max in BST
Video
00:04:56
Practice Problems
Ceil in a Binary Search Tree
Video
00:09:58
Floor in a Binary Search Tree
Video
00:04:14
Insert a given Node in Binary Search Tree
Video
00:06:54
Delete a Node in Binary Search Tree
Video
00:14:09
Morris Traversal
Video
00:21:39
K-th Smallest or Largest Element
Video
00:10:28
Check if a tree is a BST or BT
Video
00:12:14
Lowest Common Ancestor in Binary Tree
Video
00:19:09
Inorder Successor in BST
Video
00:11:01
Heaps - Z2H
7 Learning Materials
Introduction to Heaps
Introduction to Priority Queues using Binary Heaps
Video
00:21:41
Heapify Algorithm
Video
00:21:33
Build heap from a given Array
Video
00:14:29
Implement Min Heap
Video
00:12:07
Implement Max Heap
Video
00:06:56
Check if an array represents a min heap
Video
00:07:16
Convert Min Heap to Max Heap
Video
00:02:09
Graphs - Z2H
43 Learning Materials
Introduction to Graphs
Graph and Types
Video
00:15:44
Graph Representation
Video
00:22:33
Connected Components
Video
00:06:29
Breadth First Search in graph
Video
00:21:23
Depth First Search in graph
Video
00:19:00
Problems based on BFS & DFS
Rotten Oranges
Video
00:29:27
Flood fill
Video
00:33:52
Cycle Detection in undirected Graph (bfs)
Video
00:21:01
Cycle Detection in undirected Graph (dfs)
Video
00:15:13
0/1 Matrix (Bfs Problem)
Video
00:25:31
Surrounded Regions (dfs)
Video
00:28:57
Number of Enclaves [flood fill implementation - multisource]
Video
00:25:12
Word Ladder - 1
Video
00:34:55
Word Ladder 2
Video
00:23:05
Number of Islands
Video
00:25:07
Number of Distinct Islands
Video
00:30:29
Bipartite Graph (DFS)
Video
00:23:31
Cycle Detection in Directed Graph (DFS)
Video
00:23:02
Topo Sort based problems
Topo Sort
Video
00:17:09
Topo Sort (BFS)
Video
00:15:13
Cycle Detection in Directed Graph (BFS)
Video
00:06:02
Course Schedule - I
Video
00:11:47
Find eventual safe states (BFS)
Video
00:19:46
Find eventual safe states (DFS)
Video
00:18:43
Alien dictionary
Video
00:07:19
Shortest Path related Problems
Shortest Path in UG with unit weights
Video
00:15:55
Shortest Path in DAG
Video
00:28:47
Dijkstras Algorithm using Priority Queue
Video
00:22:16
Dijkstras Algorithm using Set
Video
00:17:12
Why PQ and not Queue
Video
00:16:19
Print the Shortest Path in Weighted Undirected Graph
Video
00:21:19
Shortest Path in Binary Matrix
Video
00:22:12
Path With Minimum Effort
Video
00:21:45
Cheapest Flights Within K Stops
Video
00:25:15
Minimum Multiplications to reach End
Video
00:14:24
Number of Ways to Arrive at Destination
Video
00:26:38
Bellman Ford Algorithm
Video
00:25:52
Floyd Warshall
Video
00:30:15
Find the City With the Smallest Number of Neighbours at a Threshold Distance
Video
00:14:02
Minimum Spanning Tree and Disjoint Set
Minimum Spanning Tree - Theory
Video
00:06:52
Prim's Algorithm
Video
00:18:58
Disjoint Sets
Video
00:44:35
Kruskal's Algorithm
Video
00:16:09
Dynamic Programming - Z2H
11 Learning Materials
Introduction to Dynamic Programming
Introduction
Video
00:37:48
DP on 1D
Climbing Stairs
Video
00:11:00
Frog Jump
Video
00:34:58
House Robber
Video
00:29:29
House Robber II
Video
00:10:53
DP on 2D and 3D
Ninja's Training
Video
00:50:31
Unique Paths
Video
00:43:34
Unique Paths II
Video
00:09:25
Minimum path sum in Grid
Video
00:23:07
Triangle
Video
00:32:05
Minimum Falling Path Sum
Video
00:34:30
Strings - Z2H
11 Learning Materials
Easy Level Problems
Remove outermost Paranthesis
Video
00:11:49
Reverse words in a given string
Video
00:07:47
Largest odd number in a string
Video
00:07:01
Longest Common Prefix
Video
00:17:16
Isomorphic Strings
Video
00:15:53
Check whether one string is a rotation of another
Video
00:13:24
Check if two strings are anagram of each other
Video
00:15:20
Medium Level Problems
Sort Characters by frequency
Video
00:11:35
Maximum Nesting Depth of Paranthesis
Video
00:10:23
Roman Number to Integer
Video
00:12:35
Implement Atoi
Video
00:15:12
Course Instructor
/3064443-edimingle-logo-codeanddebug.png){kind=logo}
Code and Debug
246 Courses • 7348 Students
By clicking on Continue, I accept the Terms & Conditions,
Privacy Policy & Refund Policy