ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

244 results

fearless girl
code a circular buffer from scratch (c++)
6:49
code a circular buffer from scratch (c++)

535 views

2w ago

dsa_with_cpp
Max Circular Subarray Sum,#KadaneAlgorithm #KadaneAlgorithmCPlusPlus#dsa #Coding#GFG#leetcode

Problem: Max Circular Subarray Sum You are given a circular array of integers. Your task is to find the **maximum possible sum ...

6:48
Max Circular Subarray Sum,#KadaneAlgorithm #KadaneAlgorithmCPlusPlus#dsa #Coding#GFG#leetcode

19 views

3w ago

Aaj Ka Code
Bird and Max Fruit Gathering | Circular Array + Sliding Window | GFG POTD | C++

GFG POTD | Bird and Max Fruit Gathering Today's problem is Bird and Max Fruit Gathering. We have trees arranged in a circle, ...

18:50
Bird and Max Fruit Gathering | Circular Array + Sliding Window | GFG POTD | C++

189 views

3w ago

Carlos Delgado - Computación
PUJ Data Structures 2026-II C10-4 Array-based stack and top pointer; circular queue with O(1) ope...

Data Structures Pontifical Javeriana University, Cali Campus Semester 2026-II In this class: Stacks with arrays and tops ...

13:53
PUJ Data Structures 2026-II C10-4 Array-based stack and top pointer; circular queue with O(1) ope...

7 views

6d ago

NEEKO TECH
LED Array in Round Shape | Altium Designer Tutorial | Hindi

How to Create 4, 8 & 10 LED Circular Array in Altium Designer In this video, I will show you step-by-step how to create a circular ...

12:33
LED Array in Round Shape | Altium Designer Tutorial | Hindi

13 views

2d ago

TomJNET
Build a Queue in Assembly: Data Structures + Big O

Episode 8 of Inside the CPU: x86 Assembly Lab. A queue is first in, first out: enqueue at the back, dequeue at the front. On top of ...

9:41
Build a Queue in Assembly: Data Structures + Big O

1 view

8d ago

Swift Coding
Swift Queues: How to Achieve O(1) Dequeue Time

... 1:40 - The optimized Dequeue approach with Circular Array 3:10 - Building a Basic Queue with Swift Arrays 6:15 - Implementing ...

13:49
Swift Queues: How to Achieve O(1) Dequeue Time

8 views

3d ago

Brute To Best
LeetCode #346: Moving Average from Data Stream, Queue With a Running Sum

The circular buffer version: use a fixed array of length size and an index that wraps around with modulo subtract the value being ...

10:31
LeetCode #346: Moving Average from Data Stream, Queue With a Running Sum

0 views

12h ago

ByteDistrict
UART Ring Buffers with DMA and Idle Line

Optimize high-speed serial communication by moving beyond polling and interrupt-driven byte-by-byte processing. This video ...

10:06
UART Ring Buffers with DMA and Idle Line

98 views

4d ago

GREEN BUILDING Engineers & Architects
Polar Array in AutoCAD: Create Circular Designs in Seconds | Lec 21

Welcome to Lecture 21 of the AutoCAD 2026 Mission 99 series! Today, we go from straight lines to "Circular Engineering" with ...

14:39
Polar Array in AutoCAD: Create Circular Designs in Seconds | Lec 21

45 views

3w ago

SysSketch
Ring Buffers Explained: The Data Structure That Never Resizes

Most data structures grow when they run out of room. A ring buffer never does — it just wraps around and keeps going.

4:42
Ring Buffers Explained: The Data Structure That Never Resizes

220 views

12d ago

Coding practice
Bird and Max Fruit Gathering | Maximum circular subarray sum of size K | Sliding Window | O(N)

GFG Problem of the Day – 04 September 2026 Similiar problem Link: ...

15:32
Bird and Max Fruit Gathering | Maximum circular subarray sum of size K | Sliding Window | O(N)

66 views

3w ago

Recker
Leetcode #1652 || SELF LEARNING ||

Solving LeetCode 1652 "Defuse the Bomb" for self-learning : walking through the circular array + prefix sum intuition, common ...

4:41
Leetcode #1652 || SELF LEARNING ||

1 view

2w ago

Concepts That Click and DrLone
Queues Explained Visually: FIFO, Circular Queue, Deque & Priority Queue | Lectures 20

What happens when data enters a queue? Who gets removed first? What happens when the array is full? And why do we even ...

9:42
Queues Explained Visually: FIFO, Circular Queue, Deque & Priority Queue | Lectures 20

67 views

2d ago

CS in Minutes | Dr. Ankur Ratmele
Circular Queue Enqueue Algorithm | Insertion Operation Explained | Data Structure

Circular Queue – Enqueue / Insertion Algorithm | Data Structures | Dr. Ankur Ratmele In this video, we learn the Enqueue ...

18:19
Circular Queue Enqueue Algorithm | Insertion Operation Explained | Data Structure

200 views

3w ago

CS Concise
13 | Queues: ADTs, Arrays & C++ | Data Structures

13 | Queues: ADTs, Arrays & C++ | Data Structures** In this video, **Queues: ADTs, Arrays & C++**, you will learn how the queue ...

8:40
13 | Queues: ADTs, Arrays & C++ | Data Structures

2 views

2w ago

Aditya Mahajan
LeetCode 4043: Circular adjacency — count once, price the cut

Count Rotations With Exactly K Equal Adjacent Pairs (LeetCode 4043), explained properly in 10:51. Count the cyclic rotations of s ...

10:52
LeetCode 4043: Circular adjacency — count once, price the cut

194 views

2w ago

reelsgram_shorttube
The Sliding Window Technique

07:04 A circular buffer reuses a fixed array... 08:27 A video game engine uses a sliding... 09:46 In competitive programming, the ...

16:22
The Sliding Window Technique

0 views

12d ago

Ace The Exam Cambridge IGCSE O & A Levels
Implementing Queues Using Arrays | Computer Science #Arrays

Learn implementing queues using arrays quickly with clear exam-focused steps and a concise worked explanation. #examtips ...

8:57
Implementing Queues Using Arrays | Computer Science #Arrays

0 views

4w ago

기계용 사마귀
[Praying Mantis 2D CAD] 33. Circular Array Copy

Circular array copy is a technique that copies objects in a circle by clicking the rotation center and adjusting the angle or ...

4:36
[Praying Mantis 2D CAD] 33. Circular Array Copy

42 views

5d ago