ViewTube

Hi and welcome to LeetCode Weekly! I'm Hamd, experienced in programming with Python, Next.js, Swift, Kotlin and many more.

In this video, we solve the “Remove Element” problem (LeetCode 27) using the Two Pointer technique. Instead of memorizing ...

In this video, we solve LeetCode 125 — Valid Palindrome using the Two Pointers pattern. We start by understanding the problem ...

Hi and welcome to LeetCode Weekly! I'm Hamd, experienced in programming with Python, Next.js, Swift, Kotlin and many more.

In this video, we solve LeetCode Problem 977 — Squares of a Sorted Array. We start by understanding why the naive approach of ...

10 LeetCode Patterns to Solve 80% of Coding Interview Problems How to Start LeetCode from ZERO in 2026 LeetCode was ...

Trapping Rain Water is one of the most confusing DSA problems — until you see it this way. In this video, we build the intuition ...

100 Days Code Challenge with Shouvik || Master DSA, System Design & Backend Development || Maximum Level Sum of a ...

Hi and welcome to LeetCode Weekly! I'm Hamd, experienced in programming with Python, Next.js, Swift, Kotlin and many more.

In this Interview Coder review, I will show you how they just leaked their customers names and where they got offers. This major ...

LeetCode 136 — Single Number (C++): The XOR Trick (O(n) / O(1)) If every number appears twice… how do you find the one that ...

Hi and welcome to LeetCode Weekly! I'm Hamd, experienced in programming with Python, Next.js, Swift, Kotlin and many more.

In this video, we solve LeetCode Problem 61: Rotate List step by step using an easy and optimized approach. You will clearly ...

Learn about binary search, a key algorithm in coding interviews. Discover how to implement binary search on an infinite array in ...

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.

Transform a chess knight problem into an elegant graph solution! Learn how to find the minimum moves for a knight to reach any ...

Daily Leetcode Problems.

Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the ...

Start your Web Development Journey: https://codecompile.ai/courses Use code NEWYEAR — Flat 20% OFF ( Limited Time ...

Start your Web Development Journey: https://codecompile.ai/courses Use code NEWYEAR — Flat 20% OFF ( Limited Time ...