10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T550,class Solution: def diffWaysToCompute(self, expression: str) -> List[int]: n = len(expression) dp = [[[] for _ in range(n)] for _ in range(n)] # Initialize base cases for i in range(n): if expression[i].isdigit(): if i + 1 < n and expression[i+1].isdigit(): val = int(expression[i:i+2]) dp[i][i] = [val] dp[i+1][i+1] = [val] # auxiliary storage helper dp[i][i+1] = [val] elif i == 0 or not expression[i-1].isdigit(): dp[i][i] = [int(expression[i])] for length in range(3, n + 1): for start in range(n - length + 1): end = start + length - 1 for i in range(start, end + 1): op = expression[i] if op.isdigit(): continue left_res = dp[start][i-1] right_res = dp[i+1][end] for l in left_res: for r in right_res: if op == '+': dp[start][end].append(l + r) elif op == '-': dp[start][end].append(l - r) elif op == '*': dp[start][end].append(l * r) return dp[0][n-1]13:T403,class Solution { private Map> memo = new HashMap<>(); public List diffWaysToCompute(String expression) { if (memo.containsKey(expression)) return memo.get(expression); List res = new ArrayList<>(); for (int i = 0; i < expression.length(); i++) { char c = expression.charAt(i); if (c == '+' || c == '-' || c == '*') { List left = diffWaysToCompute(expression.substring(0, i)); List right = diffWaysToCompute(expression.substring(i + 1)); for (int l : left) { for (int r : right) { if (c == '+') res.add(l + r); else if (c == '-') res.add(l - r); else if (c == '*') res.add(l * r); } } } } if (res.isEmpty()) res.add(Integer.parseInt(expression)); memo.put(expression, res); return res; } }

Time Complexity

Space Complexity