ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

31 results

Partners DSA
Min Edge Reversals for Path | Graph | Simple BFS

Given a directed graph with n vertices numbered from 1 to n. The graph is represented using a 2D array edges[][] of size m, where ...

20:40
Min Edge Reversals for Path | Graph | Simple BFS

154 views

6 days ago

The Tech Girl
Build Your First AI Agent in 10 Minutes — No Coding

Build your first AI agent in just 10 minutes — no coding, APIs, or complicated automation workflows required. In this video, I'll show ...

9:43
Build Your First AI Agent in 10 Minutes — No Coding

363,862 views

2 weeks ago

Cave of Programming
Rust for Beginners 0204 - Types and Casting

The fifth video in a course on Rust for beginners: a look at integer types, and how to cast from one type to another.

3:30
Rust for Beginners 0204 - Types and Casting

862 views

9 days ago

Gamezz_only
700 Gunpowder Per Hour | The Best Creeper Farm Ever

Looking for the ultimate way to stock up on rockets and TNT? In this video, we build and showcase the absolute best creeper farm ...

2:51
700 Gunpowder Per Hour | The Best Creeper Farm Ever

44 views

6 days ago

Cave of Programming
Rust for Beginners 0203 - Specifying Types

The fourth video in a course on Rust for beginners: how to specify the types of your variables, and something that will catch you ...

4:34
Rust for Beginners 0203 - Specifying Types

899 views

13 days ago

KreaTuto
Creating Your First Java Project with VS Code IDE

👉 How to create a Java project with Visual Studio Code. 🐼 Computer Science for Beginners and Advanced Learners ▶ https://www ...

5:21
Creating Your First Java Project with VS Code IDE

92 views

4 weeks ago

Partners DSA
Grumpy Bookstore Owner - Sliding Window Technique

There is a bookstore owner that has a store open for n minutes. You are given an integer array customers of length n where ...

15:57
Grumpy Bookstore Owner - Sliding Window Technique

17 views

3 weeks ago

KreaTuto
Using User-Provided Text in Java

👉 How do I use user-supplied text in a Java program? How do I use the Scanner class? 🐼 Computer Science for Beginners and ...

8:04
Using User-Provided Text in Java

65 views

4 weeks ago

Partners DSA
Marks from Ranks - Prefix Sum and Binary Search

Consider an input where all marks obtained are divided into intervals of consecutive numbers represented as l[] and r[], where l[i] ...

26:49
Marks from Ranks - Prefix Sum and Binary Search

25 views

3 weeks ago

Partners DSA
Minimum Cost Selection - Recursion | Memo | Iterative | Space Optimized

Given an n × 3 matrix mat[][], where each row represents the costs of three available choices at a shop, select exactly one choice ...

24:36
Minimum Cost Selection - Recursion | Memo | Iterative | Space Optimized

58 views

3 weeks ago

Cave of Programming
Rust for Beginners 0202 - Mutability

The third video in a course on Rust for beginners: mutability and a preview of how variable types work. This video's on how using ...

3:13
Rust for Beginners 0202 - Mutability

2,130 views

2 weeks ago

Cave of Programming
Rust for Beginners 0205 - Constants, Memory, and a Preview of the Borrow Operator

Rust for beginners: how to use constants, and an early preview of the borrow operator, plus printing reference addresses and a bit ...

5:45
Rust for Beginners 0205 - Constants, Memory, and a Preview of the Borrow Operator

837 views

6 days ago

Partners DSA
Visit Leaves with Budget | Easy BFS Solution | Java

Given a binary tree and an integer k, where you start from the root at level 1. The cost of visiting a leaf node is equal to the level of ...

13:05
Visit Leaves with Budget | Easy BFS Solution | Java

60 views

8 days ago

Cave of Programming
Rust for Beginners 0201 - Using Simple Variables

The second video in a course on Rust for beginners: hello world. This video's on how using simple variables in Rust.

4:49
Rust for Beginners 0201 - Using Simple Variables

1,072 views

4 weeks ago

Partners DSA
Recover Binary Search Tree

You are given the root of a binary search tree (BST), where the values of exactly two nodes of the tree were swapped by mistake.

14:20
Recover Binary Search Tree

21 views

3 weeks ago

Partners DSA
Longest Subsequence with Adjacent Diff as 1 | HashMap Approach

Given an array arr[] with n elements. find the longest subsequence such that the absolute difference between adjacent elements is ...

12:47
Longest Subsequence with Adjacent Diff as 1 | HashMap Approach

51 views

2 weeks ago

Java Hangout
01. Introduction to Python | Your First Python Program | Python for Beginners python introduction

Welcome to our Python Beginner-to-Pro YouTube Series! In this first video, we begin our Python journey from the very basics.

8:43
01. Introduction to Python | Your First Python Program | Python for Beginners python introduction

77 views

9 days ago

Partners DSA
Party in Town | Graph Theory | BFS Traversal

Geek Town has n houses numbered from 1 to n, choose a house to host a party such that its distance from its farthest house is as ...

16:18
Party in Town | Graph Theory | BFS Traversal

71 views

10 days ago

Partners DSA
Maximum Frequency After Subarray Operation | Kadane Algorithm | Prefix Sum

You are given an array nums of length n. You are also given an integer k. You perform the following operation on nums once: ...

18:34
Maximum Frequency After Subarray Operation | Kadane Algorithm | Prefix Sum

21 views

2 weeks ago

Street Boss Gaming
10 Minecraft Tricks Most Players Don’t Know

Think you know Minecraft? These 10 Minecraft tricks can make survival faster, easier, and a whole lot smarter — and there's a ...

5:24
10 Minecraft Tricks Most Players Don’t Know

2,117 views

3 weeks ago