Problem bank

Problem 71 of 333EasyCodingP071

Two-sum

  1. Given an unsorted array of integers and a target TT, return two indices whose values sum to TT, or null if none exist. O(n)O(n) time.