{"blocks": [{"key": "1e47ff21", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "562caa7f", "text": "Solve a typical medium-level sliding-window problem (e.g., longest substring without repeating characters). LeetCode 102. Binary Tree Level Order Traversal", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "ce4b2876", "text": "https://leetcode.com/problems/binary-tree-level-order-traversal/description/", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}