feat: Added Word Break Problem in Backtracking

[Akshat-Raii]

 know more

Describe your change:

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

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new JavaScript files are placed inside an existing directory.
• 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.
• 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.

[codecov-commenter]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 84.79%. Comparing base (55ff0ad) to head (8da81b9).

Additional details and impacted files

@@ Coverage Diff @@ ## master #1738 +/- ## ========================================== + Coverage 84.76% 84.79% +0.03%  ========================================== Files 378 379 +1 Lines 19738 19782 +44 Branches 2957 2967 +10 ========================================== + Hits 16731 16775 +44  Misses 3007 3007 

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.