Not Frequent
0/11
Two Pointers
Author: Darren Yao
Prerequisites
Iterating two monotonic pointers across an array to search for a pair of indices satisfying some condition in linear time.
Resources
| Resources | |||
|---|---|---|---|
| CPH | solutions to the problems above | ||
| IUSACO | above + mention of max subarray sum | ||
Problems
| Status | Source | Problem Name | Difficulty | Tags | Solution | URL |
|---|---|---|---|---|---|---|
| CF | Easy | Show Tags2P | ||||
| CSES | Easy | Show Tags2P, Sorting | ||||
| Silver | Easy | Show Tags2P, Sorting | External Sol | |||
| CF | Easy | |||||
| Silver | Normal | Show Tags2P, Sorting | ||||
| Silver | Normal | Show Tags2P, Sorting | External Sol | |||
| CF | Normal | Check CF | ||||
| CEOI | Hard | Show Tags2P, Sorting | External Sol | |||
| SAPO | Very Hard | Show Tags2P, Sorting |
Module Progress:
Join the USACO Forum!
Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!