ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

19 results

Smart Programming
Reverse Words in a String | Leetcode 151 | 🚀 3 Optimized Ways (Java) | DSA Placement Course

Reverse Words in a String | Leetcode 151 | 3 Optimized Ways (Java) | DSA Placement Course ◾◼️ Useful Notes & Courses ...

21:04
Reverse Words in a String | Leetcode 151 | 🚀 3 Optimized Ways (Java) | DSA Placement Course

1,051 views

3 weeks ago

NeetCodeIO
Maybe some people should just give up

https://neetcode.io/yt - A better way to prepare for Coding Interviews ‍ LinkedIn: ...

25:23
Maybe some people should just give up

328,232 views

3 weeks ago

Smart Programming
Longest Substring Without Repeating Characters (LeetCode 3) | 🔥 DSA Java Placement Course

In this video, we will solve one of the most popular string problems asked in coding interviews — Longest Substring Without ...

21:05
Longest Substring Without Repeating Characters (LeetCode 3) | 🔥 DSA Java Placement Course

1,036 views

1 month ago

Study Placement
Find All People With Secret | LeetCode 2092 🔥 | DSU in detail

In this video, we solve LeetCode 2092 – Find All People With Secret, which is a graph + time-based propagation problem.

33:22
Find All People With Secret | LeetCode 2092 🔥 | DSU in detail

291 views

13 hours ago

Study Placement
Count Partitions With Max-Min Difference at Most K 🔥 | Leetcode 3578 | Sliding Window + DP + Deque

Leetcode 3578 – Count Partitions With Max-Min Difference at Most K using an optimal Sliding Window + DP + Monotonic Deque ...

28:18
Count Partitions With Max-Min Difference at Most K 🔥 | Leetcode 3578 | Sliding Window + DP + Deque

2,606 views

13 days ago

Study Placement
Count Number of Trapezoids II 🔥 | Leetcode 3625 | HashMap + Slopes + Geometry | Optimal + Dry Run

Solve Leetcode 3625 – Count Number of Trapezoids II using an efficient HashMap + Slope Compression + Geometry approach. Code ...

48:38
Count Number of Trapezoids II 🔥 | Leetcode 3625 | HashMap + Slopes + Geometry | Optimal + Dry Run

881 views

2 weeks ago

Study Placement
Leetcode 1590 🔥 Make Sum Divisible by P | Prefix Sum + HashMap | Optimal Approach + Dry Run

Leetcode 1590 – Make Sum Divisible by P in the most optimal way. 🔗 Problem Link: https://leetcode.com/problems/make-sum ...

30:04
Leetcode 1590 🔥 Make Sum Divisible by P | Prefix Sum + HashMap | Optimal Approach + Dry Run

317 views

2 weeks ago

Study Placement
Maximum Subgraph Score in a Tree | Weekly Contest 479 |  Leetcode 3772 Q3 | Tree dp + Rerouting
26:59
Maximum Subgraph Score in a Tree | Weekly Contest 479 | Leetcode 3772 Q3 | Tree dp + Rerouting

458 views

11 days ago

Study Placement
Best Time to Buy and Sell Stock using Strategy | LeetCode 3652 🔥 | Daily Coding Challenge

In this video, we solve LeetCode 3652 – Best Time to Buy and Sell Stock using Strategy, which is today’s Daily Coding ...

26:07
Best Time to Buy and Sell Stock using Strategy | LeetCode 3652 🔥 | Daily Coding Challenge

629 views

1 day ago

Study Placement
LeetCode 3381 🔥 Maximum Subarray Sum Divisible by K | Prefix Mod Trick + Optimal Solution

Welcome to today’s LeetCode Daily Challenge – Problem 3381: Maximum Subarray Sum With Length Divisible by K. Code: https ...

24:20
LeetCode 3381 🔥 Maximum Subarray Sum Divisible by K | Prefix Mod Trick + Optimal Solution

525 views

3 weeks ago

Study Placement
Count Covered Buildings 🔥 LeetCode 3531 | TreeMap / Sets Approach | Optimal Java Solution

In this video, we solve LeetCode 3531 — Count Covered Buildings, which is today's Daily Challenge. I used an efficient ...

20:40
Count Covered Buildings 🔥 LeetCode 3531 | TreeMap / Sets Approach | Optimal Java Solution

1,088 views

8 days ago

Study Placement
LeetCode 2872 🔥 Maximum Number of K-Divisible Components | DFS + Tree DP | Clean Explanation

Welcome to today’s LeetCode Daily Challenge: 2872 – Maximum Number of K-Divisible Components. Code: https://github.com ...

23:08
LeetCode 2872 🔥 Maximum Number of K-Divisible Components | DFS + Tree DP | Clean Explanation

283 views

3 weeks ago

Study Placement
Count Mentions Per User | LeetCode 3433 🔥 | Optimal Solution + Dry Run

In this video, we solve LeetCode 3433 – Count Mentions Per User using a clean and optimal approach. Code: https://leetcode ...

25:04
Count Mentions Per User | LeetCode 3433 🔥 | Optimal Solution + Dry Run

569 views

7 days ago

Study Placement
Total Score of Dungeon Runs 🔥 Leetcode 3771 | Weekly Contest 479 Q3 | Prefix Sum + Binary Search

In this video, we solve Leetcode 3771 – Total Score of Dungeon Runs, a Q3 problem from Weekly Contest 479. Code: https ...

29:08
Total Score of Dungeon Runs 🔥 Leetcode 3771 | Weekly Contest 479 Q3 | Prefix Sum + Binary Search

714 views

12 days ago

Study Placement
Maximum Profit from Trading Stocks with Discounts | LeetCode 3562 | Daily Coding Challenge | Tree DP

In this video, we solve LeetCode 3562 – Maximum Profit from Trading Stocks with Discounts (Daily Coding Challenge) using an ...

28:48
Maximum Profit from Trading Stocks with Discounts | LeetCode 3562 | Daily Coding Challenge | Tree DP

1,831 views

3 days ago

Study Placement
LeetCode 1930 🔥 Unique Length-3 Palindromic Subsequences | Optimal Counting Trick + Easy Logic

In this video, we solve LeetCode 1930 – Unique Length-3 Palindromic Subsequences, a beautiful problem based on prefix–suffix ...

20:37
LeetCode 1930 🔥 Unique Length-3 Palindromic Subsequences | Optimal Counting Trick + Easy Logic

83 views

4 weeks ago

Study Placement
Minimum Moves to Balance Circular Array 🔥 | LeetCode 3776 | Weekly Contest 480 Q3 | Greedy Solution

In this video, we solve LeetCode 3776 – Minimum Moves to Balance Circular Array, Question 3 of Weekly Contest 480, using an ...

22:41
Minimum Moves to Balance Circular Array 🔥 | LeetCode 3776 | Weekly Contest 480 Q3 | Greedy Solution

605 views

5 days ago

Study Placement
Best Time to Buy and Sell Stock V | LeetCode 3573 🔥 | Daily Coding Challenge | DP on Stocks

In this video, we solve LeetCode 3573 – Best Time to Buy and Sell Stock V (Daily Coding Challenge) using Dynamic ...

25:48
Best Time to Buy and Sell Stock V | LeetCode 3573 🔥 | Daily Coding Challenge | DP on Stocks

519 views

2 days ago

codingX krishna
3531. ढके हुए भवनों की गणना करें | जावा समाधान

इस वीडियो में, हम LeetCode की समस्या "ढकी हुई इमारतों की गिनती करें" को हल ...

22:18
3531. ढके हुए भवनों की गणना करें | जावा समाधान

155 views

8 days ago