Keyboard shortcuts

Press ← or → to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Two Sum

Complexity:

  • Time: O(n log n) — dominated by the sort
  • Space: O(n) — for storing indices