ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

1,696 results

Grit & Growth
How To Reverse-Engineer The YouTube Algorithm (No Luck Needed)

Discover the data-driven framework behind scaling faceless YouTube channels without relying on luck or creative guesswork.

4:37
How To Reverse-Engineer The YouTube Algorithm (No Luck Needed)

68 views

3w ago

The Modern SDE
Red-Black Tree Deletion Explained: Tracking y, x and the Extra Black (Java) | DSA Course L68

Lecture 68 of the Complete DSA Course in Java by Engineer X · Part 3: Data Structures. In this lecture • Why deletion is harder ...

9:36
Red-Black Tree Deletion Explained: Tracking y, x and the Extra Black (Java) | DSA Course L68

2 views

3w ago

Brute To Best
LeetCode #590: N-ary Tree Postorder Traversal, Stack and Reverse Trick

Brute to Best: every LeetCode problem, from the naive solution to the optimal one. In this video: The problem: return the postorder ...

11:23
LeetCode #590: N-ary Tree Postorder Traversal, Stack and Reverse Trick

7 views

3w ago

CSE Clarity
How to Reverse an Array? | Array Reversal Explained | DSA for Beginners

How do you reverse an array? What is the logic behind reversing an array efficiently? In this video, we'll understand how to ...

18:30
How to Reverse an Array? | Array Reversal Explained | DSA for Beginners

13 views

3w ago

PM Techhub
C++ Tutorial #63: Ranges and Views | Learn C++ (Advanced)

Imagine taking a list, keeping the even numbers, squaring them, and taking the first three. With loops, that is a pile of code.

5:08
C++ Tutorial #63: Ranges and Views | Learn C++ (Advanced)

3 views

13d ago

We Tech Talk
Data Structures - 08 - Reverse a linked list - Iterative method

Data Structures – 08 | Reverse a Linked List – Iterative Method** Welcome to **Video 08 of the Data Structures series!** In this ...

13:50
Data Structures - 08 - Reverse a linked list - Iterative method

2 views

2w ago

We Tech Talk
Data Structures - 07 - Linked List in C_C++ - Delete a node at nth position

Data Structures – 07 | Linked List in C/C++ – Delete a Node at Nth Position** Welcome to **Video 07 of the Data Structures ...

12:30
Data Structures - 07 - Linked List in C_C++ - Delete a node at nth position

2 views

2w ago

Huda Kukaswadia
493. Reverse Pairs
8:54
493. Reverse Pairs

27 views

3w ago

Sandman - Sand to AI
Linked Lists Explained: Reverse One Without Losing It (Animated)

Linked lists, animated as a music playlist: every song only knows the next one. Walk the list, see why jumping to the tenth song is ...

6:36
Linked Lists Explained: Reverse One Without Losing It (Animated)

3 views

2d ago

The Modern SDE
Ford-Fulkerson Algorithm: Residual Networks and Augmenting Paths Explained | DSA Course L127

Lecture 127 of the Complete DSA Course in Java by Engineer X · Part 6: Graph Algorithms. In this lecture • The Ford-Fulkerson ...

11:07
Ford-Fulkerson Algorithm: Residual Networks and Augmenting Paths Explained | DSA Course L127

9 views

3w ago

The Modern SDE
Edmonds-Karp Algorithm: Max Flow with BFS in O(VE²), Proof and Java Code | DSA Course L129

Lecture 129 of the Complete DSA Course in Java by Engineer X · Part 6: Graph Algorithms. In this lecture • The basic ...

10:38
Edmonds-Karp Algorithm: Max Flow with BFS in O(VE²), Proof and Java Code | DSA Course L129

40 views

3w ago

BadshahCoder
LeetCode 189 | Rotate Array | Java | Reversal Algorithm | O(1) Space 🔥

LeetCode 189 | Rotate Array | Java | Reversal Algorithm | O(1) Space In this video, I solve LeetCode 189 - Rotate Array using the ...

8:11
LeetCode 189 | Rotate Array | Java | Reversal Algorithm | O(1) Space 🔥

15 views

5d ago

Brute To Best
LeetCode #493: Reverse Pairs, Merge Sort Counting in O(n log n)

Problem #493 of the Brute To Best series: Reverse Pairs. You're given an integer array nums. A reverse pair is a pair of indices (i, ...

15:10
LeetCode #493: Reverse Pairs, Merge Sort Counting in O(n log n)

38 views

4w ago

Pragyata
C++ RAII, visually explained: destructors, stack unwinding and the rule of zero | Advanced C++ Ep 3

One early return, and the file never closes. How does C++ make cleanup impossible to forget? Episode 3 of Advanced C++.

4:58
C++ RAII, visually explained: destructors, stack unwinding and the rule of zero | Advanced C++ Ep 3

11 views

4w ago

Brain Byte J9X
If m  n, reverse the numbers and comput CBSE Class 9 Maths NCERT Chapter 11 The World of Algorithms

If m n, reverse the numbers and compute 2. If n = O, report the answer as m 3. Otherwise, reduce the problem to computing gcd(n, ...

9:04
If m n, reverse the numbers and comput CBSE Class 9 Maths NCERT Chapter 11 The World of Algorithms

47 views

3w ago

TechVani AI
DSA Proof Lab Ep 5: Linked List (Insert, Delete, Reverse, Cycle) in Hinglish

DSA Episode 5 in simple Hinglish: linked list node, insert at front and back, delete, search, array vs linked list, reverse a linked list, ...

12:05
DSA Proof Lab Ep 5: Linked List (Insert, Delete, Reverse, Cycle) in Hinglish

0 views

8d ago

Brute To Best
LeetCode #707: Design Linked List, Sentinel Node Plus Size Counter

Brute to Best: every LeetCode problem, from the naive solution to the optimal one. In this video: The problem: build a linked list ...

15:06
LeetCode #707: Design Linked List, Sentinel Node Plus Size Counter

11 views

2w ago

Dry Run
Valid Palindrome II (LeetCode 680) | Two Pointers Explained Visually

Can a string become a palindrome if you delete at most one character? Valid Palindrome II (LeetCode 680) with two pointers, ...

6:39
Valid Palindrome II (LeetCode 680) | Two Pointers Explained Visually

9 views

2w ago

Pizarrón Binario
Algoritmos greedy explicados: intervalos, Dijkstra, Kruskal, Prim y cómo demostrarlos

Elegir lo mejor en cada momento lleva a la solución óptima? A veces sí y a veces no, y la diferencia está en la demostración.

12:00
Algoritmos greedy explicados: intervalos, Dijkstra, Kruskal, Prim y cómo demostrarlos

6 views

11d ago

AI Proved What?
Forbid a Clique, Gain a Log? AI Claims the Alon–Krivelevich–Sudakov Coloring Conjecture

Result 184 in OpenAI's math release claims two classic conjectures about graphs with a forbidden clique. An independent set is a ...

8:19
Forbid a Clique, Gain a Log? AI Claims the Alon–Krivelevich–Sudakov Coloring Conjecture

2 views

1d ago