Problems Topics Tags Progress

Search

Home

|

Tag

|

Bitmasks

Problems with tag Bitmasks

23 found, showing 1 to 23

1

;

Check if The Number is Fascinating ->

Easy, #2729, 2 solutions

Count Numbers With Unique Digits II ->

Easy, #3032, 2 solutions

Count the Number of Square-Free Subsets ->

Medium, #2572, 2 solutions

Count Words Obtained After Adding a Letter ->

Medium, #2135, 2 solutions

Find a Good Subset of the Matrix ->

Hard, #2732, 2 solutions

Find Products of Elements of Big Array ->

Hard, #3145, 2 solutions

Find The K-th Lucky Number ->

Medium, #2802, 2 solutions

Groups of Strings ->

Hard, #2157, 2 solutions

Maximum Cost of Trip With K Highways ->

Hard, #2247, 2 solutions

Maximum Good People Based on Statements ->

Hard, #2151, 2 solutions

Maximum Hamming Distances ->

Hard, #3141, 2 solutions

Maximum Points in an Archery Competition ->

Medium, #2212, 2 solutions

Maximum Rows Covered by Columns ->

Medium, #2397, 2 solutions

Minimize OR of Remaining Elements Using Operations ->

Hard, #3022, 2 solutions

Minimum Number of Lines to Cover Points ->

Medium, #2152, 2 solutions

Minimum Operations to Form Subsequence With Target Sum ->

Hard, #2835, 2 solutions

Minimum Time to Kill All Monsters ->

Hard, #2403, 2 solutions

Number of Possible Sets of Closing Branches ->

Hard, #2959, 2 solutions

Number of Self-Divisible Permutations ->

Medium, #2992, 2 solutions

Number of Strings Which Can Be Rearranged to Contain Substring ->

Medium, #2930, 2 solutions

Remove All Ones With Row and Column Flips II ->

Medium, #2174, 2 solutions

Smallest Subarrays With Maximum Bitwise OR ->

Medium, #2411, 2 solutions

Sum of Values at Indices With K Set Bits ->

Easy, #2859, 2 solutions