1-bit and 2-bit Characters Problem

1-bit and 2-bit Characters Problem — ExecCode Easy DSA Practice

Solve the 1-bit and 2-bit Characters problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Description We have two special characters: The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11). Given a binary array bits that ends with 0, return true if the last character must be a one-bit character. Examples Ex…

Practice 1-bit and 2-bit Characters free on ExecCode. Browse more ExecCode DSA problems.