< Summary

Information
Class: LeetCode.Algorithms.FindSmallestLetterGreaterThanTarget.FindSmallestLetterGreaterThanTargetBinarySearch
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindSmallestLetterGreaterThanTarget\FindSmallestLetterGreaterThanTargetBinarySearch.cs
Line coverage
100%
Covered lines: 18
Uncovered lines: 0
Coverable lines: 18
Total lines: 49
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
NextGreatestLetter(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindSmallestLetterGreaterThanTarget\FindSmallestLetterGreaterThanTargetBinarySearch.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2026 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.FindSmallestLetterGreaterThanTarget;
 13
 14/// <inheritdoc />
 15public sealed class FindSmallestLetterGreaterThanTargetBinarySearch : IFindSmallestLetterGreaterThanTarget
 16{
 17    /// <summary>
 18    ///     Time complexity - O(log n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="letters"></param>
 22    /// <param name="target"></param>
 23    /// <returns></returns>
 24    public char NextGreatestLetter(char[] letters, char target)
 325    {
 326        var left = 0;
 327        var right = letters.Length - 1;
 28
 329        var result = letters[0];
 30
 1031        while (left <= right)
 732        {
 733            var mid = left + ((right - left) / 2);
 34
 735            if (letters[mid] > target)
 336            {
 337                result = letters[mid];
 38
 339                right = mid - 1;
 340            }
 41            else
 442            {
 443                left = mid + 1;
 444            }
 745        }
 46
 347        return result;
 348    }
 49}