| 201. | Join me on Twitch! [Twitch Clips - Kirby's Dream Land, March 12, 2021] | 33 | | Kirby's Dream Land
|
| 202. | Hashing: Fundamentals and Algorithms | 33 | |
|
| 203. | May 2022 Updates - Welcome to the Learning Zone 2.0 | 32 | Vlog |
|
| 204. | Big-Oh Bootcamp (Fun with Logarithms) - July 26, 2022 | 32 | Vlog |
|
| 205. | Introduction to Mathematical Sequences, and How to Derive a Sequence | 32 | |
|
| 206. | Dijkstra's Algorithm WITH FULL EXAMPLE (Graphs: Algorithms & Theory) | 31 | |
|
| 207. | Twitch Clips - Legend of Zelda: Oracle of Seasons, April 13, 2021 | 31 | | The Legend of Zelda: Oracle of Seasons
|
| 208. | Lecture 12: More on Open Addressing, Linear Probing, Double Hashing [Advanced Data Structures] | 31 | |
|
| 209. | RM of Springfield Planning Meeting April 24, 2025 (Zoom Footage) | 31 | |
|
| 210. | Big-Oh Definition, Proving 2n-1 is O(n) (FULL EXAMPLE) | 31 | |
|
| 211. | Happy Summer from PageWizard GL&E | 31 | |
|
| 212. | August 2021 Updates - Milestones | 30 | |
|
| 213. | Dan Plays Mega Man IV (Gameboy)! [COME JOIN THE FUN] | 30 | | Mega Man IV
|
| 214. | Learn & Have Fun [Sequences, Summations, Induction, Legend of Zelda: Link's Awakening DX] | 30 | | The Legend of Zelda: Link's Awakening
|
| 215. | March 2021 Updates - Welcome to the Learning Zone, Dolly-O-Mania & More! | 30 | |
|
| 216. | Transducers Examples - Copying Data (Theory of Computing) | 30 | |
|
| 217. | Borrowing By-Law Presentation and Discussion - RM of Springfield Feb 18, 2025 Council Meeting | 30 | |
|
| 218. | Computing Connected Components of a Graph (Graphs: Algorithms & Theory) | 30 | |
|
| 219. | Polynomial n^k is O(n^(k+Ɛ)) [Big-Oh Bootcamp] | 30 | |
|
| 220. | Dan Longplays Mega Man V (Casual) | 30 | | Mega Man V
|
| 221. | What's with Zero? O(0)? O(1)? Is O(0) = O(1)? | 30 | |
|
| 222. | Pigeonhole Principle and Averaging Principle (Mathematics for Computer Science) | 30 | |
|
| 223. | Dan Plays Legend of Zelda: Link's Awakening DX | 29 | | The Legend of Zelda: Link's Awakening
|
| 224. | Twitch Clips - Mega Man 4 (RACE VS. TOR ASBJOERN,) December 26, 2021 | 29 | |
|
| 225. | Logarithms are Smooth [Big-Oh Bootcamp] | 29 | |
|
| 226. | Cycle Detection and Path Finding (Graphs: Algorithms & Theory) | 29 | |
|
| 227. | n Choose k Equals n Choose n-k | 29 | |
|
| 228. | September 2021 Updates - It Keeps Rolling, Rolling, and Rolling | 29 | |
|
| 229. | Big-Oh Bootcamp - Short Stream (to be continued) | 29 | |
|
| 230. | Breadth-First Search (Graphs: Algorithms & Theory) | 29 | |
|
| 231. | Smooth Functions (Big-Oh Bootcamp) | 29 | |
|
| 232. | Dan Plays Chrono Trigger (April 20, 2023) | 29 | Let's Play | Chrono Trigger
|
| 233. | Introduction to Context-Free Grammars and Languages (Theory of Computing) | 29 | |
|
| 234. | Dan Plays Monster Hunter Rise (April 30, 2022) | 29 | Let's Play | Monster Hunter Rise
|
| 235. | Transducers Example - Capitalization (Theory of Computing) | 29 | |
|
| 236. | Discrete Structures - 5. Counting | 29 | |
|
| 237. | Multiplication Principle, Number of Ordered Sequences with Repeats (Maths for Computer Science) | 28 | |
|
| 238. | log n is O(n) [FULL PROOF] (Big-Oh Bootcamp) | 28 | Vlog |
|
| 239. | Testing Emptiness of a Regular Language (Theory of Computing) | 28 | |
|
| 240. | May 2021 Updates - So Excited I Can't Breathe! | 28 | |
|
| 241. | Proving Correctness of DFAs via State Invariants [FULL EXAMPLE] (Theory of Computing) | 28 | |
|
| 242. | Happy Canada Day! | 28 | |
|
| 243. | What is a Hash Function? (Hashing: Fundamentals and Algorithms) | 27 | |
|
| 244. | Sum of Pairs: Lucky 7 (Mathematics for Computer Science) | 27 | |
|
| 245. | Single Exponents in Logarithms [Big-Oh Bootcamp] | 27 | |
|
| 246. | Binary Search Algorithm (Searching: Algorithms & Lower Bounds) | 27 | |
|
| 247. | Generalization of Max Rule for Big-Oh [Big-Oh Bootcamp] | 27 | |
|
| 248. | Big-Oh and Bases of Logarithms [Big-Oh Bootcamp] | 26 | |
|
| 249. | Converting Regular Expressions to ε-NFAs - Thompson's Construction (Kleene's Theorem (Part 1)) | 26 | |
|
| 250. | Twitch Clips - Legend of Zelda: Oracle of Ages (Part 13), October 8, 2021 | 26 | | The Legend of Zelda: Oracle of Ages
|
| 251. | Big-Omega Definition, Proving log n + 2 is Ω(log n) (FULL EXAMPLE) | 26 | Vlog |
|
| 252. | Solving Recurrence Relations via Iteration | 26 | |
|
| 253. | Pumping Lemma for Regular Languages: A Gentle Introduction (Theory of Computing) | 25 | |
|
| 254. | Exponents and Logarithms [Mathematics for CS] | 25 | |
|
| 255. | What is an Algorithm? | 25 | |
|
| 256. | Multiplicative Constants Do Not Matter [FULL PROOF] (Big-Oh Bootcamp) | 25 | |
|
| 257. | Testing Set Membership and Equality of Regular Languages (Theory of Computing) | 24 | |
|
| 258. | Testing Connectivity of a Graph (Graphs: Algorithms & Theory) | 23 | |
|
| 259. | Big-Oh Bootcamp (Smoothness) - July 12, 2022 | 23 | |
|
| 260. | Minimum Spanning Trees and the Cut Property, Taking Your Questions! | 23 | |
|
| 261. | Dan Longplays Xenoblade Chronicles 2 #15 | 23 | | Xenoblade Chronicles 2
|
| 262. | Proving 1/n is o(1) (Little-Oh Definition Proof) | 23 | |
|
| 263. | Dan Longplays Xenoblade Chronicles 2 #7 | 23 | | Xenoblade Chronicles 2
|
| 264. | Dealing with Polynomials (Big-Oh Bootcamp) | 23 | |
|
| 265. | Dan Plays Romancing SaGa 2: Revenge of the Seven (Part 1) | 22 | | Romancing SaGa 2: Revenge of the Seven
|
| 266. | Polynomial n^k is Smooth [Big-Oh Bootcamp] | 22 | |
|
| 267. | Proving 1 + 2 + 3 + … + n = n(n+1)/2 using Mathematical Induction | 22 | |
|
| 268. | Recursion: How Does It Work? | 22 | |
|
| 269. | Equivalence of Deterministic and Nondeterministic Finite Automata | 22 | |
|
| 270. | Designing Context-Free Grammars I (Theory of Computing) | 22 | |
|
| 271. | Big-Oh is Reflexive [FULL PROOF] (Big-Oh Bootcamp) | 22 | |
|
| 272. | Dan Longplays Xenoblade Chronicles 2 #2 | 22 | | Xenoblade Chronicles 2
|
| 273. | "Has All of Council Read the By-Law?"(Short Version) RM of Springfield, Council Meeting Dec 17, 2024 | 22 | |
|
| 274. | Dan Longplays Xenoblade Chronicles 2 #6 | 22 | | Xenoblade Chronicles 2
|
| 275. | Lazy Subset Construction for ε-NFAs (Converting ε-NFAs to DFAs) [Theory of Computing] | 22 | |
|
| 276. | Single-Source Shortest Path Problem (Graphs: Algorithms & Theory) | 22 | |
|
| 277. | 5. Myopic and Comparison Strategies for k-Canadian Travelling (Haunted Escape) | 21 | |
|
| 278. | Checking Solutions to Recurrence Relations (Mathematics for Computer Science) | 21 | |
|
| 279. | Sneak Peek: Talking Case-Based Analysis with Lola | 21 | |
|
| 280. | Dan Longplays Xenoblade Chronicles 2 #3 | 21 | | Xenoblade Chronicles 2
|
| 281. | Graph Terminology III: Weighted Graphs (Graphs: Algorithms & Theory) | 20 | |
|
| 282. | Large (Enough) Groups and the Pigeonhole Principle (Mathematics for Computer Science) | 20 | |
|
| 283. | What are Regular Expressions? (Theory of Computing) | 20 | |
|
| 284. | Twitch Clips - Monster Hunter Rise, April 14, 2021 | 20 | | Monster Hunter Rise
|
| 285. | Designing Regular Expressions [FULL EXAMPLES] (Theory of Computing) | 20 | |
|
| 286. | Computing Paths Using DFS/BFS Trees (Graphs: Algorithms & Theory) | 20 | |
|
| 287. | Language with More 0s Before Less 1s is not Regular (Theory of Computing) | 20 | |
|
| 288. | Happy Halloween 2023 #halloween2023 | 20 | |
|
| 289. | Lazy Subset Construction (for NFAs to DFAs) [Theory of Computing] | 19 | |
|
| 290. | Intersection and Set Difference are Closed Under Regular Languages (Theory of Computing) | 19 | |
|
| 291. | Dan Plays Pokemon Scarlet (January 6, 2023) | 19 | | Pokémon Scarlet and Violet
|
| 292. | Dan Longplays Xenoblade Chronicles 2 #5 | 19 | | Xenoblade Chronicles 2
|
| 293. | Dan Plays Mega Man 6 (October 7, 2023) | 19 | Let's Play | Mega Man 6
|
| 294. | n^k is O(n^(k+epsilon)) (Big-Oh Bootcamp) | 19 | |
|
| 295. | Dan Longplays Xenoblade Chronicles 2 #10 | 19 | | Xenoblade Chronicles 2
|
| 296. | Primer on Exponents and Logarithms, Proof of Power Rule of Logarithms [Big-Oh Bootcamp] | 19 | |
|
| 297. | Designing Context-Free Grammars II (Theory of Computing) | 19 | |
|
| 298. | Counting Reachable Vertices and Edges (Graphs: Algorithms & Theory) | 19 | |
|
| 299. | Formal Definition of Computing for DFAs (Theory of Computing) | 19 | |
|
| 300. | Product Rule of Big-Oh [FULL PROOF] (Big-Oh Bootcamp) | 18 | |
|
