ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

332 results

Cloud X Berry
5 DSA Patterns That Solve 90% of Coding Problems

In this video, Cloud X Berry explains five coding patterns in a simple and beginner-friendly way. Two people get the same ...

5:14
5 DSA Patterns That Solve 90% of Coding Problems

4,024 views

20 hours ago

Gulshan-07
Algorithms Important Problems | Multistage Graph, 8 Queens, Hamiltonian, Dijkstra,  BFS & DFS

Algorithms Important Problems | Complete Exam Preparation इस वीडियो में Algorithm के सबसे important and ...

31:50
Algorithms Important Problems | Multistage Graph, 8 Queens, Hamiltonian, Dijkstra, BFS & DFS

4 views

18 hours ago

The Logic Blueprint
You’re Not Solving 3 Problems—It’s One Graph (BFS Explained)
4:58
You’re Not Solving 3 Problems—It’s One Graph (BFS Explained)

0 views

0

Leetcode Daily
1520. Maximum Number of Non-Overlapping Substrings | Leetcode Daily - Python

In this video, we tackle LeetCode 1520, Maximum Number of Non-Overlapping Substrings! This hard string problem can be tricky, ...

6:37
1520. Maximum Number of Non-Overlapping Substrings | Leetcode Daily - Python

81 views

7 hours ago

Manning Publications
Fabulous Adventures in Data Structures and Algorithms

Legendary language designer Eric Lippert guides us with a refreshing, conversational approach, providing beautifully practical ...

Upcoming
Fabulous Adventures in Data Structures and Algorithms

0 views

0

Hornbill Coding Society
Roman to Integer #dsa

Roman to Integer in C++ | LeetCode #13 | Easy DSA Problem Explained** How does **"IV" become 4** and **"IX" become 9?

18:19
Roman to Integer #dsa

7 views

19 hours ago

Computational Geometry
The Minimum Dominating Set Problem on Bipartite Circle Graphs: Complexity and Approximation

Speaker: Karim Abu-Affash (Shamoon College of Engineering) Abstract: A circle graph is the intersection graph of a set of chords ...

1:02:55
The Minimum Dominating Set Problem on Bipartite Circle Graphs: Complexity and Approximation

4 views

4 hours ago

Code With Swastik
Let's Talk | Late Night DSA Grind 🧿🚀 |  LIVE 🔴

Watch as I break down each problem from scratch — thought process, brute force, and optimal solutions — perfect for placement ...

1:08:28
Let's Talk | Late Night DSA Grind 🧿🚀 | LIVE 🔴

3,004 views

Streamed 13 hours ago

Глеб Михайлов | Алгоритмы и структуры данных
How to Solve Algorithmic Problems So You Remember Them Forever

👇 Get the session and task tracker in the bot https://t.me/leetcode_with_gleb_bot?start=treker Learn how to solve algorithmic ...

18:06
How to Solve Algorithmic Problems So You Remember Them Forever

2,000 views

18 hours ago

LindorCodes
LeetCode 134 Gas Station: O(N) Greedy Walkthrough with Dry Run

https://leetcode.com/problems/gas-station/ Four gas stations, one running sum, and a greedy trick that solves the whole problem in ...

10:36
LeetCode 134 Gas Station: O(N) Greedy Walkthrough with Dry Run

4 views

13 hours ago

Insiders: The TV Podcast
5 Problems with the Harry Potter Reboot

Is the Harry Potter series arriving too soon? TV insiders Peter Fincham and Jimmy Mulville examine why HBO is returning to ...

31:37
5 Problems with the Harry Potter Reboot

88 views

3 hours ago

Problemist
Combinatorics Algorithm | Day 12 | DSA in Java | Placement Preparation | C++

In this video, we explore Combinatorics, an important concept used in DSA and competitive programming to solve problems ...

21:21
Combinatorics Algorithm | Day 12 | DSA in Java | Placement Preparation | C++

1 view

11 hours ago

Technophilia
Regression Algorithm Verses Naive Bayes Algorithm

Want to understand the difference between Regression and Naive Bayes algorithms in machine learning?

7:01
Regression Algorithm Verses Naive Bayes Algorithm

0 views

6 minutes ago

HiClavero
I Visited the Island Where the World's Future Is Made

We tour Taiwan and look back at my return to New York, where I got a firsthand look at the new features of the Google Pixel 11 ...

20:49
I Visited the Island Where the World's Future Is Made

656,576 views

17 hours ago

Diana Pinto
🔙 BACKTRACKING: THE ALGORITHM THAT SOLVES SUDOKUS

🔙 BACKTRACKING: THE ALGORITHM THAT SOLVES SUDOKU 👩‍💻 I'm Diana Pinto. Tired of using blind brute force for combination ...

3:28
🔙 BACKTRACKING: THE ALGORITHM THAT SOLVES SUDOKUS

2 views

8 hours ago

SciQuantumMind
Quantum Computers Can Search Faster?! Grover’s Algorithm Explained

What if a quantum computer could search through a huge number of possibilities faster than a classical computer? Meet Grover's ...

12:04
Quantum Computers Can Search Faster?! Grover’s Algorithm Explained

3 views

18 hours ago

Developer Coder
Maximum Number of Non-Overlapping Substrings | LeetCode 1520 | Greedy | Java Code | Developer Coder

Welcome to Developer Coder! In this video, we solve LeetCode 1520 – Maximum Number of Non-Overlapping Substrings ...

31:05
Maximum Number of Non-Overlapping Substrings | LeetCode 1520 | Greedy | Java Code | Developer Coder

54 views

5 hours ago

Brute To Best
LeetCode #169: Majority Element — Boyer-Moore Voting

Problem #169 of the Brute To Best series: Majority Element. Find the element appearing more than n over 2 times. A hash map of ...

17:13
LeetCode #169: Majority Element — Boyer-Moore Voting

1 view

23 hours ago

Patternized
LeetCode 1520 – Maximum Number of Non-Overlapping Substrings | LeetCode Daily Challenge | Tamil

LeetCode 1520 – Maximum Number of Non-Overlapping Substrings | Easy Explanation in Tamil In this video, we solve LeetCode ...

14:21
LeetCode 1520 – Maximum Number of Non-Overlapping Substrings | LeetCode Daily Challenge | Tamil

12 views

1 hour ago

Rahul IITD
Validate Binary Search Tree (LeetCode 98): The Trap 90% Fail (Min-Max Range Bounds)

Master Validate Binary Search Tree (LeetCode 98) with this comprehensive step-by-step breakdown designed for coding ...

2:02
Validate Binary Search Tree (LeetCode 98): The Trap 90% Fail (Min-Max Range Bounds)

1 view

4 hours ago