[vedant0517]

Summary

• Implement Booth's algorithm to find the starting index of the lexicographically smallest cyclic rotation of a string.
• Achieve O(n) time complexity and O(1) auxiliary space complexity.
• Add JUnit tests covering empty strings, single characters, repeated characters, periodic strings, already-minimal rotations, and null input.
• Include Javadoc documentation and an algorithm reference.

Example

For the input "baca", the lexicographically smallest rotation is "abac", which starts at index 3.

Complexity

• Time: O(n)
• Auxiliary Space: O(1)

Closes #7643

[codecov-commenter]

Codecov Report

❌ Patch coverage is 95.83333% with 1 line in your changes missing coverage. Please review.
✅ Project coverage is 82.21%. Comparing base (862de93) to head (ec19a52).

Files with missing lines	Patch %	Lines
...ava/com/thealgorithms/strings/BoothsAlgorithm.java	95.83%	0 Missing and 1 partial ⚠️

Additional details and impacted files

@@            Coverage Diff            @@
##             master    #7644   +/-   ##
=========================================
  Coverage     82.20%   82.21%           
- Complexity     8382     8392   +10     
=========================================
  Files           842      843    +1     
  Lines         26101    26125   +24     
  Branches       5090     5096    +6     
=========================================
+ Hits          21457    21478   +21     
- Misses         3857     3858    +1     
- Partials        787      789    +2     

☔ View full report in Codecov by Harness.
📢 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]

@vedant0517 thanks!