Two-Sum with Hash Lookup

Walk the array once, storing seen values in a lookup table. When the complement is already present, the result indices are known.

Algorithm

Basic Implementation

basic.dart

void main() {
  final arr = [2, 7, 11, 4, 5];
  const target = 9;
  final seen = <int, int>{};
  var first = -1;
  var second = -1;
  for (var i = 0; i < arr.length; i++) {
    final value = arr[i];
    final need = target - value;
    if (seen.containsKey(need)) {
      first = seen[need]!;
      second = i;
      break;
    }
    seen[value] = i;
  }
  print('[$first, $second]');
}

Complexity

Time: O(n) average
Space: O(n)

Implementation notes

Keep the explicit control flow. Library shortcuts would hide the state changes this lesson is meant to replay.
The final output is intentionally small and deterministic for cross-language comparison.

execution replay The checked-in replay follows the language-neutral state table for `array-two-sum-hash`.

cross-language comparison This Dart DSA version keeps the same data and final output as every other DSA book in this wave.