Determine subsequence expression equals target

Q: Determine subsequence expression equals target

This question evaluates a candidate's ability to perform combinatorial search and expression evaluation over subsequences with operator insertion, testing algorithm design, state-space reasoning, and handling integer arithmetic constraints.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Question

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.

Determine subsequence expression equals target

Question

Comments (0)