C# Sharp Basic Algorithm Exercises: Count the number of times the string 'aa' appears in a given string and assume that 'aaa' contains two 'aa'

C# Sharp Basic Algorithm: Exercise-27 with Solution

Write a C# Sharp program to count the number of times the string "aa" appears in a given string and assume that "aaa" contains two "aa".

Pictorial Presentation:

Sample Solution:-

C# Sharp Code:

using System;
namespace exercises
{
   class Program
    {
        static void Main(string[] args)
        {
            Console.WriteLine(test("bbaaccaag"));
            Console.WriteLine(test("jjkiaaasew"));
            Console.WriteLine(test("JSaaakoiaa"));
            Console.ReadLine();
        }
       
     public static int test(string s)
        {
            int ctr_aa = 0;
            for (int i = 0; i < s.Length - 1; i++)
            {
                if (s.Substring(i, 2) == "aa")
                {
                    ctr_aa++;
                }
            }
            return ctr_aa;
        }
   }
}

Sample Output:

2
2
3

Flowchart:

C# Sharp Code Editor:

Improve this sample solution and post your code through Disqus

Previous: Write a C# Sharp program to create a new string which is n (non-negative integer ) copies of the the first 3 characters of a given string. If the length of the given string is less than 3 then return n copies of the string.
Next: Write a C# Sharp program to check if the first appearance of "a" in a given string is immediately followed by another "a".