ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

9 results

AloAlgo
Generating Permutations Explained Visually - 4 Colors

This video visually explains how to generate all possible permutations of a set of elements using a backtracking algorithm.

0:05
Generating Permutations Explained Visually - 4 Colors

1,245 views

10 hours ago

Rebase Youself
DSA problems are NOT hard ❌Choosing the WRONG pattern is 🤯

If you get stuck thinking: Two Pointer or Sliding Window? Backtracking or Dynamic Programming? This reel breaks it down ...

1:13
DSA problems are NOT hard ❌Choosing the WRONG pattern is 🤯

211 views

22 hours ago

BMR EDUCATION
Computer Science Students Must Master These Concepts 🚀 | DSA Roadmap Explained

Computer Science Students — These Concepts Are NON-NEGOTIABLE If you're studying Computer Science, preparing for ...

0:10
Computer Science Students Must Master These Concepts 🚀 | DSA Roadmap Explained

1,309 views

22 hours ago

CodeLucky
Iterative Inorder Traversal (Binary Tree) - Python Logic & Visualization

Master the Iterative Inorder Traversal algorithm using a Stack! In this video, we break down how to traverse a binary tree ...

3:35
Iterative Inorder Traversal (Binary Tree) - Python Logic & Visualization

0 views

21 hours ago

Unacademy Computer Science
TOC One Shot Maha Revision for GATE 2026 | Theory of Computation Full Revision | PYQs + Concepts

GATE - CSIT, DSAI & Interview Preparation subscription ...

5:04:56
TOC One Shot Maha Revision for GATE 2026 | Theory of Computation Full Revision | PYQs + Concepts

890 views

Streamed 1 day ago

Agung Pedro Zeboa
The Smart Way to Solve Problems: Branch & Bound Explained (Knapsack Problem)

Student Identity: Name: Agung Pedro Zeboa NPM: 24312098 Class: IF 24 B University: Universitas Teknokrat Indonesia (UTI) ...

9:17
The Smart Way to Solve Problems: Branch & Bound Explained (Knapsack Problem)

0 views

22 hours ago

Karan Mashru
15.2 What Is A Heap Data Structure ?

1. Complete DSA For Placements Playlist - https://www.youtube.com/playlist?list=PLdZWXnW9ILQUM0y3FidPqzcz9NTorALPh 2.

12:48
15.2 What Is A Heap Data Structure ?

7 views

20 hours ago

NullPointer
Even Odds Explained  | O(1) Math Trick | Codeforces Problem Simplified | Competitive programming.

In this video, we solve the famous Codeforces problem **Even Odds** using a simple but powerful mathematical observation.

12:30
Even Odds Explained | O(1) Math Trick | Codeforces Problem Simplified | Competitive programming.

0 views

4 hours ago

Study Placement
Binary Tree Traversal | Preorder Traversal Explained with Example | Lecture 2

In this lecture, we cover Binary Tree Preorder Traversal in detail. Notes: Telegram Community Group Telegram Community ...

12:54
Binary Tree Traversal | Preorder Traversal Explained with Example | Lecture 2

29 views

23 hours ago