{"blocks": [{"key": "118fa617", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "038c71f9", "text": "LeetCode 778. Swim in Rising Water – Given an n x n integer grid where grid[i][j] is the earliest time you can enter the cell, starting from (0,0) move 4-directionally only when the current time is ≥ the target cell's value; find the minimum time to reach (n-1,n-1).", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "bd86262a", "text": "https://leetcode.com/problems/swim-in-rising-water/description/", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}