Given a bit pattern (in an integer INPUT), and another pattern (in an integer PATTERN, with a number n signifying the number of trailing bits to be considered as pattern - remaining bits are zero. Example: PATTERN=00000110, n=3 represents "110") Find the number of occurences of PATTERN inside INPUT

Question

Accepted Answer

Count the number of occurrences of a given bit pattern in an integer.

Extract the n trailing bits from the pattern and create a mask with all other bits set to zero.
Use a sliding window approach to compare the extracted pattern with all possible n-bit sequences in the input integer.
Increment a counter every time the extracted pattern matches with a sequence in the input integer.

Accepted Answer

"INPUT" (and any subsequent words) was ignored because we limit queries to 32 words

Accepted Answer

"INPUT" (and any subsequent words) was ignored because we limit queries to 32 words

Given a bit pattern (in an integer INPUT), and another pattern (in an integer PATTERN, with a number n signifying the number of trailing bits to be considered as pattern - remaining bits are zero. Example: PATTERN=00000110, n=3 represents "110") Find the number of occurences of PATTERN inside INPUT

Top Microsoft Corporation Software Developer interview questions & answers

Popular interview questions of Software Developer

Top HR questions asked in Microsoft Corporation Software Developer