All Problems

83 problems total

Array (1905)Sorting (440)Depth First Search (316)Database (301)Breadth First Search (241)Tree (240)Stack (172)Graph Theory (169)Linked List (81)Monotonic Stack (67)Queue (50)Recursion (48)Shortest Path (33)
All Topics(4301)Algorithms(3944)Database(305)Networking(0)Object Oriented Design(31)Programming Languages(5)System Design(0)

Filter by Difficulty:

EasyMediumHard

Tag:

Company:

Active filters:Tag: bits×
TitleDifficultyVideosCompanies
Add one to a number without using plus or minus signeasy-
Add two numbers without using the plus operatorhard-
Check If a String Contains All Binary Codes of Size Kmedium-
Check If an Integer's Bit Representation Is a Palindromemedium-
Check if ith bit is set in a 32 bit integereasy-
Check if number is odd or eveneasy-
Clear the n-th biteasy-
Count Binary Strings Without Consecutive 1seasy-
Create a word with a single 0-bit at the position of the rightmost 1-biteasy-
Create a word with a single 1-bit at the position of the rightmost 0-biteasy-
Determine if a string has all unique charactersmedium-
Explain (n & (n-1)) == 0easy-
Explain x & (-x)easy-
Fast way to multiply a number by 7easy-
Find if a number is divisible by 17 using bitwise operatorsmedium-
Find maximum of two numbers without using comparison operators or if-elsemedium-
Find missing integer in an array with only access to jth bit of elementsmedium-
Find Position Of Most Significant Bit In An Integereasy-
Find Position of the only Set Biteasy-
Find Rightmost Set Bit of a Numbereasy-
Find Rightmost Unset Bit of a Numbereasy-
Find the largest power of 2 less than a given numbereasy-
Find the nearest numbers that have same number of 1s for an integermedium-
Find the next higher number containing the same number of set bitsmedium-
Game of Master Mindmedium-
Generate All Strings of n bitsmedium-
Implement Arithematic Operators Using Bit Manipulationmedium-
Implement multiplication, subtraction, and division using only additionmedium-
Integer to Binary numbereasy-
Isolate the rightmost 1-biteasy-
Maximum Number of set bits after flipping a single contagious segment of bitseasy-
Min Xor Valueeasy-
booking
Print binary representation of a decimal numbermedium-
Right propagate the rightmost 1-biteasy-
Set all bits of a number in a range equal to another numbermedium-
Set the n-th biteasy-
Subtract Two Numbers Without Using Arithematic Operatorseasy-
Implement Power Function 1medium-
adobeamazonapple
Sum of two numbers using only bitwise operatorsmedium
Swap bits at position i and jeasy-
Swap Nibbles in a Byteeasy-
Swap odd and even bits in an integermedium-
cisco
Swap two number in place without temporary variablesmedium-
Toggle a specified bit in a bit string without effecting other bitseasy-
Toggle the n-th biteasy-
Turn off the rightmost 1-biteasy-
Turn off the rightmost contiguous string of 1’smedium-
Turn on the rightmost 0-biteasy-
Turning a bit off without affecting other bitseasy-
Twitter Codility Problem - Max Binary Gapeasy-
Showing 1 to 50 of 83 results
12Next