{"blocks": [{"key": "9d6adb48", "text": "Scenario", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "3bf73461", "text": "LeetCode-style algorithm phone interview", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "2bcf0cd0", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "588a8d38", "text": "Implement a function that returns the smallest missing positive integer in an unsorted integer array in O(n) time and O(1) space, then explain the complexity trade-offs.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "4806a79f", "text": "Hints", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "1120b1c8", "text": "Use index placement/cyclic sort to achieve constant extra space.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}