{"blocks": [{"key": "a6586889", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "7166a0a2", "text": "Given a singly linked list, return the k-th node counted from the end.", "type": "unordered-list-item", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "01f21892", "text": "Given an integer array, return the top k most frequent numbers.", "type": "unordered-list-item", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "f1a5578f", "text": "Given a list of points on the 2-D plane, return the k points closest to the origin (0,0).", "type": "unordered-list-item", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "8a318450", "text": "Given a string where adjacent identical characters \"collide\" and disappear repeatedly (e.g., \"abbba\" → \"aa\" → \"\"), output the final string after all collisions are resolved.", "type": "unordered-list-item", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "acc4cb64", "text": "https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/ https://leetcode.com/problems/top-k-frequent-elements/description/ https://leetcode.com/problems/k-closest-points-to-origin/description/ https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/description/", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}