Given a string, convert it using UTF-8 into a binary array where each character or byte is arraigned low to high. For example: Input: 'abc', goes to [97 98 99], and then Ouput: [1 0 0 0 0 1 1 0 1 0 0 0 1 1 1 1 0 0 0 1 1];
Solution Stats
Problem Recent Solvers6
Suggested Problems
-
591 Solvers
-
143 Solvers
-
214 Solvers
-
Is this triangle right-angled?
1420 Solvers
-
1292 Solvers
More from this Author17
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Problem Tags