ViewTube

AOC ended early this year but the last 4 problems were really amazing! Solutions: ...

Land Your Dream Offer: https://gptlearninghub.ai/mentorship?website=dsa_8_weeks.

Welcome to Video 1: Introduction to Search Algorithms, where we break down how Artificial Intelligence agents solve complex ...

Video lecture series on Artificial Intelligence and Machine Learning, Lecture: 31 Iterative Deepening Depth-First Search (IDDFS) ...

Everything I use, love, or plan to buy – one Amazon list! https://www.amazon.in/shop/srkcodes ...

Definitely a tough day for me. I used a BFS for p1 that solved it relatively fast. I spend so much time on p2 that I basically forgot ...

Solutions: https://github.com/koralkulacoglu/CompetitiveProgramming/tree/main/AOC/2025.

Master the complex logic behind LeetCode 3562: Maximum Profit from Trading Stocks with Discounts. This Hard-level coding ...

Most people overcomplicate LeetCode 79 – Word Search. In this video, I walk through the cleanest DFS + backtracking approach ...

00:00:00 Intro and Problem Overview 00:03:43 Understanding the Playground Graph and Circuits 00:07:52 Minimum Spanning ...

00:00:00 Intro / Beast Mode Theme 00:01:51 Advent of Code Finale — Day 10 Linear Programming 00:04:07 Solving Day 10 Part ...

Why LeetCode 127 is actually a graph problem wearing a fake moustache. LeetCode 127 (Word Ladder) is the reason I have trust ...

Welcome back! Today we're breaking down LeetCode 39: Combination Sum — one of the most important backtracking problems ...

Everything I use, love, or plan to buy – one Amazon list! https://www.amazon.in/shop/srkcodes ...

00:00:00 Intro 00:02:14 Advent of Code Day 11 Setup 00:05:41 Building a GitHub Heat Map Feature 00:08:44 Reviewing Posting ...

00:02:48 - creating a project 00:05:32 - solve1: thinking 00:07:39 - parsing inputs 00:10:47 - slice.position() wtf 00:14:17 - putting ...

00:00:00 Intro Rap 00:01:39 Advent of Code Day 8 Overview & Motivation 00:04:05 Problem Breakdown: Junction Boxes, MST ...

"Surrounded Regions," involves transforming 'O's surrounded by 'X's in a 2D board into 'X's. The idea is to mark regions of 'O's ...

This video explains 3433 Count Mentions Per User LeetCode Code ...