Binary Gap - Codibility - C#

BinaryGap.cs

using System;

namespace ObjectApp1
{
    class Program
    {
        static void Main(string[] args)
        {
            var S = new Solution();
            Console.WriteLine(S.solution(0));
        }
    }

    class Solution
    {
        public int solution(int n)
        {
            string bits = Convert.ToString(n, 2);
            //Console.WriteLine($"Bit String: {bits}");
            int longest = 0;
            int curCount = 0;

            for (int i = 0; i < bits.Length; i++)
            {
                if (bits[i] == '0')
                {
                    if (curCount > 0) curCount++;
                    else curCount = 1;
                } else curCount = 0;
                if (curCount > longest) longest = curCount;
            }

            return longest;
        }
    }
}

We can go for the bitwise, by this solution we can avoid the binary conversion,

Works for all test cases

public static int BinaryGapSolutionByBitwise(int N)
        {
            int maxLength = 0;
            int currCount = 0;
            bool counting = false;

            while (N > 0)
            {
                if ((N & 1) == 1)
                {
                    counting = true;
                    maxLength = Math.Max(maxLength, currCount);
                    currCount = 0;
                }
                else if (counting)
                {
                    currCount++;
                }

                N >>= 1; 
            }

            return maxLength;
        }