{"blocks": [{"key": "da4cfddd", "text": "Scenario", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "118ea132", "text": "Online assessment requiring implementation of common algorithmic problems.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "498809db", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "a3067daa", "text": "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.", "type": "unordered-list-item", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "32e3ba37", "text": "Hints", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "bb861a9b", "text": "Use hash maps for O(n) solutions; mind edge cases like empty input.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}