ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

109 results

Manjunadh Codes
DSA with Python Final 4 Days | Time Complexity, Big O, Common Mistakes & Series Wrap 🚀

Welcome to the Final Episode of the DSA with Python series! In this video, we cover the last four topics of the series in one ...

3:57
DSA with Python Final 4 Days | Time Complexity, Big O, Common Mistakes & Series Wrap 🚀

4 views

3 days ago

Optimistic guy
100 Days of DSA Challenge 🔥 Day 1 | Can I Crack Placements?

Day 1 of my DSA Journey! Hey guys, I'm Raaj, a Computer Science student, and today I'm starting my DSA (Data Structures ...

0:06
100 Days of DSA Challenge 🔥 Day 1 | Can I Crack Placements?

16 views

3 days ago

CrackInterviewAI
Python Trick: Clean Nested IFs in 3 Lines (Interview | CrackIntervie | Crack the Coding Interview #8

Try it free: https://www.crackinterviewai.in CrackInterviewAI — AI Interview Assistant for Live Answers This Python trick cleans up ...

1:57
Python Trick: Clean Nested IFs in 3 Lines (Interview | CrackIntervie | Crack the Coding Interview #8

9 views

4 days ago

DevVerseX
Interview Question 101 | DSA | What is a Trie and when should you use it over other data structures?

Stop using linear search to find words with a given prefix when a Trie does it instantly! Trie problems appear in interviews at ...

2:30
Interview Question 101 | DSA | What is a Trie and when should you use it over other data structures?

0 views

6 days ago

DSA Unlocked
LeetCode 1979 | Find Greatest Common Divisor of Array | #python #leetcode #leetcode1979 #dsa

LeetCode 1979 – Find Greatest Common Divisor of Array In this video, we'll solve LeetCode 1979 using an efficient approach.

0:54
LeetCode 1979 | Find Greatest Common Divisor of Array | #python #leetcode #leetcode1979 #dsa

4 views

4 days ago

Save My Interview
Recursion Explained: Why Naive Fibonacci is Slow | DSA in 3 min

Recursion is one of the most powerful ideas in programming — and one of the most misunderstood. In 3 minutes we cover: • The ...

3:20
Recursion Explained: Why Naive Fibonacci is Slow | DSA in 3 min

1 view

4 days ago

CrackInterviewAI
Rename All Files in a Folder in 10 Lines of Python | CrackInterviewA | Crack the Coding Interview #9

Try it free: https://www.crackinterviewai.in CrackInterviewAI — AI Interview Assistant for Live Answers Tired of renaming files one ...

1:53
Rename All Files in a Folder in 10 Lines of Python | CrackInterviewA | Crack the Coding Interview #9

23 views

3 days ago

MCE
I Wasted 4 Years in College... but now ! #fresher

I wasted 4 years in college… but now I know I can't waste any more time. Like many students, I completed my engineering degree ...

2:25
I Wasted 4 Years in College... but now ! #fresher

28 views

4 days ago

PocketKode
Program to reverse a string in python

python #dsa #bruteforce #codejam #leetcode #vibecoder #reverse #twosum #datastructures.

3:37
Program to reverse a string in python

6 views

3 days ago

DSA Unlocked
LeetCode 1260 | Shift 2D Grid | Easy Java Solution | Matrix Simulation #python #leetcode1260 #dsa

LeetCode 1260 – Shift 2D Grid In this video, we'll solve LeetCode 1260 using an efficient Matrix Simulation approach. Learn how ...

2:03
LeetCode 1260 | Shift 2D Grid | Easy Java Solution | Matrix Simulation #python #leetcode1260 #dsa

20 views

2 days ago

DSA Unlocked
LeetCode 1081 | Smallest Subsequence of Distinct Characters | Monotonic Stack #python #leetcode1081

LeetCode 1081 – Smallest Subsequence of Distinct Characters In this video, we'll solve LeetCode 1081 using the optimal Greedy ...

2:49
LeetCode 1081 | Smallest Subsequence of Distinct Characters | Monotonic Stack #python #leetcode1081

5 views

3 days ago

CodingNinja
LeetCode 1979 - Find Greatest Common Divisor of Array - Math & Sorting Algorithms

In this video, we solve LeetCode 1979: "Find Greatest Common Divisor of Array" in Python. We will break down the problem ...

2:56
LeetCode 1979 - Find Greatest Common Divisor of Array - Math & Sorting Algorithms

79 views

4 days ago

DSA Unlocked
LeetCode 3867 | Sum of GCD of Formed Pairs | Medium GCD + Sorting #python #leetcode3867 #dsa

LeetCode 3867 – Sum of GCD of Formed Pairs In this video, we'll solve LeetCode 3867 using an efficient combination of Prefix ...

3:24
LeetCode 3867 | Sum of GCD of Formed Pairs | Medium GCD + Sorting #python #leetcode3867 #dsa

7 views

6 days ago

Visualcoders
Iterative Postorder Traversal Using 2 Stacks — Java, C++, C, Python
3:39
Iterative Postorder Traversal Using 2 Stacks — Java, C++, C, Python

0 views

0

Save My Interview
Two Pointers Explained: Brute Force to O(n) | DSA in 3 min

Two pointers is the pattern that turns an O(n²) brute force into a single O(n) pass — and once you can see it, you start spotting it ...

2:56
Two Pointers Explained: Brute Force to O(n) | DSA in 3 min

1 view

13 hours ago

CrackInterviewAI
Find Pair Sum in Sorted Array: The 10-Line Python Trick | CrackInte | Crack the Coding Interview #10

Try it free: https://www.crackinterviewai.in CrackInterviewAI — AI Interview Assistant for Live Answers The Python trick every ...

1:47
Find Pair Sum in Sorted Array: The 10-Line Python Trick | CrackInte | Crack the Coding Interview #10

13 views

2 days ago

Hands On Course Demo
Build 01 Lesson 06 :Python Backend: Pagination, Dedup & LRU Cache with PostgreSQL

Learn how to apply real data structures and algorithms to a production-style Python backend — not toy examples, but patterns ...

0:48
Build 01 Lesson 06 :Python Backend: Pagination, Dedup & LRU Cache with PostgreSQL

2 views

1 day ago

Bhavya Tech World
Day 12 of My Coding Journey  | Aptitude | DSA Strings | Deep Learning Basics

Hello everyone! ✨ Welcome back to Bhavya Tech World. This is Day 12 of my coding journey. Today, I focused on aptitude, ...

3:14
Day 12 of My Coding Journey | Aptitude | DSA Strings | Deep Learning Basics

15 views

6 days ago

Think With Jaggu
Recursion Explained in 90 Seconds

Recursion Explained in 90 Seconds Recursion sounds intimidating, but it's actually built on one simple idea: **a function solving a ...

1:37
Recursion Explained in 90 Seconds

24 views

6 days ago

Aditya Singh
Weekly 511 - Question No 2 ( Dominant Nodes in a Binary Tree) (Day 60) End of the Challenge Finally🥹

60daysleetcodingchallenge #apnacollege #coding #striver #competitiveprogramming #code #dsa #coder #apna #leetcode ...

2:14
Weekly 511 - Question No 2 ( Dominant Nodes in a Binary Tree) (Day 60) End of the Challenge Finally🥹

25 views

2 days ago