C# Sharp Basic Algorithm Exercises: Count a substring of length 2 appears any where in a given string as well as appears at the end of the string

C# Sharp Basic Algorithm: Exercise-31 with Solution

Write a C# Sharp program to count a substring of length 2 appears any where in a given string as well as appears at the end of the string. Do not count the end substring.

Pictorial Presentation:

Sample Solution:-

C# Sharp Code:

using System;
namespace exercises
{
   class Program
    {
        static void Main(string[] args)
        {
            Console.WriteLine(test("abcdsab"));
            Console.WriteLine(test("abcdabab"));
            Console.WriteLine(test("abcabdabab"));
            Console.WriteLine(test("abcabd"));
            Console.ReadLine();
        }
        public static int test(string str)
        {
            var last_two_char = str.Substring(str.Length-2);
            var ctr = 0;

            for (var i = 0; i < str.Length-2; i++)
            {
               if (str.Substring(i, 2).Equals(last_two_char)) ctr++;
            }
            return ctr;
        }
   }
}

Sample Output:

1
2
3
0

Flowchart:

C# Sharp Code Editor:

Improve this sample solution and post your code through Disqus

Previous: Write a C# Sharp program to create a string like  "aababcabcd" from a given string "abcd".
Next: Write a C# Sharp program to check a specified number is preset in a given array of integers.