Discussion on Day 10: Binary Numbers Challenge

Sort by

recency

|

2808 Discussions

|

1 month ago+ 0 comments

    int n = Convert.ToInt32(Console.ReadLine().Trim());
    int count = 0;
    int max = 0;

    var bin = Convert.ToString(n, 2);

    for(int number = 0; number < bin.Length; number++)
    {
        if(bin[number] == '1')
        {
            count++;
        }
        else
        {
            count = 0;
        }

        if(count > max) max = count;
    }

    Console.WriteLine(max);

2 months ago+ 0 comments

import re
print(len(max(re.findall(r"(1+)",bin(int(input().strip()))[2:]))))

3 months ago+ 0 comments

nb=bin(n)[2:]
nb=nb.split('0')
m=0    
for i in nb:
    if len(i)>m:
        m=len(i)
print(m)
        
				
				
				
				
				
				ANOTHER CODE
				
				
				
n=int(input())
nb=bin(n)[2:]
c,m=0,0
for i in range(len(nb)):
    if nb[i]=='1':
        c+=1
        if c>m:
            m=c
    else:
        c=0
print(m)

3 months ago+ 0 comments

	
int n = stoi(ltrim(rtrim(n_temp)));
    int counter{0};
    int maxCounter{0};
    
    while (n > 0) {
        
        if (n % 2 == 1)
            counter++;
        else {
            counter = 0;
        }
         
        n = round(n / 2);

        if (maxCounter < counter)
            maxCounter = counter;
    }
    
    cout << maxCounter << endl;

3 months ago+ 0 comments

here's my c++ solution

    do {
        current = n & 1 ? current + 1 : 0;
        max = current > max ? current : max;
    } while (n >>= 1);

Sort by

|

2808 Discussions

|

Cookie support is required to access HackerRank

Please signup or login in order to view this challenge