Add KnuthMorrisPratt.java (KMP)

[sriieeu]

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized it.
• All filenames are in PascalCase.
• All functions and variable names follow Java naming conventions.
• All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
• All new algorithms include a corresponding test class that validates their functionality.
• All new code is formatted with clang-format -i --style=file path/to/your/file.java

[codecov-commenter]

Codecov Report

❌ Patch coverage is 0% with 34 lines in your changes missing coverage. Please review.
✅ Project coverage is 79.07%. Comparing base (6fdf2db) to head (42d0527).

Files with missing lines	Patch %	Lines
...va/com/thealgorithms/strings/KnuthMorrisPratt.java	0.00%	34 Missing ⚠️

Additional details and impacted files

@@             Coverage Diff              @@
##             master    #7234      +/-   ##
============================================
- Coverage     79.09%   79.07%   -0.03%     
  Complexity     6974     6974              
============================================
  Files           783      783              
  Lines         22950    22956       +6     
  Branches       4512     4513       +1     
============================================
  Hits          18152    18152              
- Misses         4077     4083       +6     
  Partials        721      721              

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

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

[DenizAltunkapan]

@sriieeu please fix the conflicts and explain what the difference between your solution and https://github.com/TheAlgorithms/Java/blob/master/src/main/java/com/thealgorithms/searches/KMPSearch.java is

[sriieeu]

@DenizAltunkapan
In my code Line 46 the condition while(i < n) is better because KMP is driven solely by the text pointer. In main branch KMP using Line 19 : (n - i) >= (m - j) incorrectly involves the pattern pointer in loop control. Since j can change unpredictably after LPS jumps, this condition may terminate the loop early and miss valid matches. Therefore, while(i < n) is the correct and standard KMP implementation.