< Summary

Information
Class: LeetCode.Algorithms.CustomSortString.CustomSortStringDictionarySorting
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CustomSortString\CustomSortStringDictionarySorting.cs
Line coverage
100%
Covered lines: 16
Uncovered lines: 0
Coverable lines: 16
Total lines: 46
Line coverage: 100%
Branch coverage
100%
Covered branches: 2
Total branches: 2
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
CustomSortString(...)100%22100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\CustomSortString\CustomSortStringDictionarySorting.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 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.CustomSortString;
 13
 14/// <inheritdoc />
 15public class CustomSortStringDictionarySorting : ICustomSortString
 16{
 17    /// <summary>
 18    ///     Time complexity - O (m log m + n), where m is the length of the 's' string and n is the length of the 'order
 19    ///     string
 20    ///     Space complexity -  O (n + n), where m is the length of the 's' string and n is the length of the 'order' st
 21    /// </summary>
 22    /// <param name="order"></param>
 23    /// <param name="s"></param>
 24    /// <returns></returns>
 25    public string CustomSortString(string order, string s)
 626    {
 627        var orderDictionary = new Dictionary<char, int>();
 28
 10429        for (var i = 0; i < order.Length; i++)
 4630        {
 4631            orderDictionary[order[i]] = i;
 4632        }
 33
 634        var sortedChars = s.ToList();
 35
 636        sortedChars.Sort((x, y) =>
 3137        {
 3138            var orderX = orderDictionary.GetValueOrDefault(x, int.MaxValue);
 3139            var orderY = orderDictionary.GetValueOrDefault(y, int.MaxValue);
 640
 3141            return orderX.CompareTo(orderY);
 3742        });
 43
 644        return new string(sortedChars.ToArray());
 645    }
 46}