{"blocks": [{"key": "01ab760f", "text": "Scenario", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "8ee072c2", "text": "Live Python exercise: generate all bigrams from an input string and iteratively optimize the solution.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "8de7992c", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "cfa1f282", "text": "Write a Python function that takes a sentence and returns a list of all consecutive word bigrams. Refactor the solution with list comprehension for conciseness. Can you further compress it into a single line? (Hint: consider using zip.)", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "3eea01c4", "text": "Hints", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "fe693409", "text": "Think of zip(s.split()[:-1], s.split()[1:]) and join/format as needed.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}