Evaluate Expression to True (Memoization with Map) – DSA Problem Solution

Evaluate Expression to True (Memoization with Map)

Hard

Optimize the recursive solution for expression evaluation by using a map to memoize subproblem results.

1Example 1

Input:

{
  "s": "T|F&T",
  "i": 0,
  "j": 4,
  "isTrue": true
}

Output:

2

2Example 2

Input:

{
  "s": "T^F|T",
  "i": 0,
  "j": 4,
  "isTrue": true
}

Output:

1

3Example 3

Input:

{
  "s": "F|T^F",
  "i": 0,
  "j": 4,
  "isTrue": true
}

Output:

2

Evaluate Expression to True (Memoization with Map) – DSA Problem Solution | DSAPrime