You need to sign in or sign up before continuing.×
2 kyu
Regular Expression - Check if divisible by 0b111 (7)
748 of 2,222Hacker Sakana
Description:
Create a regular expression capable of evaluating binary strings (which consist of only 1's and 0's) and determining whether the given string represents a number divisible by 7.
Note:
- Empty strings should be rejected.
- Your solution should reject strings with any character other than
0and1. - No leading
0's will be tested unless the string exactly denotes0.
Puzzles
Regular Expressions
Strings
Algorithms
Similar Kata:
Stats:
| Created | Jan 26, 2016 |
| Published | Jan 26, 2016 |
| Warriors Trained | 14736 |
| Total Skips | 2996 |
| Total Code Submissions | 20901 |
| Total Times Completed | 2222 |
| JavaScript Completions | 748 |
| Python Completions | 787 |
| Java Completions | 288 |
| Ruby Completions | 128 |
| CoffeeScript Completions | 57 |
| C# Completions | 227 |
| C++ Completions | 258 |
| PHP Completions | 127 |
| BF Completions | 20 |
| Go Completions | 73 |
| TypeScript Completions | 72 |
| Kotlin Completions | 51 |
| Factor Completions | 18 |
| Haskell Completions | 58 |
| C Completions | 76 |
| Rust Completions | 44 |
| Total Stars | 576 |
| % of votes with a positive feedback rating | 92% of 430 |
| Total "Very Satisfied" Votes | 378 |
| Total "Somewhat Satisfied" Votes | 35 |
| Total "Not Satisfied" Votes | 17 |
| Total Rank Assessments | 5 |
| Average Assessed Rank | 2 kyu |
| Highest Assessed Rank | 2 kyu |
| Lowest Assessed Rank | 4 kyu |
