ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

52 results

CodeLucky
Maximize Sum After K Negations - Greedy Algorithm Explanation

Learn how to solve the 'Maximize Sum After K Negations' coding problem using a Greedy approach! In this video, we break ...

3:46
Maximize Sum After K Negations - Greedy Algorithm Explanation

2 views

6 days ago

Sundeep Saradhi Kanthety
Learn DAA - Design and Analysis of Algorithms (Part-1) || Divide and Conquer || Greedy Method || DAA

00:00:00 Introduction to Algorithms 00:10:56 Time Complexities 00:31:24 Asymptotic Notations 00:40:21 Growth Rates 00:48:12 ...

7:34:18
Learn DAA - Design and Analysis of Algorithms (Part-1) || Divide and Conquer || Greedy Method || DAA

446 views

6 days ago

Campus Prepp
GFG Problem of the Day 13 Jan | Bus Ticket Change | Full Greedy Method | Java C++ Python JS #shorts

Bus Ticket Change – GFG POTD 13 January | Greedy Algorithm Solution Bus Ticket Change — GFG POTD 13 Jan explained in ...

0:32
GFG Problem of the Day 13 Jan | Bus Ticket Change | Full Greedy Method | Java C++ Python JS #shorts

334 views

7 days ago

PrinZeOP
2943. Maximize Area of Square Hole in Grid | Diagram Explained By Leetcode Guardian

2943. Maximize Area of Square Hole in Grid Timestamps 00:00 Introduction to LeetCode 2943 00:46 Analyzing Constraints: Why ...

12:52
2943. Maximize Area of Square Hole in Grid | Diagram Explained By Leetcode Guardian

52 views

5 days ago

Code Locus By Rizwan
🚀 Master Kruskal's Algorithm | Minimum Spanning Tree (MST) Explained with Example #education

MinimumSpanningTree #GraphTheory #DataStructures #Algorithms #DSA #ComputerScience #greedyalgorithm In this video, ...

6:36
🚀 Master Kruskal's Algorithm | Minimum Spanning Tree (MST) Explained with Example #education

22 views

6 days ago

Gopo workspace
Bus Ticket Change Problem Explained | DSA Greedy Approach | Step-by-Step Solution

Algorithm Used: ✓ Greedy Algorithm ⏱ Complexity Analysis: Time Complexity: O(n) Space Complexity: O(1) Who should ...

4:59
Bus Ticket Change Problem Explained | DSA Greedy Approach | Step-by-Step Solution

8 views

5 days ago

Thinking In Math
Minimax Algorithm: Optimal Play in Two-Player Games

Learn how game AIs make "smart" moves without any learning at all using the minimax algorithm. In this mini-lecture, we build ...

17:31
Minimax Algorithm: Optimal Play in Two-Player Games

22 views

4 days ago

Sundeep Saradhi Kanthety
Learn DAA - Design and Analysis of Algorithms (Part-2) || Dynamic Programming || Backtracking

00:00:00 Introductiont to Dynamic Programming 00:15:56 0/1 Knapsack Problem using Dynamic Programming 00:48:06 0/1 ...

11:17:05
Learn DAA - Design and Analysis of Algorithms (Part-2) || Dynamic Programming || Backtracking

337 views

4 days ago

Campus Prepp
Minimum Number of Workers | GFG POTD 16 Jan | Greedy + Interval Coverage Java C++ Python JS #shorts

... challenge solution minimum workers code greedy algorithm explanation gfg problem solving data structures and algorithms dsa ...

0:24
Minimum Number of Workers | GFG POTD 16 Jan | Greedy + Interval Coverage Java C++ Python JS #shorts

218 views

4 days ago

BTech Junction
Lec 15 | Dijkstra’s Algorithm ( PYQs ) | Discrete Structure | BTech 2nd Year

Coding Channel : https://youtu.be/_1rQZ7S8xHM?si=VrQ-1MSeWkJtPMaP Dijkstra's Shortest Path Algorithm | Single Source ...

16:13
Lec 15 | Dijkstra’s Algorithm ( PYQs ) | Discrete Structure | BTech 2nd Year

69 views

2 days ago

BTech Junction
Lec 13 | Dijkstra’s Shorted Path Algorithm | Discrete Structure | BTech 2nd Year

Coding Channel : https://youtu.be/_1rQZ7S8xHM?si=VrQ-1MSeWkJtPMaP Dijkstra's Shortest Path Algorithm | Single Source ...

28:01
Lec 13 | Dijkstra’s Shorted Path Algorithm | Discrete Structure | BTech 2nd Year

95 views

2 days ago

BTech Junction
Lec 16 | Dijkstra’s Algorithm ( PYQs ) | Discrete Structure | BTech 2nd Year

Coding Channel : https://youtu.be/_1rQZ7S8xHM?si=VrQ-1MSeWkJtPMaP Dijkstra's Shortest Path Algorithm | Single Source ...

11:21
Lec 16 | Dijkstra’s Algorithm ( PYQs ) | Discrete Structure | BTech 2nd Year

78 views

2 days ago

CodeLucky
Minimum Deletions To Make Frequency Unique - LeetCode Solution Explained

Struggling with the 'Minimum Deletions to Make Frequency Unique' problem? This video provides a clear, step-by-step ...

3:50
Minimum Deletions To Make Frequency Unique - LeetCode Solution Explained

0 views

6 days ago

BTech Junction
Lec 14 | Dijkstra’s Algorithm ( PYQs ) | Discrete Structure | BTech 2nd Year

Coding Channel : https://youtu.be/_1rQZ7S8xHM?si=VrQ-1MSeWkJtPMaP Dijkstra's Shortest Path Algorithm | Single Source ...

24:43
Lec 14 | Dijkstra’s Algorithm ( PYQs ) | Discrete Structure | BTech 2nd Year

58 views

2 days ago

Study Placement
Maximum Capacity Within Budget 🔥 LeetCode 3814 | Weekly Contest 485 | Greedy + Sorting

In this video, we solve LeetCode 3814 – Maximum Capacity Within Budget from Weekly Contest 485.

20:54
Maximum Capacity Within Budget 🔥 LeetCode 3814 | Weekly Contest 485 | Greedy + Sorting

838 views

2 days ago

DevSyncX
Solve Unstop POTD in 7 Minutes 😱 | Medicine Mixing Consistency Explained | Python & Java | 16/1/2026

🔥 Unstop Problem of the Day – 16/01/2026 🔥 📌 Problem Name: Medicine Mixing Consistency In this video, we solve the Unstop ...

6:44
Solve Unstop POTD in 7 Minutes 😱 | Medicine Mixing Consistency Explained | Python & Java | 16/1/2026

24 views

4 days ago

CodeLucky
Integer Break Problem - Optimal Solution Explained (LeetCode 343)

Learn how to solve the Integer Break problem (LeetCode 343) using the optimal mathematical approach! In this video, we dive ...

4:11
Integer Break Problem - Optimal Solution Explained (LeetCode 343)

2 views

6 days ago

CodeWithAshu
Java Interview Q28🚀LeetCode Roman to Number with 1Minute #shorts #interview #java8 #coding #stream

In this video, we solve a very popular Java Interview & LeetCode problem Convert an Roman to Numeral (LeetCode ...

2:37
Java Interview Q28🚀LeetCode Roman to Number with 1Minute #shorts #interview #java8 #coding #stream

0 views

2 days ago

CodeLucky
Maximum Points You Can Obtain From Cards - LeetCode Solution & Explanation

Learn how to solve the 'Maximum Points You Can Obtain From Cards' coding interview problem using the Sliding Window ...

3:47
Maximum Points You Can Obtain From Cards - LeetCode Solution & Explanation

6 views

6 days ago

Legal Codes
Candy - GFG Practice | Problem of the Day 15 January | C++ Solution Explained

Description: Welcome to The Legal Codes! ⚖️ In this video, we tackle the GFG Problem of the Day for January 15th: Candy.

16:42
Candy - GFG Practice | Problem of the Day 15 January | C++ Solution Explained

174 views

5 days ago