{"blocks": [{"key": "cbce5c51", "text": "Scenario", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "1772259e", "text": "Programming assessment and infrastructure panel", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "8749f15a", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "9d2d1b3a", "text": "Design an algorithm to return the length of the Longest Increasing Subsequence of an array.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "d94bf477", "text": "Seat students so that no two listed friends sit next to each other; provide algorithm and complexity.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "333483f0", "text": "How would you sort a file containing 50 numbers? How would your approach change for a 1-million-number file stored on disk?", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "c313bb45", "text": "Hints", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "9afd6152", "text": "Use O(n log n) patience sorting + binary search; graph/constraint satisfaction; external merge-sort for large files.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}