ViewTube

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

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

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

Stop struggling with recursion! This video introduces the "Recursive Leap of Faith" — a powerful mental model that makes ...

In this video, we dive deep into the concept of Recursive Binary Search using Python. You will learn: * What Binary Search ...

Navigating Graphs with Depth First Search (DFS)! This is the next video in our Python Graph Series. In the previous one, we ...

Frog leap puzzle with DFS and Python - Minimal path and clean logic: In this video we solve teh classic "frog leap" puzzle, using ...

Master the Power Set problem using two different recursive approaches! This video breaks down the exact thought process for ...

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

If you solve Reconstruct Itinerary by greedily taking the lexically smallest airport from left to right, you walk straight into the trap.

Sorting feels solved because every language ships a built-in. Then a multi-key pipeline silently shuffles records, or a 10x ...

Since in PDSA, in the first week we are just discussing basic python from the next week. Onwards will be discussing algorithms.

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

Okay, that's the algorithm. Does the table. Let me just put the table, the column header are done. Not not, I don't want Tab. So is it ...

Master the Depth-First Search (DFS) algorithm — a core graph traversal technique used in countless computer science problems.

If recursion still feels “mystical,” this video makes it crystal clear. We break down what recursion really is, how a function actually ...

Welcome to Techie Uday's Full Course on Data Structures and Algorithms (DSA) — a modern, visual, and practical way to master ...

This backtracking is done and it is it finally reaches the first function call. So at that point this solver will give the actual cost that is ...

Recursion looks clean until the call stack becomes a receipt for every call that has not returned yet. This episode makes recursion ...

Two functions. Both walk a million numbers and add them up. Both obviously O(n). One finishes in fifty milliseconds. The other ...