# Tag Info

### Is solving Binary String Matching equivalent to Solving All type of string matching?

String matching performed bit by bit would be much slower than character by character, because a character is made of 8 or 16 bits and a processor can handle them in a single go. Also note that string ...
• 4,518
As said in my comment, binary numbers of size $n$ are not supported by current computers. We have two situations: only support the native binary type; as $n$ does not exceed $64$, you can very well ...