ViewTube

In this video, we solve LeetCode 258 – Add Digits using a simple while loop approach in Java. This problem is a great ...

In this video, we solve LeetCode 2194 – Cells in a Range on an Excel Sheet using a clean and efficient approach in Java.

In this video, we solve LeetCode 202 – Happy Number using a HashSet-based approach in Java. This problem is a great ...

In this video, we solve LeetCode 1523 – Count Odd Numbers in an Interval Range using a simple and efficient math-based ...

In this video, we solve LeetCode 263 – Ugly Number using a simple and efficient approach in Java. This problem helps you ...

In this video, we solve LeetCode 168 – Excel Sheet Column Title using a clean and interview-ready approach in Java.

In this video, we solve LeetCode 367 – Valid Perfect Square using an efficient and interview-ready approach in Java.

In this video, we solve LeetCode 633 – Sum of Square Numbers using an efficient and interview-ready approach in Java.

In this video, we solve LeetCode 507 – Perfect Number using a simple loop-based approach in Java. This problem is a classic ...

In this video, we solve LeetCode 66 – Plus One using a clean and interview-ready array traversal approach in Java. This problem ...

In this video, we solve LeetCode 2778 – Sum of Squares of Special Elements using a clean and efficient approach in Java.

In this video, we solve LeetCode 2032 – Two Out of Three using an efficient approach with HashSet and HashMap in Java.

In this video, we solve LeetCode 2154 – Keep Multiplying Found Values by Two using a clean and efficient approach in Java.

In this video, we solve LeetCode 11 – Container With Most Water using an efficient and interview-ready Two Pointer approach in ...

In this video, we solve LeetCode 1748 – Sum of Unique Elements using a clean and efficient HashMap / frequency-count ...

In this video, we solve LeetCode 125 – Valid Palindrome using an efficient Two Pointer approach in Java. This problem is a ...

In this video, we solve LeetCode 976 – Largest Perimeter Triangle using an efficient and interview-ready approach in Java.

In this video, we solve LeetCode 3512 – Minimum Operations to Make Array Sum Divisible by K using a clean and optimal math + ...