ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

24 results

Brain Teaser Tech LTD
☕ What is Java? | Core Java Day 1 for Beginners 🚀 | Full Stack Java Developer Course 💻

... software developer, software development, spring boot, spring boot tutorial, java spring boot, java interview preparation #Java ...

9:18
☕ What is Java? | Core Java Day 1 for Beginners 🚀 | Full Stack Java Developer Course 💻

0 views

5 min ago

AlgorithmicIQ
Leetcode 2616  Minimize the Maximum Difference of Pairs

Java Interview Preparation / Coding Questions and Answers / Interview Questions #coding #softwareengineer #Leetcode ...

17:11
Leetcode 2616 Minimize the Maximum Difference of Pairs

0 views

30 min ago

The Modern SDE
Max-Flow Min-Cut Theorem Explained with Proof and Java Example | DSA Course L128

Lecture 128 of the Complete DSA Course in Java by Engineer X · Part 6: Graph Algorithms. In this lecture • Cuts of a flow network: ...

9:56
Max-Flow Min-Cut Theorem Explained with Proof and Java Example | DSA Course L128

0 views

58 min ago

The Modern SDE
Race Conditions Explained: Determinacy Races and Lost Updates in Parallel Java | DSA Course L140

Lecture 140 of the Complete DSA Course in Java by Engineer X · Part 7: Selected Topics. In this lecture • Deterministic vs ...

10:07
Race Conditions Explained: Determinacy Races and Lost Updates in Parallel Java | DSA Course L140

0 views

54 min ago

The Modern SDE
Maximum Bipartite Matching Using Max Flow (Ford-Fulkerson) Explained in Java | DSA Course L130

Lecture 130 of the Complete DSA Course in Java by Engineer X · Part 6: Graph Algorithms. In this lecture • Matchings, matched ...

9:24
Maximum Bipartite Matching Using Max Flow (Ford-Fulkerson) Explained in Java | DSA Course L130

0 views

57 min ago

The Modern SDE
Transitive Closure of a Graph: Warshall's Algorithm with OR and AND in Java | DSA Course L124

Lecture 124 of the Complete DSA Course in Java by Engineer X · Part 6: Graph Algorithms. In this lecture • Reachability for every ...

8:16
Transitive Closure of a Graph: Warshall's Algorithm with OR and AND in Java | DSA Course L124

0 views

59 min ago

The Modern SDE
Hungarian Algorithm Running Time: Correctness Proof and O(n³) with a Slack Array | DSA Course L136

Lecture 136 of the Complete DSA Course in Java by Engineer X · Part 6: Graph Algorithms. In this lecture • Why every label shift ...

7:43
Hungarian Algorithm Running Time: Correctness Proof and O(n³) with a Slack Array | DSA Course L136

0 views

55 min ago

The Modern SDE
Johnson's Algorithm in Java: All-Pairs Shortest Paths for Sparse Graphs | DSA Course L125

Lecture 125 of the Complete DSA Course in Java by Engineer X · Part 6: Graph Algorithms. In this lecture • Why sparse graphs ...

9:11
Johnson's Algorithm in Java: All-Pairs Shortest Paths for Sparse Graphs | DSA Course L125

0 views

59 min 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

0 views

58 min ago

The Modern SDE
Hopcroft–Karp Running Time: Why It Is O(E√V), Proof Made Simple | DSA Course L132

Lecture 132 of the Complete DSA Course in Java by Engineer X · Part 6: Graph Algorithms. In this lecture • Overlaying two ...

9:55
Hopcroft–Karp Running Time: Why It Is O(E√V), Proof Made Simple | DSA Course L132

0 views

57 min ago

The Modern SDE
Stable Marriage Problem: Gale–Shapley Algorithm Explained with Proof | DSA Course L133

Lecture 133 of the Complete DSA Course in Java by Engineer X · Part 6: Graph Algorithms. In this lecture • Preference lists, ...

10:35
Stable Marriage Problem: Gale–Shapley Algorithm Explained with Proof | DSA Course L133

1 view

57 min ago

The Modern SDE
Hopcroft–Karp Algorithm: Maximum Bipartite Matching with Augmenting Paths | DSA Course L131

Lecture 131 of the Complete DSA Course in Java by Engineer X · Part 6: Graph Algorithms. In this lecture • Matchings in bipartite ...

12:12
Hopcroft–Karp Algorithm: Maximum Bipartite Matching with Augmenting Paths | DSA Course L131

0 views

57 min ago

The Modern SDE
All-Pairs Shortest Paths via Matrix Multiplication: Min-Plus Product in Java | DSA Course L122

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

11:55
All-Pairs Shortest Paths via Matrix Multiplication: Min-Plus Product in Java | DSA Course L122

0 views

1h ago

The Modern SDE
Parallel Algorithms Explained: Fork-Join, Spawn and Sync with Parallel Fibonacci | DSA Course L137

Lecture 137 of the Complete DSA Course in Java by Engineer X · Part 7: Selected Topics. In this lecture • A map of Part 7: parallel ...

10:49
Parallel Algorithms Explained: Fork-Join, Spawn and Sync with Parallel Fibonacci | DSA Course L137

0 views

54 min ago

The Modern SDE
Randomized Caching: The Marking Algorithm and Its O(log k) Competitive Ratio | DSA Course L147

Lecture 147 of the Complete DSA Course in Java by Engineer X · Part 7: Selected Topics. In this lecture • Randomized online ...

10:47
Randomized Caching: The Marking Algorithm and Its O(log k) Competitive Ratio | DSA Course L147

0 views

52 min ago

BasicX
L1. Introduction to LLD | System Design series

In this first video, we'll build a strong foundation for understanding Low-Level Design and how it fits into the software development ...

12:08
L1. Introduction to LLD | System Design series

1 view

47 min ago

The Modern SDE
Maximum Flow Explained: Flow Networks, Capacity and Flow Conservation | DSA Course L126

Lecture 126 of the Complete DSA Course in Java by Engineer X · Part 6: Graph Algorithms. In this lecture • What a flow network ...

9:15
Maximum Flow Explained: Flow Networks, Capacity and Flow Conservation | DSA Course L126

0 views

58 min 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

0 views

58 min ago

The Modern SDE
Least Squares and Positive-Definite Matrices: The Normal Equation, Explained | DSA Course L151

Lecture 151 of the Complete DSA Course in Java by Engineer X · Part 7: Selected Topics. In this lecture • Symmetric ...

10:28
Least Squares and Positive-Definite Matrices: The Normal Equation, Explained | DSA Course L151

0 views

50 min ago

The Modern SDE
Hungarian Algorithm Explained: Assignment Problem and Feasible Labelings | DSA Course L134

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

8:28
Hungarian Algorithm Explained: Assignment Problem and Feasible Labelings | DSA Course L134

0 views

56 min ago