Two Pointers Technique | Leetcode | Move Zeroes to end of array | Visualization | Java Live coding
Channel: Monil
Date: 12/10/2022

In this sessions we will be looking at two pointers technique. This is one of the simpler algorithms that can be useful to solve data structure problems for arrays, strings, linked list and sometimes tree problems. 

In this video we will be explaining the algorithm. We will work on leetcode 283, Move zeroes problem, explaining different approaches and solutions. Then we will try to arrive to two pointers algorithm for that problem. 
It is more important to understand the approach as opposed to solving the problem. For every solution we will arrive at some of pseudo code.

Finally we will be live coding the solution in Java. 

00:00 - Introduction
00:36 - Algorithm Overview
01:48 - Problem and requirements
05:07 - Sorting Solution 
06:40 - Array copy solution (visualization)
09:21 - Pseudocode
10:17 - Two pointers solution (visualization)
13:51 - Pseudocode
16:59 - Live coding (Java)