ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

614 results

Lex Fridman
AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory | Lex Fridman Podcast #503

Ankur Moitra, Steven Brunton and Alex Kontorovich are three mathematicians who can speak to this incredible moment in the ...

3:34:27
AI Crisis in Math: Navier-Stokes, Riemann Hypothesis & Complexity Theory | Lex Fridman Podcast #503

155,836 views

5h ago

Sophie Huiberts
Analyzing the Simplex Method By-the-Book

This video presentation is for the paper Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book by Eleon Bach, ...

21:34
Analyzing the Simplex Method By-the-Book

1,026 views

15h ago

SpeculatorSeth Day Trading
26 Oct 2026 Treasury Futures Day Trading Order Flow Live

Live for 8 years—deep dives into order flow, treasury futures, and complexity economics. New premium $3 / month discord: ...

1:27:22
26 Oct 2026 Treasury Futures Day Trading Order Flow Live

182 views

Streamed 14h ago

James Peralta
I Built a Voice-to-Voice AI Coding Interviewer

... Defining the hash map invariant 06:32 Coding the solution live 08:36 All tests pass — complexity analysis 09:08 The AI debrief, ...

10:36
I Built a Voice-to-Voice AI Coding Interviewer

975 views

8h ago

Deep Space News
James Webb Just Found Something Impossible About Dark Energy — Scientists Are Stunned

The James Webb Space Telescope has captured data that challenges our understanding of space. We examine what these ...

30:10
James Webb Just Found Something Impossible About Dark Energy — Scientists Are Stunned

7,469 views

6h ago

codewithyash
The Easiest Way to Solve LeetCode 3619 (Count Islands Divisible by K)

Time and space complexity analysis for our optimal solution. Timestamps: 0:00 - The Problem Breakdown 2:15 - The Core Logic: ...

9:08
The Easiest Way to Solve LeetCode 3619 (Count Islands Divisible by K)

2 views

22h ago

Fred Boundou
Big O Notation Explained: When O(log n) Runs 3x Slower Than O(n) #education

Two functions. One is O(n). The other is O(log n), vastly better on paper. On real hardware, with real data, the "worse" one runs ...

14:22
Big O Notation Explained: When O(log n) Runs 3x Slower Than O(n) #education

15 views

14h ago

Goodly
Data Modeling for Budget vs Actual in Power BI

If your company needs help building professional Power BI reports like this, fill out this form and our team will get in touch: ...

34:41
Data Modeling for Budget vs Actual in Power BI

6,937 views

15h ago

Security Cryptography Whatever
Everybody Is Losing Their Minds About AI Math And Crypto

The gang talks about what AI getting Good At Math might mean for cryptography, and why public-key cryptography probably isn't ...

51:16
Everybody Is Losing Their Minds About AI Math And Crypto

112 views

2h ago

Krushna Mengal
🔥 LeetCode 3963 – Create Grid With Exactly One Path | C++ Solution #dsa #leetcode

Complexity Analysis Time Complexity: O(m × n) — initializing the grid takes O(m × n) time. Space Complexity: O(m × n) — storing ...

0:36
🔥 LeetCode 3963 – Create Grid With Exactly One Path | C++ Solution #dsa #leetcode

1 view

1h ago

Raj Code's | CP | DSA
Dynamic Programming for Beginners | Part 2 | LeetCode 50 – Pow(x, n) | Recursion | Java

... Complexity Analysis ✓ Solving the Problem in Java ⏳ Complexity Analysis: - Time Complexity: O(log |N|) - Space Complexity: ...

6:31
Dynamic Programming for Beginners | Part 2 | LeetCode 50 – Pow(x, n) | Recursion | Java

10 views

16h ago

The Computer Layer
Bias-Variance Tradeoff Explained | Machine Learning for Beginners

Why do some machine learning models oversimplify problems while others learn the training data too closely? The answer is ...

7:35
Bias-Variance Tradeoff Explained | Machine Learning for Beginners

17 views

18h ago

SCIENCE IN FRONT OF YOU
Intersection of Two Linked Lists | GFG Solution in C++ | Hashing Approach

The video covers the intuition, algorithm, dry run, time complexity analysis, and complete C++ implementation. Topics Covered: ...

0:36
Intersection of Two Linked Lists | GFG Solution in C++ | Hashing Approach

2 views

18h ago

codecraft
Day 25: Matrix Boundary Coordinates & Layered Peeling | Java Placement Roadmap

Boundary Edge Cases & Placement Interview Answering Strategy 05:27 - Complexity Analysis & Placement Roadmap ...

6:23
Day 25: Matrix Boundary Coordinates & Layered Peeling | Java Placement Roadmap

1 view

22h ago

클래식 음악의 설명과 분석
Sergei Prokofiev: Piano Concerto No. 4 in B♭ Major, Op. 53 “for the left hand”-IV. Vivace/ Analysis

Sergei Prokofiev: Piano Concerto No. 4 in B♭ Major, Op. 53 “for the left hand”-IV. Vivace, B♭ Major, 2/4 Meter, Modified Ternary ...

1:39
Sergei Prokofiev: Piano Concerto No. 4 in B♭ Major, Op. 53 “for the left hand”-IV. Vivace/ Analysis

29 views

15h ago

Raj Code's | CP | DSA
Dynamic Programming (DP) for Beginners | Part 1 | Recursion Basics + Fibonacci Number | LeetCode 509

... Internally ✓ Fibonacci Number Using Recursion ✓ LeetCode 509 – Fibonacci Number ✓ Time and Space Complexity Analysis ...

12:15
Dynamic Programming (DP) for Beginners | Part 1 | Recursion Basics + Fibonacci Number | LeetCode 509

22 views

16h ago