{"blocks": [{"key": "43110188", "text": "Scenario", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "87b395ff", "text": "Coding rounds and infrastructure-style algorithm questions.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "b8f39dcb", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "5173bbf6", "text": "Write an efficient algorithm to return the length of the longest increasing subsequence in an integer array. Design a function that rearranges a classroom so no adjacent students share the same team. How would you sort 50 numbers in a file, and how would your approach change for one million numbers?", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "9eea6cc9", "text": "Hints", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "b7f3b250", "text": "Discuss O(n log n) solutions, dynamic programming with binary search, and external/parallel sorting for large files.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}