{"blocks": [{"key": "3d70e44d", "text": "Scenario", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "2d9df331", "text": "Live CodeShare Python/Java question during the same LendingClub interview assessing basic algorithmic fluency.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "a0fcd3bb", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "5d3ff54a", "text": "Given an integer array nums and an integer target, return true if any two distinct numbers in nums sum to target; otherwise return false.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "7804db12", "text": "Hints", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "239879a5", "text": "An O(n) hash-set solution is acceptable; explain trade-offs vs. sorting.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}