ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

140 results

Alpha-Code
Mock FAANG DSA Interview With a Junior Dev - Medium/Hard Difficulty - No Hire

This is a mock with a candidate with 1 year experience. They asked for a medium/hard interview. They had issues planning out ...

1:04:52
Mock FAANG DSA Interview With a Junior Dev - Medium/Hard Difficulty - No Hire

164 views

3 hours ago

NoEditHD
Live Coding LeetCode – Unfiltered Problem Solving--DAY 178

Welcome to the NoEditHD Live LeetCode Session! I'll be solving real LeetCode problems *live* — raw, unscripted, and without ...

3:05:25
Live Coding LeetCode – Unfiltered Problem Solving--DAY 178

594 views

Streamed 15 hours ago

Humanize IT
Lessons in Vibe Coding

In this episode, Adam Walter and Skip Ziegler delve into the concept of 'vibe coding,' a method of using natural language to ...

23:03
Lessons in Vibe Coding

17 views

17 hours ago

Developer Coder
Minimum Cost Path with Edge Reversals | LeetCode 3650 | Dijkstra | Java Code | Developer Coder

Welcome to Developer Coder ‍ ✨ In this video, we deep-dive into LeetCode 3650 – Minimum Cost Path with Edge Reversals, ...

31:34
Minimum Cost Path with Edge Reversals | LeetCode 3650 | Dijkstra | Java Code | Developer Coder

22 views

5 hours ago

GeeksforGeeks
DSA In Java | DP 03 | Java in One Shot | DP ( Dynamic Programming ) in Java

In this video, you will learn core DP concepts such as overlapping subproblems, optimal substructure, memoization, tabulation, ...

4:57:04
DSA In Java | DP 03 | Java in One Shot | DP ( Dynamic Programming ) in Java

1,383 views

22 hours ago

Artur Ceschin
Rotting Oranges Explained Simply | BFS Algorithm Tutorial | LeetCode 994

LeetCode 994: Rotting Oranges solved using Multi-Source BFS in JavaScript. This medium difficulty problem demonstrates an ...

31:50
Rotting Oranges Explained Simply | BFS Algorithm Tutorial | LeetCode 994

37 views

20 hours ago

Sheryians Coding School
Getting into MAANG w/ Google SDE-3 | Inside the Industry Ep:01 | Sheryians x @anubhavintech

What does it REALLY take to get into MAANG in today's tech industry? 🎙️ Guest: Anubhav Sethi (@anubhavintech ) SWE III ...

57:12
Getting into MAANG w/ Google SDE-3 | Inside the Industry Ep:01 | Sheryians x @anubhavintech

9,442 views

23 hours ago

Scriptwave Coding Labs
Live Coding💻

I'm grinding Data Structures & Algorithms (DSA) and solving LeetCode problems live for 10 hours straight. and right now learning ...

4:08:07
Live Coding💻

300 views

Streamed 14 hours ago

noobiesAG
Lecture 4.3 | Number Theory - 4 | Modular Arithmetic | Binary Exponentiation
1:56:51
Lecture 4.3 | Number Theory - 4 | Modular Arithmetic | Binary Exponentiation

0 views

0

CTO Bhaiya
Day 43/90 |⚡How to Think Your Way from O(n²) to O(n log n) | LeetCode 1942 | DSA Pattern #6 #heap

Telegram Channel : https://t.me/ctobhaiya_tg Instagram: https://www.instagram.com/ctobhaiya Linkedin: ...

1:00:49
Day 43/90 |⚡How to Think Your Way from O(n²) to O(n log n) | LeetCode 1942 | DSA Pattern #6 #heap

398 views

1 day ago

codeTips
Minimum Cost Path with Edge Reversals | LeetCode 3650 | Graph | Dijkstra

LeetCode Problem – Minimum Cost Path with Edge Reversals | C++ Solution Explained In this video, we solve the LeetCode ...

21:25
Minimum Cost Path with Edge Reversals | LeetCode 3650 | Graph | Dijkstra

253 views

11 hours ago

Technical Topics
Day 44 | Logic Oriented Coding | HackerRank | C Java Python

... day 43 logic oriented coding logic oriented programming hackerrank logic problems placement coding questions logic building ...

54:09
Day 44 | Logic Oriented Coding | HackerRank | C Java Python

32 views

22 hours ago

Codehurdle
Bit Manipulation | Binary Trie , Xor Basis | Part 3

In this video, we cover two powerful approaches for solving XOR-based problems: Binary Trie and XOR Basis (Linear Basis).

1:40:48
Bit Manipulation | Binary Trie , Xor Basis | Part 3

112 views

19 hours ago

CodeiiiShiv
Leetcode 3650 | Minimum cost Path with edge reversals | step by step solution building | explained

GitHub https://Github.com/Shivin1016 Problem Link https://leetcode.com/problems/minimum-cost-path-with-edge-reversals/?

23:34
Leetcode 3650 | Minimum cost Path with edge reversals | step by step solution building | explained

8 views

6 hours ago

Bharath Reddy
Minimum Window Substring 💡 | Sliding Window Explained in Telugu | DSA L37 🔥

Welcome to Lecture 37 of the DSA Series in Telugu! In this video, we solve the Minimum Window Substring problem — the ...

50:35
Minimum Window Substring 💡 | Sliding Window Explained in Telugu | DSA L37 🔥

56 views

18 hours ago

Akshat Kant Thakur
[DAY-42] Live LeetCode | Interview mode | Java | SQL #leetcode #coding  #java #programming #sql #sde

Live DSA, LeetCode, Java & SQL — Real Interview Prep I'm a software engineer with ~2 years of experience who ignored ...

1:46:57
[DAY-42] Live LeetCode | Interview mode | Java | SQL #leetcode #coding #java #programming #sql #sde

5 views

Streamed 16 hours ago

College Wallah
Complete Dynamic Programming | Dynamic Programming Part 2

Use Coupon Code DECODE30 and Get 30% off on Enroll Now :- https://pwskills.com/programming-courses/ In this lecture ...

8:59:54
Complete Dynamic Programming | Dynamic Programming Part 2

2,982 views

22 hours ago

Factify learning
Important Numerical Problems | RLE, Compression Ratio, Arithmetic Coding,RSA ,LZ | AKTU BTech

In this video, we solve IMPORTANT NUMERICAL PROBLEMS of UNIT–5 (Data Compression & Encoding) as per the AKTU ...

27:43
Important Numerical Problems | RLE, Compression Ratio, Arithmetic Coding,RSA ,LZ | AKTU BTech

489 views

21 hours ago

DSA with Kumar K
Codeforces Div3 Round 1076 | E - Product Queries | Simplest Intuition + Logic | Maths Heavy

... DSA + OA + CP aimed towards increasing the problem solving skills for new hard unseen coding problems - https://videsiqna.in/ ...

23:27
Codeforces Div3 Round 1076 | E - Product Queries | Simplest Intuition + Logic | Maths Heavy

261 views

23 hours ago

vHiren
L27 - Multi Dimensional DP | Out of Boundary Paths | 3D DP | Bottom Up 3 Ways | LeetCode 576

Today in Lecture 27 of Multi Dimensional DP (GRID DP), we solve LeetCode 576 (MEDIUM). Out of Boundary Paths problem ...

28:30
L27 - Multi Dimensional DP | Out of Boundary Paths | 3D DP | Bottom Up 3 Ways | LeetCode 576

7 views

12 hours ago