ViewTube

TLE 12.0 - our Competitive Programming course TLE 12.0 is live! Enrol now at https://www.tle-eliminators.com/ Here are the video ...

Donate: buymeacoffee.com/roadtofaang Submission: https://leetcode.com/submissions/detail/1479630843/ Mastering ...

Repovive Roadmap to learn programming: https://repovive.com/roadmaps Further discussions in Telegram and Discord: ...

Timestamps: 0:00:00 Video start 1:37:13 Solution discussion 1:37:41 Question 1 1:41:39 Question 2 1:51:20 Question 3 1:57:59 ...

Leetcode Weekly Contest 481: https://leetcode.com/contest/weekly-contest-480/ Q3. Minimum Swaps to Avoid Forbidden Values ...

Larry participates in the Leetcode Weekly Contest 428, 11th out 22725 Contest: https://leetcode.com/contest/weekly-contest-428 ...

coding #leetcode #dsa #contest 4th year (2026 grad) CSE student from Delhi. Okayish in DSA, trash in development, trying to ...

Weekly competition Discord: winkypoop DM for Leetcode coaching.

Join us live for Leetcode Weekly Contest 480 as we break down Problems A, B, C and D. New to CP or unsure of your level?

... smallest index among all of the buttons that is same time to push right so at at first during the contest I actually thought that I can ...

Leetcode Weekly Contest 428 Problem Link: ...

Here is the submission link of the ...

Problem Link:-https://leetcode.com/problems/count-beautiful-splits-in-an-array/description/ This problem was based on rolling ...

15th December 2024 question link: https://leetcode.com/problems/maximize-amount-after-two-days-of-conversions/description/ ...

Q3 apparently can be solved with O(n^2) and checking subarray if equal. Not sure if this solution will TLE on rejudge.

LeetCode 3386: Button with Longest Push Time Solution Explained (C++) In this video, we tackle the Button with Longest Push ...

15th December 2024 question link: https://leetcode.com/problems/button-with-longest-push-time/description/ optimized approach ...

Problem: https://leetcode.com/problems/minimum-operations-to-make-character-frequencies-equal/description/ Solution: ...