ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

12 results

Mahesh Ahirwar
Top K Frequent Elements | Heap & Bucket Sort | DSA Interview Problem

In this video, we solve the Top K Frequent Elements problem using multiple optimal approaches, including Heap (Priority Queue) ...

19:49
Top K Frequent Elements | Heap & Bucket Sort | DSA Interview Problem

20 views

2 days ago

Leetcode Daily
3510. Minimum Pair Removal to Sort Array II | Leetcode Daily - Python

Struggling with the hard LeetCode problem Minimum Pair Removal to Sort Array II? In this video, we break down how to optimize ...

8:49
3510. Minimum Pair Removal to Sort Array II | Leetcode Daily - Python

208 views

5 hours ago

The Optimal Approach
LC 502. IPO | Priority Queue + Greedy HARD | Explained

Welcome to *Day 15* of the *75 Hard DSA Challenge* In this video, I solve and explain LeetCode 502 – *IPO,* a classic HARD ...

7:38
LC 502. IPO | Priority Queue + Greedy HARD | Explained

37 views

3 days ago

Web Fusion with Bharadwaj
80. Persistent Segment Tree Algorithm (Java)

Welcome to Code with Bharadwaj Code with Bharadwaj is a high-impact programming channel built for those who want to master ...

31:12
80. Persistent Segment Tree Algorithm (Java)

43 views

3 days ago

Web Fusion with Bharadwaj
77. Segment Tree Algorithm (Java)

Welcome to Code with Bharadwaj Code with Bharadwaj is a high-impact programming channel built for those who want to master ...

33:53
77. Segment Tree Algorithm (Java)

69 views

4 days ago

codematrixvishal
Heap Sort Explained Using Array & Tree | Heap Sort Visualization | DSA Shorts

Heap Sort is a powerful and efficient sorting algorithm in Data Structures & Algorithms (DSA). In this short video, Heap Sort is ...

0:17
Heap Sort Explained Using Array & Tree | Heap Sort Visualization | DSA Shorts

0 views

1 day ago

Laiba Zahoor
DAA Past Papers 2024 Solution | Detailed Explanation | Design & analysis of algorithm |PUCIT | PU

https://youtube.com/playlist?list=PLrREcp2r5D2A5yO5SagREtwvL9eqU4UX5&si=f9R-oMcm8GDuYws3 ...

21:36
DAA Past Papers 2024 Solution | Detailed Explanation | Design & analysis of algorithm |PUCIT | PU

39 views

1 day ago

Go Forward
Heap implementation   heapsort
3:05
Heap implementation heapsort

0 views

2 days ago

Techwines
Nearly Sorted Array | GFG | Striver A2Z sheet | Heaps

Time Complexity : O(nlogk) Space Complexity : O(k) Problem Link ...

9:17
Nearly Sorted Array | GFG | Striver A2Z sheet | Heaps

42 views

1 day ago

Go Forward
Heap implementation   get the minimum maximum
6:34
Heap implementation get the minimum maximum

1 view

2 days ago

Yashaswee Kesharwani
Top K Frequent Elements Explained | 3 Approaches | From Naive to Optimal O(n) | LeetCode 347

Top K Frequent Elements (LeetCode 347) is a classic interview question that tests how well you can move from a naive idea to an ...

22:21
Top K Frequent Elements Explained | 3 Approaches | From Naive to Optimal O(n) | LeetCode 347

0 views

2 hours ago

AH Tutorials
Check if Array Is Sorted and Rotated 🔥 | LeetCode 1752 | DSA Logic Explained

In this video, we solve LeetCode 1752 – Check if Array Is Sorted and Rotated using a simple and powerful DSA logic. In this ...

8:44
Check if Array Is Sorted and Rotated 🔥 | LeetCode 1752 | DSA Logic Explained

28 views

1 day ago