| 301. | Computing Connected Components of a Graph (Graphs: Algorithms & Theory) | 18:22 | |
|
| 302. | Twitch Clips - Legend of Zelda: Oracle of Seasons (Part 5), July 10, 2021 | 18:04 | | The Legend of Zelda: Oracle of Seasons
|
| 303. | Testing Set Membership and Equality of Regular Languages (Theory of Computing) | 17:59 | |
|
| 304. | Twitch Clips - Monster Hunter Rise, April 14, 2021 | 17:50 | | Monster Hunter Rise
|
| 305. | Twitch Clips - Legend of Zelda: Oracle of Ages (Part 8), August 15, 2021 | 17:43 | | The Legend of Zelda: Oracle of Ages
|
| 306. | Twitch (& Friends) Clips - Diablo II (Part 2), May 18, 2021 | 17:38 | | Diablo II
|
| 307. | Graph Terminology III: Weighted Graphs (Graphs: Algorithms & Theory) | 17:25 | |
|
| 308. | Twitch Clips - Legend of Zelda: Oracle of Seasons (Part 2), May 4, 2021 | 17:22 | | The Legend of Zelda: Oracle of Seasons
|
| 309. | Recursion: How Does It Work? | 17:13 | |
|
| 310. | Primer on Exponents and Logarithms, Proof of Power Rule of Logarithms [Big-Oh Bootcamp] | 17:10 | |
|
| 311. | Big-Theta Definition, Usage, Proving 3n^3 + 5 is Θ(n^3) | 17:03 | |
|
| 312. | Big-Oh and Bases of Logarithms [Big-Oh Bootcamp] | 16:59 | |
|
| 313. | Complement is Closed for Regular Languages (Theory of Computing) | 16:59 | |
|
| 314. | Lazy Subset Construction (for NFAs to DFAs) [Theory of Computing] | 16:53 | |
|
| 315. | Algebraic Laws of Regular Expressions and More! (Theory of Computing) | 16:53 | |
|
| 316. | Twitch Clips - Legend of Zelda: Oracle of Ages (Part 11), September 24, 2021 | 16:43 | | The Legend of Zelda: Oracle of Ages
|
| 317. | Applying the Binomial Theorem (Mathematics for Computer Science) | 16:42 | |
|
| 318. | Computing Paths Using DFS/BFS Trees (Graphs: Algorithms & Theory) | 16:30 | |
|
| 319. | Applying the Lazy Subset Construction for NFAs (to DFAs) [Theory of Computing] | 16:28 | |
|
| 320. | 4. Deterministic Lower Bound for k-Canadian Travelling (Haunted Escape) | 16:23 | |
|
| 321. | Dealing with Polynomials (Big-Oh Bootcamp) | 16:12 | |
|
| 322. | Max Rule of Big-Oh [FULL PROOF] (Big-Oh Bootcamp) | 16:11 | |
|
| 323. | Smoothness: Revisiting Harmonic Numbers (Big-Oh Bootcamp) | 16:07 | |
|
| 324. | Proving 1/n is o(1) (Little-Oh Definition Proof) | 16:06 | |
|
| 325. | Language with Prime-Length Strings is not Regular [using Pumping Lemma] (Theory of Computing) | 15:56 | |
|
| 326. | Twitch (& Friends) Clips - Diablo II (Part 7), July 28, 2021 | 15:46 | | Diablo II
|
| 327. | Testing Emptiness of a Regular Language (Theory of Computing) | 15:46 | |
|
| 328. | Product Rule of Big-Oh [FULL PROOF] (Big-Oh Bootcamp) | 15:35 | |
|
| 329. | Designing Context-Free Grammars III (Theory of Computing) | 15:34 | |
|
| 330. | Language of Palindromic Strings is not Regular (Theory of Computing) | 14:34 | |
|
| 331. | Proving log n is O(n) [Big-Oh Bootcamp] | 14:30 | |
|
| 332. | Twitch (& Friends) Clips - Diablo II (Part 9 - FINALE), August 18, 2021 | 13:45 | | Diablo II
|
| 333. | Logarithmic Bases Do Not Matter (Big-Oh Bootcamp) | 13:27 | Vlog |
|
| 334. | Multiplicative Constants Do Not Matter [FULL PROOF] (Big-Oh Bootcamp) | 13:21 | |
|
| 335. | Sum Rule of Big-Oh [FULL PROOF] (Big-Oh Bootcamp) | 13:18 | |
|
| 336. | Non-Regular Language with Equal Sums and More! (Theory of Computing) | 13:09 | |
|
| 337. | Sum of Pairs: Lucky 7 (Mathematics for Computer Science) | 13:09 | |
|
| 338. | Prove n^2 + 12n is O(n^2) [Big-Oh Bootcamp] | 12:57 | |
|
| 339. | The Formal Definition of Big-Oh and Example Proof within 13 Minutes! | 12:55 | |
|
| 340. | Twitch (& Friends) Clips - Diablo II (Part 8), August 1, 2021 | 12:50 | | Diablo II
|
| 341. | Twitch Clips - Cruis'n Blast, September 15, 2021 | 12:46 | | Cruis'n Blast
|
| 342. | Showing an Algorithm is Incorrect (Example 2) | 12:35 | |
|
| 343. | Proving Basic Exponential Claims for Big-Oh [Big-Oh Bootcamp] | 12:20 | |
|
| 344. | Twitch (& Friends) Clips - Diablo II (Part 4), June 5, 2021 | 12:13 | | Diablo II
|
| 345. | Summing Two Functions of the Same Order [Big-Oh Bootcamp] | 12:04 | |
|
| 346. | Transitivity of Big-Oh [FULL PROOF] (Big-Oh Bootcamp) | 12:04 | |
|
| 347. | Reversal of a Regular Language is Regular (Theory of Computing) | 12:03 | |
|
| 348. | Checking Solutions to Recurrence Relations (Mathematics for Computer Science) | 11:49 | |
|
| 349. | Twitch (& Friends) Clips - Diablo II (Part 3), May 29, 2021 | 11:18 | | Diablo II
|
| 350. | Logarithms Grow Slower Than Polynomials (Big-Oh Bootcamp) | 11:11 | Vlog |
|
| 351. | Big-Omega Definition, Proving log n + 2 is Ω(log n) (FULL EXAMPLE) | 11:07 | Vlog |
|
| 352. | Designing Pushdown Automata (Theory of Computing) | 11:07 | |
|
| 353. | Transitivity of Big-Oh [Big-Oh Bootcamp] | 10:57 | |
|
| 354. | Intersection and Set Difference are Closed Under Regular Languages (Theory of Computing) | 10:55 | |
|
| 355. | Generalized Pigeonhole Principle [PROOF & EXAMPLE] (Mathematics for Computer Science) | 10:48 | |
|
| 356. | Basic Exponential Big-Oh Proofs (Big-Oh Bootcamp) | 10:48 | |
|
| 357. | How Do We Know Algorithms are Incorrect? | 10:42 | |
|
| 358. | Take the Largest Function Over Functions in a Sum! [Big-Oh Bootcamp] | 10:41 | |
|
| 359. | Showing an Algorithm is Incorrect (Example 1) | 10:19 | Show |
|
| 360. | Prove 4n^4 + 3n^3 + 2n^2 + n is O(n^4) [Big-Oh Bootcamp] | 10:10 | |
|
| 361. | Designing Context-Free Grammars II (Theory of Computing) | 10:10 | |
|
| 362. | Constants Independent of the Input Do Not Matter! [Big-Oh Bootcamp] | 9:58 | |
|
| 363. | Product Rule of Big-Oh [Big-Oh Bootcamp] | 9:58 | |
|
| 364. | Language with More 0s Before Less 1s is not Regular (Theory of Computing) | 9:39 | |
|
| 365. | Big-Oh is Reflexive [FULL PROOF] (Big-Oh Bootcamp) | 9:34 | |
|
| 366. | Logarithm log base 2 of n is O(n^Ɛ) [Big-Oh Bootcamp] | 9:33 | |
|
| 367. | n^k is O(n^(k+epsilon)) (Big-Oh Bootcamp) | 9:28 | |
|
| 368. | Prove 6n^2 is O(n^2) [Big-Oh Bootcamp] | 9:18 | |
|
| 369. | Preview: Why Do We Use Programming Languages? Ft. Blotzo | 8:52 | |
|
| 370. | What is an Algorithm? | 8:44 | |
|
| 371. | Join me on Twitch! [Twitch Clips - Kirby's Dream Land, March 12, 2021] | 8:38 | | Kirby's Dream Land
|
| 372. | 2. Competitiveness of Online Algorithms (Haunted Escape) | 8:26 | |
|
| 373. | Properties of Big-Oh, Big-Oh is Reflexive [Big-Oh Bootcamp] | 8:25 | |
|
| 374. | Logarithms are Smooth [Big-Oh Bootcamp] | 8:19 | |
|
| 375. | Polynomial n^k is O(n^(k+Ɛ)) [Big-Oh Bootcamp] | 8:14 | |
|
| 376. | Testing Connectivity of a Graph (Graphs: Algorithms & Theory) | 8:09 | |
|
| 377. | Why Dijkstra's Algorithm Fails for Negative Weight Edges (Graphs: Algorithms & Theory) | 7:20 | |
|
| 378. | December 2020 Updates - New Book Available, Upcoming Teaser Content, New Mic Equipment | 7:16 | |
|
| 379. | [April Fools] How to get 100% on any Big-Oh proof claim! It's obvious! | 6:57 | |
|
| 380. | August 2021 Updates - Milestones | 6:52 | |
|
| 381. | January 2021 Updates - New Setup, Upcoming Content & More, Cute Mochi Cat Outtakes! | 6:47 | |
|
| 382. | Polynomial n^k is Smooth [Big-Oh Bootcamp] | 6:32 | |
|
| 383. | September 2021 Updates - It Keeps Rolling, Rolling, and Rolling | 6:10 | |
|
| 384. | Proving n is O(2^n) [Big-Oh Bootcamp] | 5:41 | |
|
| 385. | One Year Later... (Anniversary Video) | 5:40 | |
|
| 386. | 0. Introduction [1st Steps to Computer Programming Using Java] | 5:28 | |
|
| 387. | Burden for Problem Solving on Future Computer Scientists | 5:26 | |
|
| 388. | Updates November 2020, Shout Outs and Thank You! | 4:54 | |
|
| 389. | March 2021 Updates - Welcome to the Learning Zone, Dolly-O-Mania & More! | 4:53 | |
|
| 390. | Rows of Pascal's Triangle Sum to Powers of 2 (Mathematics for Computer Science) | 4:49 | |
|
| 391. | Sneak Peek: Rocket-Booted Bunnies and Double Hashing | 4:34 | |
|
| 392. | Constant Functions are Smooth [Big-Oh Bootcamp] | 4:23 | |
|
| 393. | April 2021 Updates - What's Next & The Quest for Lip Chap. | 4:22 | |
|
| 394. | Lecture 0: Overview [Advanced Data Structures] | 4:09 | |
|
| 395. | May 2022 Updates - Welcome to the Learning Zone 2.0 | 3:31 | Vlog |
|
| 396. | Let's Make Something New! (Spring/Summer 2023 Updates) | 3:31 | Vlog |
|
| 397. | July 2021 Updates - Stay Cool! | 2:47 | |
|
| 398. | Sneak Peek: Talking Case-Based Analysis with Lola | 2:43 | |
|
| 399. | May 2021 Updates - So Excited I Can't Breathe! | 2:37 | |
|
| 400. | Updates October 2020, Shout Outs and Thank You! | 2:29 | |
|
