ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

421 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

72 views

1 hour ago

Julia McCoy
Nvidia CEO’s Shocking Order: “Stop Coding Immediately” - Here’s What Engineers Must Do

GET MY FREE GUIDE: *The Content Creator's AI Blueprint: From 25 Hours to 5 Minutes* https://FirstMovers.ai/blueprint/ “Stop ...

10:02
Nvidia CEO’s Shocking Order: “Stop Coding Immediately” - Here’s What Engineers Must Do

32,076 views

18 hours ago

Code Monkey
STUCK for HOURS trying to write Code? Watch this!

FREE Game Dev Report Newsletter https://cmonkey.co/gamedevreportnewsletter ❤️ FREE Complete Courses ...

9:26
STUCK for HOURS trying to write Code? Watch this!

3,652 views

17 hours ago

codestorywithMIK
Minimum Cost Path with Edge Reversals | Easiest Explanation | Leetcode 3650 | codestorywithMIK

Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A Dijkstra's Algorithm | PART-1 ...

15:57
Minimum Cost Path with Edge Reversals | Easiest Explanation | Leetcode 3650 | codestorywithMIK

671 views

2 hours ago

Leetcode Daily
3650. Minimum Cost Path with Edge Reversals | Leetcode Daily - Python

Master this tricky graph problem involving shortest paths and a unique edge reversal mechanic! In this video, we explore the ...

5:55
3650. Minimum Cost Path with Edge Reversals | Leetcode Daily - Python

291 views

9 hours ago

Programming Live with Larry
3650. Minimum Cost Path with Edge Reversals - Day 27/31 Leetcode January Challenge

Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real ...

17:01
3650. Minimum Cost Path with Edge Reversals - Day 27/31 Leetcode January Challenge

223 views

8 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

23 views

3 hours ago

Alpha-Code
Mock DSA Interview With Midlevel SWE - Tech Screen - Lean Hire

This is a mock phone/tech screen with a midlevel swe. This person had some issues with catching edge cases and DSA ...

59:58
Mock DSA Interview With Midlevel SWE - Tech Screen - Lean Hire

973 views

1 day ago

AI Coding Daily
How to Debug External MCP Problems (My Real Story)

I noticed a warning in Claude Code about token usage of some MCP, and decided to dig deeper. In this video, I will show you two ...

5:12
How to Debug External MCP Problems (My Real Story)

0 views

44 minutes ago

icub3d
climbingstairs - Daily Kattis #coding #codeprep #programming #codingchallenge

Solving climbingstairs today! Solve one with me daily to stay sharp! Problem: https://open.kattis.com/problems/climbingstairs ...

0:27
climbingstairs - Daily Kattis #coding #codeprep #programming #codingchallenge

0 views

2 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

8,877 views

21 hours ago

Maximilian Schwarzmüller
Tailwind's awesome. I'm switching away though.

Tailwind CSS is amazing library. It really is. I want it to succeed. But I'm not using for all my projects anymore. Website: ...

9:09
Tailwind's awesome. I'm switching away though.

16,441 views

19 hours ago

Only Python
Code With Python

Here, you'll find easy-to-understand tutorials, coding challenges, and tips to enhance your Python skills. Whether you're a ...

0:16
Code With Python

0 views

21 hours ago

coding_with_ASM
Pattern Printing - 22 (in python)

Hello friends, this video showcases a pattern printing program in python, designed to help learners improve there logic building.

0:41
Pattern Printing - 22 (in python)

6 views

16 hours ago

Codingbrainly
Can you figure out the output of this python code (PART 176)

... coding tips and tricks- https://www.youtube.com/playlist?list=PL41x6uH-_ZeUUTWh3CqmNftPL4-NaL4jZ Coding problems- ...

1:23
Can you figure out the output of this python code (PART 176)

0 views

18 hours ago

codestorywithMIK
Meeting Rooms II | Leetcode 253 | Line Sweep Technique Concepts & Questions - 4 | codestorywithMIK

iPad PDF Notes Link ...

13:37
Meeting Rooms II | Leetcode 253 | Line Sweep Technique Concepts & Questions - 4 | codestorywithMIK

540 views

10 hours ago

Md Ehsan
Why Programming Is Hard (You’re Not Bad at It)

Why does programming feel so hard for beginners? If coding feels difficult, confusing, or frustrating — this video is for you.

11:56
Why Programming Is Hard (You’re Not Bad at It)

26 views

19 hours ago

Info Techiezz
Remove Spaces and Vowels from a String | TCS NQT String Problem Explained

Like the video if it helped you Subscribe for more TCS NQT and placement coding problems Comment “STRING” for more ...

8:23
Remove Spaces and Vowels from a String | TCS NQT String Problem Explained

0 views

1 hour ago

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

333 views

22 hours ago

Durga Software Solutions
Java Program to Find Second Largest Number

... interview array questions Java lab programs Java beginner practice programs Java coding problems Number logic programs in ...

6:39
Java Program to Find Second Largest Number

0 views

23 hours ago

Repovive
Minimum Prefix Removal to Make Array Strictly Increasing | LeetCode Weekly Contest 486 Problem

LeetCode Solution (C++) — Minimum Prefix Removal to Make Array Strictly Increasing In this video, Anirudh explains how to ...

2:33
Minimum Prefix Removal to Make Array Strictly Increasing | LeetCode Weekly Contest 486 Problem

18 views

12 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,326 views

21 hours ago

Alpha-Code
Blind 75 in Rust - Min Cost Climbing Stairs

This is part of a series in which I do an updated Blind 75 list in Rust. This series will be good for devs who already have DSA ...

7:57
Blind 75 in Rust - Min Cost Climbing Stairs

51 views

1 day ago

Codehurdle
Codeforces Round 1076 | Video Solution - (A to G) By Devansh | Codehurdle

Welcome to CodeHurdle Live! In this video, we bring you a complete editorial and solution walkthrough for Codeforces Round ...

2:44:27
Codeforces Round 1076 | Video Solution - (A to G) By Devansh | Codehurdle

476 views

Streamed 1 day 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

110 views

17 hours ago