Added solution to Q44

[rakshitgondwal]

This is a template on how to fill out a PR properly.

Description

• Language Used: cpp
• Approach Used: recursion
• Question(s) Solved: 1
• Issue(s) related: [FEATURE]: Add solution to Q41 to Q50 of Leetcode #24

• Maintain a boolean flag vector of s size+1. Need the extra flag in front of the first column as the seed point to get started and handle empty string vs "**" cases.
• For each char in p, scan and update the flags in the following way:
  • If it is a '*', current flag should be true if previous flag is true or previous flag in the row above (value at top left) is true. In another word, all flags turn true after first true flag on previous row.
  • If it is a '?' or a matching character as s in same spot, current flag should be the same as previous flag in the row above (value at top left).
  • Otherwise it is a no.
• Keep the extra flag in the front true only if we kept getting '*'
• Need some tricks to cache that top left value since we are not saving the full matrix. If you are young and have really good memory, you can of course keep the entire (M+1)xN matrix to keep things simple.
• If we can reach bottom right corner, we are the lucky mouse who found the exit. Understand the matrix above, you will understand everything. Say cheese :)

Related Issue

Acceptance Criteria

Type of Changes

	Type
	🐛 Bug fix
	✨ New feature
	🔨 Refactoring
	💯 Add tests
	🔗 Update dependencies
	📜 Docs

Testing Steps / QA Criteria