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.
$37.49 $74.99 50% OFF
/CourseBundles(45162)/3142819-python-dsa.png)
Course Overview
Schedule of Classes
Course Curriculum
12 Subjects
Important Links
1 Learning Materials
Get all the important links
DSA Roadmap
Basics of programming - Z2H
17 Learning Materials
Time and Space Complexity
What is Time and Space Complexity?
What is Time Limit Exceeded error?
Time Complexity of common python operations
Basic Maths Logic Buildup
Extraction of Digits
Count Digits in an Integer
Check if a Digit is a Palindrome
Armstrong Number
Print factors/divisors of a number
Recursion Basics
Theory - What is Recursion?
Recursion using Parameters
Parameterized vs Functional Recursion
Factorial of a number using Recursion
Reverse an Array
Check if String is palindrome
Find the Fibonacci number
Hashing
[Pre Requirement] How to store frequency
Learn basics of hashing
Sorting Algorithms - Z2H
Array/List Problems - Z2H
6 Learning Materials
Easy
Medium
Hard
3Sum Problem - Leetcode 15
Largest Subarray with 0 Sum
Merge Overlapping Subintervals - Leetcode 56
Merge two sorted arrays without extra space
Find the repeating and missing numbers
Pascal's Triangle
Binary Search - Z2H
2 Learning Materials
Binary Search on Answers
Split array - Largest Sum
Painter's partition
Strings - Z2H
11 Learning Materials
Easy Level Problems
Remove outermost Paranthesis
Reverse words in a given string
Largest odd number in a string
Longest Common Prefix
Isomorphic Strings
Check whether one string is a rotation of another
Check if two strings are anagram of each other
Medium Level Problems
Sort Characters by frequency
Maximum Nesting Depth of Paranthesis
Roman Number to Integer
Implement Atoi
Linked List (Single LL, Double LL) - Z2H
Bit Manipulation - Z2H
6 Learning Materials
Bit Manipulation Basics
Introduction to Bit Manipulation
Solve basic problems
Interview Problems
Count number of bits to be flipped to convert A to B
Find the number that appears odd number of times
Power Set
Find xor of numbers from L to R
Advance Recursion - Z2H
Stacks and Queues - Z2H
Sliding Window and Two Pointers - Z2H
Greedy Algorithms - Z2H
11 Learning Materials
Easy Level Problems
Assign Cookies
Fractional Knapsack Problem
Greedy algorithm to find minimum number of coins
Lemonade Change
Medium/Hard Level Problems
N meetings in one room
Jump Game
Jump Game 2
Minimum Platforms
Job Sequencing Problem
Candy
Program for Shortest Job First (or SJF) CPU Scheduling
Course Instructor
/3064443-edimingle-logo-codeanddebug.png){kind=logo}
Code and Debug
150 Courses • 41560 Students
By clicking on Continue, I accept the Terms & Conditions,
Privacy Policy & Refund Policy