ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

4 results

Binary Brain
LeetCode 2645 - Minimum Additions to Make Valid String | Strings | Greedy | DSA

In this video, we solve LeetCode 2645 — Minimum Additions to Make Valid String using a Greedy Pattern Matching approach.

17:26
LeetCode 2645 - Minimum Additions to Make Valid String | Strings | Greedy | DSA

2 views

13h ago

Half-Eyed Coder
LeetCode 1456 | Maximum Number of Vowels in a Substring of Given Length | Medium

Given a string s and an integer k, return the maximum number of vowels in any substring of length k. Vowels: a, e, i, o, u Example s ...

9:30
LeetCode 1456 | Maximum Number of Vowels in a Substring of Given Length | Medium

11 views

1d ago