Space Complexity Courses and Certifications

Simons Institute

Tight Space Complexity of the Coin Problem

Explore the space complexity of the coin problem, focusing on distinguishing biased coins. Learn about tight thresholds and new combinatorial techniques for analyzing branching programs.

• YouTube
• 52 minutes
• On-Demand
• Free Video

Time and space complexity analysis (big-O notation)

232 ratings at Udemy

Learn how to analyze the time complexity and the space complexity of an algorithm by using the big O notation

• Udemy
• 7 hours 35 minutes
• On-Demand
• Paid Course

Back To Back SWE

Time and Space Complexity

Master asymptotic analysis with Big O, Omega, and Theta notations to evaluate algorithm efficiency and understand logarithmic time complexities in computer science.

• YouTube
• 1 hour 4 minutes
• On-Demand
• Free Video

CodeHelp - by Babbar

Time and Space Complexity - How to Avoid Time Limit Exceeded

Learn time and space complexity concepts to optimize code performance and avoid time limit exceeded errors. Includes practical examples and problem-solving techniques.

• YouTube
• 29 minutes
• On-Demand
• Free Video

Simons Institute

Streaming Lower Bounds for the Needle Problems

Exploring tight lower bounds for frequency estimation in random order data streams, focusing on the needle problem and its implications for streaming algorithm design.

• YouTube
• 44 minutes
• On-Demand
• Free Video

Simons Institute

Pseudorandom Hashing for Space-Bounded Computation with Applications in Streaming

Explores a new pseudorandom generator for space-bounded computation, improving update time in streaming algorithms without sacrificing space. Applications in Fp estimation and CountSketch are discussed.

• YouTube
• 57 minutes
• On-Demand
• Free Video

Fields Institute

How to Reuse Space

Discover efficient space reuse techniques and optimization strategies in computational complexity theory through expert analysis and practical applications.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

Centre for Networked Intelligence, IISc

Designing Robust Algorithms for Data Streams with Adversarial Generation

Explore advanced techniques for designing robust streaming algorithms that maintain accuracy even under adversarial data manipulation, focusing on Missing Item Finding and graph coloring challenges.

• YouTube
• 1 hour 15 minutes
• On-Demand
• Free Video

Python Data Structures & Algorithms + LEETCODE Exercises

16003 ratings at Udemy

DSA + LEETCODE for Coding Interviews — Clear, Step-by-Step Animated Walkthroughs!

• Udemy
• 10 hours 18 minutes
• On-Demand
• Paid Course

Java Data Structures & Algorithms + LEETCODE Exercises

13768 ratings at Udemy

DSA + LEETCODE for Coding Interviews — Clear, Step-by-Step Animated Walkthroughs!

• Udemy
• 11 hours 7 minutes
• On-Demand
• Paid Course

The Complete Data Structures and Algorithms Course in Python

11181 ratings at Udemy

100+ DSA Interview Questions for Cracking FAANG with Animated Examples for Deeper Understanding and Faster Learning

• Udemy
• 1 day 22 hours 33 minutes
• On-Demand
• Paid Course

Simple Snippets

Space Complexity of Algorithms - Calculation and Analysis

Learn to calculate and understand space complexity in algorithms, including auxiliary space, big O notation, and practical examples for various algorithm types.

• YouTube
• 28 minutes
• On-Demand
• Free Video

CodeHelp - by Babbar

Time and Space Complexity of Recursive Algorithms - C++ Placement Course

Comprehensive guide to analyzing time and space complexities of recursive algorithms in C++, with practical examples and homework assignments for reinforced learning.

• YouTube
• 49 minutes
• On-Demand
• Free Video

Data Structures and Algorithms

Master essential data structures and algorithms through hands-on challenges, covering Big O, recursion, sorting, searching, and key structures like trees and graphs for coding interviews.

• Scrimba
• 2 hours 28 minutes
• On-Demand
• Free Online Course

Ryan O'Donnell

Hierarchy Theorems - Time, Space, and Nondeterministic: Graduate Complexity Lecture at CMU

Explore hierarchy theorems in computational complexity, covering time, space, and nondeterministic aspects. Gain insights into encoding schemes, Turing machines, and nondeterministic certificates.

• YouTube
• 1 hour 21 minutes
• On-Demand
• Free Video