Given an array of 0s and 1s, find the position of 0 to be replaced with 1 to get longest continuous sequence of 1s. Expected time complexity is O(n)
Tag - binary numbers table
C Programming - Binary representation of a given number - Bit Algorithm - Write a program to print Binary representation of a given number.
Add 1 to a given number - Bit Algorithm - Add 1 to a given number write a program to add 1 to a given number. You are not allowed to use operators like ‘+’,
Count total set bits in all numbers from 1 to n - Bit Algorithm - In other words, if the control goes inside while loop of getNextLeftmostBit().
C Programming-program to add two numbers in base 14 - Mathematical algorithms - Just add the numbers in base 14 in same way we add in base 10.