BinaryGap Solution

BinaryGap.kt

fun solution(n: Int): Int {
    var longestBinaryGap = 0
    var currentBinaryGap = 0
    var isCounting = false

    // Get binary representation
    val binaryString = Integer.toBinaryString(n)

    for (char in binaryString) {
        when {
            // If we were already counting means binary gap ended
            char == '1' && isCounting -> {
                if (currentBinaryGap > longestBinaryGap) {
                    longestBinaryGap = currentBinaryGap
                }
                currentBinaryGap = 0
            }

            // When finding a 1 start counting
            char == '1' -> isCounting = true

            // When counting -> increment our binary gap
            char == '0' && isCounting -> currentBinaryGap++
        }
    }

    return longestBinaryGap
}