ViewTube

Day 5 of my 21-day DSA consistency challenge 🚀 Woke up at 8 AM for the contest and solved the first two questions on my own ...

This Video covers the basics of Competitive Programming ~ around Range of Data types and Time complexity in a bit of Practical ...

Was worth the $5. Maybe.

0:00 Flying to SFO from YVR 2:38 Google/Microsoft Campus 6:15 TreeHacks Mixer Event 6:45 Exploring Stanford 8:48 Inside ...

AI-based drop-out prediction and counseling system.

Lecturer - Shreyans Garg Notes - https://github.com/CPModule-IITG/Algomaniacs-2025/tree/main.

Welcome to Day 1 of my 100 Days Coding Challenge! Today, I'm solving an interesting coding problem step by step, ...

This video covers the basics of Number Theory for Competitive Programming.

Lecturer - Shrivathsa Sridharan Notes - https://github.com/CPModule-IITG/Algomaniacs-2025/tree/main.

... Perfect for coding interviews, competitive programming, and placement preparation! Got a question? Drop a comment below, ...

Lecture 4 for 6.S088 2026. Slides can be found: ...

Lecturer - Anant Bansal and Dhruva Sarawgi Notes - https://github.com/CPModule-IITG/Algomaniacs-2025/tree/main.

... DSA Resources • Preparation Schedule & Roadmap • Competitive Programming Or Leetcode • Some personal tips Timecodes: ...

In this video, we explore the top coding platforms for competitive programming, technical interviews, and skill improvement.

Why Should You Learn DSA Patterns in 2025? https://www.youtube.com/watch?v=qH2VQY48mg4 DSA Patterns Playlist: https://www ...

In this video, I walk you through Week 3 of my competition prep, showing my training, progress, and key adjustments. I also share ...

🔥 Want to master pattern programs in Java? In this video, we will learn how to print a 🔷 Diamond Shape Pattern using Java ...

code #dsa #prefix #suffix.

... classic DSA (Data Structures & Algorithms) question that is frequently asked in coding interviews and competitive programming.

In this video, we dive into a commonly asked coding interview question: how to find the **first and last occurrence** of a given ...