Problems Topics Tags Progress

Search

Home

|

Tag

|

Bit Manipulation

Problems with tag Bit Manipulation

224 found, showing 30 to 60

2

...

;

Count Number of Maximum Bitwise-OR Subsets ->

Medium, #2044, 2 solutions

Count Pairs of Points With Distance k ->

Medium, #2857, 2 solutions

Count Pairs Of Similar Strings ->

Easy, #2506, 2 solutions

Count Pairs With XOR in a Range ->

Hard, #1803, 3 solutions

Count Paths That Can Form a Palindrome in a Tree ->

Hard, #2791, 2 solutions

Count Subtrees With Max Distance Between Cities ->

Hard, #1617, 2 solutions

Count the Number of Beautiful Subarrays ->

Medium, #2588, 2 solutions

Count the Number of Consistent Strings ->

Easy, #1684, 2 solutions

Count the Number of Square-Free Subsets ->

Medium, #2572, 2 solutions

Count Triplets That Can Form Two Arrays of Equal XOR ->

Medium, #1442, 2 solutions

Count Words Obtained After Adding a Letter ->

Medium, #2135, 2 solutions

Distribute Repeating Integers ->

Hard, #1655, 2 solutions

Divide Array Into Equal Pairs ->

Easy, #2206, 2 solutions

Divide Two Integers ->

Medium, #29, 5 solutions

Encode Number ->

Medium, #1256, 2 solutions

Fair Distribution of Cookies ->

Medium, #2305, 2 solutions

Find a Good Subset of the Matrix ->

Hard, #2732, 2 solutions

Find a Value of a Mysterious Function Closest to Target ->

Hard, #1521, 2 solutions

Decode XORed Array ->

Easy, #1720, 2 solutions

Find Kth Largest XOR Coordinate Value ->

Medium, #1738, 3 solutions

Find Longest Awesome Substring ->

Hard, #1542, 2 solutions

Find Minimum Time to Finish All Jobs ->

Hard, #1723, 2 solutions

Find Missing and Repeated Values ->

Easy, #2965, 2 solutions

Find Number of Ways to Reach the K-th Stair ->

Hard, #3154, 2 solutions

Find Products of Elements of Big Array ->

Hard, #3145, 2 solutions

Decode XORed Permutation ->

Medium, #1734, 3 solutions

Counting Bits ->

Easy, #338, 3 solutions

Find if Array Can Be Sorted ->

Medium, #3011, 2 solutions

Find Root of N-Ary Tree ->

Medium, #1506, 2 solutions

Find Subarray With Bitwise AND Closest to K ->

Hard, #3171, 2 solutions