feat: Added Word Break Problem in Backtracking

[Akshat-Raii]

 know more

Describe your change:

• [x] Add an algorithm?
• [ ] Fix a bug or typo in an existing algorithm?
• [ ] Documentation change?

Checklist:

• [x] I have read CONTRIBUTING.md.
• [x] This pull request is all my own work -- I have not plagiarized.
• [x] I know that pull requests will not be merged if they fail the automated tests.
• [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• [x] All new JavaScript files are placed inside an existing directory.
• [x] All filenames should use the UpperCamelCase (PascalCase) style. There should be no spaces in filenames. Example: UserProfile.js is allowed but userprofile.js, Userprofile.js, user-Profile.js, userProfile.js are not.
• [x] All new algorithms have a URL in their comments that points to Wikipedia or another similar explanation.
• [ ] If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

Additional Information

This pull request adds a new feature to implement the Word Break problem using a backtracking approach. The solution checks if a given string can be segmented into valid words from a provided dictionary and uses memoization for optimization.