[FEATURE] Add Boolean Parenthesization problem

[KartikeySharma]

Detailed description

You are given a boolean expression consisting of a string of the symbols 'true', 'false', 'and', 'or', and 'xor'. Count the number of ways to parenthesize the expression such that it will evaluate to true. For example, there are 2 ways to parenthesize 'true and false xor true' such that it evaluates to true.

Context

This is a classical DP question that involves a top-down approach, and I feel that this should be a part of this repository.

Possible implementation

No response

Additional information

No response

[himanshukrabc]

Can you assign this to me?

[github-actions[bot]]

This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions[bot]]

Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!