{"blocks": [{"key": "c40c2a41", "text": "Question", "type": "header-two", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}, {"key": "34f01829", "text": "Given a sequence of positive 32-bit integers A and an integer target, determine whether there exists a subsequence of A (each element used at most once) such that, by inserting '+' or '*' between the chosen numbers and evaluating strictly from left to right (addition and multiplication have equal precedence), the resulting expression equals target. Follow-up: propose pruning techniques to accelerate the search.", "type": "unstyled", "depth": 0, "inlineStyleRanges": [], "entityRanges": [], "data": {}}], "entityMap": {}}