ViewTube

All JomaClass videos from 2020 are now free to watch. If you enjoy please consider donating here: https://support.joma.io/ This ...

Unstop Problem of the Day – 10/1/2026 In this video, we solve the “Tree Harmony Street” problem step by step using a Greedy ...

For more information about Stanford's Artificial Intelligence professional and graduate programs, visit: https://stanford.io/ai To learn ...

... The Greedy Trap Example 00:10:15 Solution 1: The Epsilon-Greedy Algorithm 00:15:38 The Learning Engine: The Incremental ...

Easiest Way to solve Binary Tree Cameras leetcode problem using a greedy postorder Depth First Search approach. This is a ...

Want to make real money with coding? I share high-signal insights on careers, monetization, and leverage in my free newsletter.

From raw text to beautiful graphs with Python! Imagine seeing something like that: ``` A B 1 A C 5 A D 2 B E 1 E F 1 F P 50 ``` and ...

Watch an AI learn to play Snake from ZERO — no pre-training, no shortcuts. Built entirely from scratch using Python, Pygame, and ...

All JomaClass videos from 2020 are now free to watch. If you enjoy please consider donating here: https://support.joma.io/ This ...

AlphaZero shows amazing performance and creativity, but how does it actually work? This video explains the surprisingly simple ...

This is Part 6 (and last) of our Python Graph series. In the last video, we built the A* (A-Star) algorithm, which is perfect, but ...

Understanding the theory of decision trees. This video is available as an article: https://mouseml.github.io/blog/2025/11/29 ...

How do LLMs actually choose the next token? In this video I explore: - logits - probabilities - logprobs - decoding and also why ...

In this session we finish considerations from HW#1 and pivot to review of algorithms for adversarial search with a focus on ...

Short-sightedness doesn't always lead to failure! In the world of Computer Science, sometimes grabbing the "immediate benefit ...

My attempt at solving the 3x3 Rubik's cube (by programming the computer to do it for me). Note: in the evaluation function at 22:32 ...

You write `users[email]` and your code finds the matching record instantly, even if the table holds a million entries or a billion.

After that, some algorithm strategies are started. That is greedy strategy. Divided in conquer and dynamic nutanix. These are ...

There are many options: greedy algorithms, (meta)heuristics, MIP solvers (potentially with GPU support), quantum technology, ...