Data Structures and Algorithums
Dive into the world of Data Science and Algorithms and learn how to transform raw data into meaningful insights while building strong problem-solving skills. This course covers the fundamentals of data analysis, programming, statistics, data visualization, and essential algorithms.
₹8000.00 ₹14000.00 43% OFF
/CourseBundles(77997)/20166747-DSA_-_Thumbnail.png?Expires=1820661508&Signature=dHRVPP7PPMNfvNSNyvv-HH7P--iihD4ehU1dkSHjJh5yINX-aolntLd27l15QQdlpjJrpQXHlk7MfubG~yuN-L2L9t1moF3R5RAxsJv7w3qhTEGzuop1Oeq1S9EEYmj4VOq5MO7vWdSpZ8fZamdxjGtQobU~pEG~4tjaWJgwhvvFwplxTR~GLDMjqVEEsY6I~5K7YLY3gdCAEEKwLvSZe~OU1faGzyCnnVGkfftrjPMTWFmknfzgHiu5GJVxRsuyMsAfXrjMblkZb4n99Rho7sJCgoPxcbLm~GwJXIoU9xTVyzXn383O2dL6CMPenpwYtm49xAFLTcDuJMFXgmwQVg__&Key-Pair-Id=APKAIIFZDCEANAVU2VTA)
Course Overview
Schedule of Classes
Course Curriculum
1 Subject
Data Structures and Algorithums
26 Learning Materials
Course Overview and Arrays Basics
Course Overview & Array Basics
Arrays
02 - Arrays,Memory,time Complexity Insertion and Traversal
03 Arrays, Sum, Max, Count and Concatenation
04 - Arrays - Contains Duplicate Brute Force and Logarithms Intro
Contains Duplicate - Brute Force vs Sorting vs HashSet and Big-O
05 - Contains Duplicate - Brute Force vs Sorting vs HashSet and Big-O
Two Sum - Brute Force Approach
Two Sum - Brute Force Approach
Two Sum - HashMap Optimized and Move Zeroes
Two Sum - HashMap Optimized and Move Zeroes
Move Zeroes - Two Pointer and Kth Largest Element Intro
Move Zeroes - Two Pointer and Kth Largest Element Intro
Valid Anagram - HashMap Frequency Counting
Valid Anagram - HashMap Frequency Counting
Time and Space Complexity Deep Dive - Big-O Rules
Time and Space Complexity Deep Dive - Big-O Rules
Time Complexity Part 2 - Loops, Logs and Growth Rate Comparison
Time Complexity Part 3 and Binary Search Introduction
Time and Space Complexity Practice Quiz
Patterns
Pattern Programs - Star and Number Patterns
Pattern Programs - Triangles, Numeric and Alphabet Patterns
Advanced Patterns - Pyramids, Diamonds and Hollow Shapes
Hollow Patterns, Floyds and Pascals Triangle, Math Logic
Advanced Patterns - Butterfly, X-Pattern and Hourglass
Pattern Finale - Diagonal, Zigzag and Matrix Logic
Recap
Recap - Two Pointer, Sliding Window, Max Subarray, Reverse Array, Anagram
Recursion Intro, Number Logic and OOP Basics
Recursion Intro, Number Logic and OOP Basics
Maximum Subarray - Kadanes Algorithm
Maximum Subarray - Kadanes Algorithm
Remove Duplicates from Sorted Array
Remove Duplicates from Sorted Array
Best Time to Buy and Sell Stock, Valid Palindrome
Best Time to Buy and Sell Stock, Valid Palindrome
Valid Palindrome Recap and Longest Substring Without Repeating Characters
Valid Palindrome Recap and Longest Substring Without Repeating Characters
Container With Most Water and System Design Basics
Container With Most Water and System Design Basics
Course Instructor
Pradeep
35 Courses • 13 Students
By clicking on Continue, I accept the Terms & Conditions,
Privacy Policy