{"blocks": [{"key": "ec180413", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "04a47604", "text": "Given a binary tree, find the maximum distance between two 'alive' nodes, where 'alive' nodes are initially the leaves; follow-up: allow the set of 'alive' nodes to be specified arbitrarily. LeetCode 1166. Design File System", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "d7a3db6e", "text": "https://leetcode.com/problems/design-file-system/description/", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}