Новый курс! Каждый программист должен знать генеративный ИИ!
0

# Bit sequence

Hello everyone. I start by saying that I don't want to solve any task but at least understand the reasoning to find a solution algorithm. Practically I was given a problem that says that given a sequence of 11 bits such as 00001111111, I have to check which sub-sequence (if the one formed by 0 or 1) is the one with the most bits. Thanks in advance and sorry for the english.

24th Mar 2020, 8:56 PM
Computer_King20
4 ответов
+ 2
Hi, my only idea would be the subsequence with most equal bits. That would be 1111111.
24th Mar 2020, 9:12 PM
Oma Falk
0
what does the sub-sequence mean and what should I print in practice?
24th Mar 2020, 8:58 PM
Computer_King20
0
Oma Falk so if for example I enter 10001111101 and then 11111100000 I have to check for example in the first code what was the most present number of bits
24th Mar 2020, 9:16 PM
Computer_King20
0
~ swim ~ ok then i think i understand, thank you all.
24th Mar 2020, 10:00 PM
Computer_King20