DSAGeeks
Evaluate Expression to True (Memoization with Map)
Hard

Problem Statement

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

Examples

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
Loading...

Sign in to Run Code and Submit