with the Example of Leet Code Two-Sum Puzzle
- Given
- an array of integers
nums
- and an integer
target
- Return: indices of the two numbers such that they add up to the target.
- You may assume that each input would have exactly one solution and you may not use the same element twice. Return the answer in any order.
…
The aim of this page📝is to practice 2 pointer algorithm on Max Consecutive Ones — LeetCode. Of course, this is hugely underperformant as the puzzle is solvable with a one-pass.