Online assessment requiring implementation of common algorithmic problems.
Given an array of integers and a target, return indices of the two numbers that add up to the target (assume exactly one solution). 2) Given a string, determine the length of the longest substring without repeating characters.
Use hash maps for O(n) solutions; mind edge cases like empty input.