Space Complexity Courses and Certifications

A Practical Guide to Algorithms with JavaScript

Learn to solve algorithms and analyze them efficiently in both an interview setting and also in your day-to-day development.

• Frontend Masters
• 4-5 hours
• On-Demand
• Paid Course

Keith Galli

Solving Coding Interview Questions in Python on LeetCode - Easy and Medium Problems

Comprehensive guide to solving eight LeetCode coding problems in Python, covering various algorithms and data structures. Ideal for interview preparation and improving problem-solving skills.

• YouTube
• 1 hour 39 minutes
• On-Demand
• Free Online Course

Strange Loop Conference

Declarative APIs in an Imperative World

Explore integrating imperative APIs with declarative UI frameworks, addressing challenges and solutions in modern web development while considering historical software trends.

• YouTube
• 36 minutes
• On-Demand
• Conference Talk

Association for Computing Machinery (ACM)

Nearly Optimal Static Las Vegas Succinct Dictionary

Explore advanced data structures for efficient dictionary operations, focusing on succinct representations and optimizing space usage for various input types.

• YouTube
• 25 minutes
• On-Demand
• Free Online Course

Ryan O'Donnell

Undergrad Complexity at CMU - Savitch's Theorem and NL

Explore Savitch's Theorem and NL in computational complexity theory, focusing on space complexity, recursion, and pseudocode implementation for advanced undergraduate-level understanding.

• YouTube
• 1 hour 21 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 Online Course

Hausdorff Center for Mathematics

Matthias Mnich - Time- and Space-Optimal Algorithms for the Many-Visits TSP

Optimizing algorithms for the many-visits TSP problem, improving time and space complexity while maintaining logarithmic dependence on tour length. Discusses applications and compares with previous work.

• YouTube
• 28 minutes
• On-Demand
• Free Online Course

IEEE

Polynomial Calculus Space and Resolution Width

Explore proof complexity, resolution systems, and space complexity in polynomial calculus, featuring combinatorial characterizations and discussions on total spaces and tight bounds.

• YouTube
• 22 minutes
• On-Demand
• Conference Talk

Simple Snippets

Shell Sort Algorithm - Theory, Working, and Pseudocode with Example - Part 1

Comprehensive tutorial on Shell Sort algorithm, covering theory, working principles, pseudocode, and examples. Explains efficiency, time complexity, and step-by-step implementation.

• YouTube
• 44 minutes
• On-Demand
• Free Online 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 Online Course

Kunal Kushwaha

Quick Sort Using Recursion - Theory, Complexity, Code

Comprehensive guide to Quick Sort algorithm, covering theory, implementation, complexity analysis, and comparisons with other sorting methods. Includes code examples and practical insights.

• YouTube
• 42 minutes
• On-Demand
• Free Online Course

Kunal Kushwaha

Merge Sort Using Recursion - Theory, Complexity, Code

Comprehensive exploration of merge sort algorithm, covering theory, recursive implementation, complexity analysis, and in-place sorting approach. Ideal for mastering this efficient sorting technique.

• YouTube
• 50 minutes
• On-Demand
• Free Online Course

Simple Snippets

Adjacency Matrix in Graph Data Structure - Graph Implementation

Learn to represent graphs using adjacency matrices, including their definition, implementation, and time/space complexity analysis. Gain practical insights for efficient graph data structure usage.

• YouTube
• 22 minutes
• On-Demand
• Free Online Course

IEEE

Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems

Explore multi-pass graph streaming lower bounds for cycle counting, MAX-CUT, matching size, and related problems in this advanced computer science presentation.

• YouTube
• 21 minutes
• On-Demand
• Free Online Course

Ruby Central

Computer Science You Might Not Want to Know

Explore the relevance of Computer Science topics for Rails developers, examining their practical applications and potential limitations in day-to-day work.

• YouTube
• 30 minutes
• On-Demand
• Conference Talk