Algorithm Search⌘K

Algorithmintro

Two-pointer pair search

Also called two-sum two-pointer scan.

Start pointers at both ends and move the one that makes the sum too small or too large; runs in O(n).

Start pointers at both ends and move the one that makes the sum too small or too large; runs in O(n).

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • the section The problem
  • pseudocode in The algorithm
  • complexity claims in the front matter
  • one source with a locator

Tag XYYCS4 Edit this page History Report an error