Apply Bitwise Operations to Make Strings Equal at Sprinklr

Problem Description

You are given two **0-indexed binary** strings `s` and `target` of the same length `n`. You can do the following operation on `s` **any** number of times: * Choose two **different** indices `i` and `j` where `0 <= i, j < n`. * Simultaneously, replace `s[i]` with (`s[i]` **OR** `s[j]`) and `s[j]...

Topics