Example solution for known problem called Anagram of strings

Anagram.cs

using System;
using System.Linq;
using System.Collections.Generic;

public class Program
{
	public static void Main()
	{
		foreach (var test in GetTestCases()) {
			var result = IsAnagramPair(test.First, test.Second);
			Console.WriteLine((result == test.Expected) ? "Success" : "FAIL");
		}
	}
	
	
	public static bool IsAnagramPair(string first, string second)
	{
		return GetOrderedLowerCaseLetters(first)
			.SequenceEqual(GetOrderedLowerCaseLetters(second));
	}
	
	public static IOrderedEnumerable<char> GetOrderedLowerCaseLetters(string given)
	{
		return given
			.ToLower()
			.ToCharArray()
			.Where(c => Char.IsLetter((c)))
			.OrderBy(c => c);
	}
	
	public static IEnumerable<TestCase> GetTestCases()
	{
		yield return new TestCase { First = "add", Second = "dad", Expected = true };
		yield return new TestCase { First = "aad", Second = "dad", Expected = false };
		yield return new TestCase { First = "Astronomer", Second = "Moon starer", Expected = true };
		yield return new TestCase { First = "thorough", Second = "through", Expected = false };
		yield return new TestCase { First = "Jim Morrison", Second = "Mr. Mojo Risin'", Expected = true };
	}
}

public class TestCase
{
	public string First { get; set; }
	public string Second { get; set; }
	public bool Expected { get; set; }
}