C# Beautiful Strings Test case for failed case

Question

I have an issue with this:

When John was a little kid he didn't have much to do. There was no internet, no Facebook, and no programs to hack on. So he did the only thing he could... he evaluated the beauty of strings in a quest to discover the most beautiful string in the world.

Given a string s, little Johnny defined the beauty of the string as the sum of the beauty of the letters in it. The beauty of each letter is an integer between 1 and 26, inclusive, and no two letters have the same beauty. Johnny doesn't care about whether letters are uppercase or lowercase, so that doesn't affect the beauty of a letter. (Uppercase 'F' is exactly as beautiful as lowercase 'f', for example.)

You're a student writing a report on the youth of this famous hacker. You found the string that Johnny considered most beautiful. What is the maximum possible beauty of this string?

Input sample:

Your program should accept as its first argument a path to a filename. Each line in this file has a sentence. E.g.

ABbCcc
Good luck in the Facebook Hacker Cup this year!
Ignore punctuation, please :)
Sometimes test cases are hard to make up.
So I just go consult Professor Dalves

Output sample:

Print out the maximum beauty for the string. E.g.

152
754
491
729
646

And here is my code in C#:

static void Main(string[] args)
{
    StreamReader myR = new StreamReader(args[0]);
    List<string> myL = new List<string>();


    while (!myR.EndOfStream)
    {
        myL.Add(myR.ReadLine());
    }

    foreach (string item in myL)
    {
        int maxBeautifulNum = 0;
        string temp = item.ToLower();

        char[] myC = temp.ToCharArray();

        string[] tempS = new string[myC.Length];
        string tempCount;

        for (int i = 0; i < myC.Length; i++)
        {
            if ((myC[i] >= 'a' && myC[i] <= 'z') || (myC[i] >= 'A' && myC[i] <= 'Z'))
            {
                tempS[i] = myC[i].ToString();
            }

        }

        tempS = tempS.Where(w => !string.IsNullOrWhiteSpace(w)).ToArray();

        List<string> myCounterList = new List<string>();

        while(tempS.Length >= 1)
        {
            int count = 0;
            tempCount = tempS[0];

            for (int j = 0; j < tempS.Length; j++)
            {
                if (tempS[j] == tempCount)
                {
                    count++;
                }
            }

            myCounterList.Add(count.ToString());

            tempS = tempS.Where(w => w != tempCount).ToArray();
        }

        string[] myCounterString = myCounterList.ToArray();
        Array.Sort(myCounterString);
        Array.Reverse(myCounterString);

        for (int i = 0; i < myCounterString.Length; i++)
        {
            maxBeautifulNum += (26 - i) * int.Parse(myCounterString[i]);
        }
        Console.WriteLine(maxBeautifulNum);
    }
}

It run right with only some tests, but I can't find out else test for it runs failed. Any one can show me test for my code run failed.

Answer 1

Here's a basic LINQPad program that calculates the "beauty" of a string:

void Main()
{
    string[] inputs =
    {
        "a",
        "z",
        "A test",
        "A TEST",
        "a test"
    };

    foreach (var input in inputs)
    {
        var beauty =
            (from c in input
             let C = char.ToUpper(c)
             where C >= 'A' && C <= 'Z'
             select (int)(C - 'A') + 1).Sum();
        beauty.Dump(input);
    }
}

All the magic is in that single LINQ statement inside the loop there.

Also, to read all the lines from a file, use this:

string[] lines = File.ReadAllLines(fileName);