Ir al contenido principal
Stepwise
/Conceptos/Two Pointers
1 / 6
Velocidad
ENES
/
Big O NotationRecursionTwo PointersSliding WindowSpace ComplexityWorst-case AnalysisMemoizationGreedy vs DP
StackQueueLinked ListHash TableBinary Search TreeHeapUnion-Find / Disjoint SetsRed-Black Tree
Bubble SortSelection SortInsertion SortQuick SortMerge SortHeap SortCounting SortRadix SortShell SortBucket Sort
Binary SearchLinear SearchJump SearchInterpolation SearchQuickselect / Median Finding
Breadth-First SearchDepth-First SearchDijkstra's AlgorithmPrim's AlgorithmKruskal's MSTTopological Sort
Fibonacci DPKnapsack 0/1Longest Common Subsequence
N-Queens ProblemSudoku SolverMaze Pathfinding
Tower of Hanoi
Sieve of Eratosthenes
45 algoritmos·by Sai Rithwik Kukunuri

Two Pointers — Conceptos

Two Pointers
L ↓
R ↓
1
3
5
7
9
12
15
0
1
2
3
4
5
6
Paso 1:Encontrar dos números que sumen 14 en un arreglo ordenado. Left empieza en índice 0, right al final.
Variables
target==14
left==0
right==6