{"blocks": [{"key": "3fb9099e", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "4cb26121", "text": "LeetCode 135. Candy – Distribute the minimum number of candies (stars) so that each movie gets at least one star and any movie with a higher rating than an adjacent movie gets more stars than that neighbor. Array Challenge – Optimize an algorithm whose current time-complexity limits performance; design a solution that leverages an appropriate tree data structure to achieve faster operations. Update Release Scheduler – Given two lists of version release dates, sort each list and then compare them to produce the combined chronological release schedule.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "571dab36", "text": "https://leetcode.com/problems/candy/description/", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}