Can we find Bitwise And of all subarrays of an array in O(n) time ? If not,then what is the best time complexity for doing this ?
Bitwise And of all subarrays of an array
Can we find Bitwise And of all subarrays of an array in O(n) time ? If not,then what is the best time complexity for doing this ?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | tourist | 3755 |
| 3 | ecnerwala | 3696 |
| 4 | VivaciousAubergine | 3647 |
| 5 | ksun48 | 3629 |
| 6 | jiangly | 3616 |
| 7 | turmax | 3559 |
| 8 | strapple | 3486 |
| 9 | Kevin114514 | 3427 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
