{"blocks": [{"key": "5f004a75", "text": "Scenario", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "701ca7f9", "text": "You have a one-dimensional data set and want to compress it by choosing k representative points while guaranteeing every data point stays close to some representative.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "b770fe5b", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "c2e9a429", "text": "Given an array of n integers and an integer k, place k cluster centers to minimize the maximum L1 distance between any point and its nearest center. Output this minimum possible distance.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "cec34f85", "text": "Hints", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "bfdf18a0", "text": "Consider sorting, binary searching the radius, and greedy or DP feasibility checks.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}