ViewTube

In this video, I solve the LeetCode 3Sum problem using Java. The goal is to find all unique triplets in an array whose sum is zero.

In this video, I solve the LeetCode 3Sum Closest problem using Java. The solution uses sorting and the two-pointer technique to ...

In this video, I explain how to solve LeetCode 2110: Number of Smooth Descent Periods of a Stock using an optimized Sliding ...

Given an array arr. The task is to find triplets in an array whose sum equals a given number k. Whether you're preparing for ...

In this video, we learn how to evaluate Reverse Polish Notation (RPN) using the stack data structure. Reverse Polish Notation is a ...