Live CodeShare Python/Java question during the same LendingClub interview assessing basic algorithmic fluency.
Given an integer array nums and an integer target, return true if any two distinct numbers in nums sum to target; otherwise return false.
An O(n) hash-set solution is acceptable; explain trade-offs vs. sorting.