Search Results

For those who have to use an old .NET Framework (prior to 4.0). To eliminate removing of the last character, you could use the String.Join method: return String.Join(".", ipList.ConvertAll(x => x.ToS …

There are only two things I can suggest: You don't need to create a List<string> first and then copy it to an array via ToArray() extension method. You know an exact number of elements in the output …

You could use the StringBuilder class and the String.IndexOf method as follows: Option 1 private static string ReplaceNthOccurrence(string input, int n, char find, char replaceWith) { int inde …

The shortest code I can produce is: private static string Reverse(string input) { return String.Join(" ", input.Split(' ').Reverse()); } But the following alternative should be much faster: pr …

I'd prefer to rely on the builtin functionality as much as possible. I want to believe that use of the builtin stuff makes my code more readable and probably faster. So my proposal is: public class …

= second.Length) { return false; } return SetEqual(first, second); } If you are sure that strings contain only unique chars, there is a more efficient approach using the HashSet …

The following code part could be inefficient for large sets: .OrderByDescending(x => x.count) .First(); We don't need sorting at all, we need just to find an item with the maximum value. Let's create …

I'd prefer to use a dictionary for this. private delegate bool TryParseDelegate<T>(string text, out T value); private static readonly Dictionary<Type, object> TryParsers = new Dictionary<Type, obj …

The only approach I can suggest is to use an LCP array. Since my first implementation has extremely slow sorting of suffic array, I decided to base my new solution on the Sais implementation of the …

The easiest way I can see is to create 2 arrays of parentheses: 1 for the open ones and 1 for the close ones. We will use these arrays to check whether current char is a parenthesis and obtain its ind …