34 lines
964 B
Markdown
34 lines
964 B
Markdown
# Two pointers approach
|
|
|
|
#### 2022-06-14 23:06
|
|
|
|
___
|
|
##### Algorithms:
|
|
#algorithm #two_pointers
|
|
##### Data structures:
|
|
#array #linked_list
|
|
##### Difficulty:
|
|
#CS_analysis #difficulty-
|
|
##### Related problems:
|
|
```expander
|
|
tag:#coding_problem tag:#two_pointers -tag:#template_remove_me
|
|
```
|
|
|
|
- [[Leetcode Intersection-of-Two-Arrays-II]]
|
|
- [[Leetcode Merge-Sorted-Array]]
|
|
- [[Leetcode Merge-Two-Sorted-Lists]]
|
|
- [[Leetcode Squares-of-a-Sorted-Array]]
|
|
|
|
|
|
##### Links:
|
|
- [leetcode](https://leetcode.com/explore/learn/card/fun-with-arrays/511/in-place-operations/)
|
|
___
|
|
|
|
### What is Two pointers approach?
|
|
By using two pointers, to in place modify array elements.
|
|
- One fast and one slow [[Leetcode Best-Time-To-Buy-And-Sell-Stock]] or [[Leetcode Linked-List-Cycle]]
|
|
- The two are unordered [[Leetcode Merge-Two-Sorted-Lists]]
|
|
|
|
### Why and when to use it?
|
|
- There are two arrays, or linked lists
|
|
- They are sorted, or operation in place will not interfere elements after. |