he-014
0.000
Challenge · difficulty 2/5
# HumanEval/14
Implement a file **`solution.py`** that completes the function below. Keep the given name and signature; your file must define it at module level.
```python
from typing import List
def all_prefixes(string: str) -> List[str]:
""" Return list of all prefixes from shortest to longest of the input string
>>> all_prefixes('abc')
['a', 'ab', 'abc']
"""
```
<!-- imported from OpenAI HumanEval (HumanEval/14) -->
tests/test_he_014.py
# Auto-generated from OpenAI HumanEval HumanEval/14. Do not edit by hand.
from solution import * # noqa: F401,F403 (prompt helpers may be referenced by tests)
from solution import all_prefixes as candidate
METADATA = {
'author': 'jt',
'dataset': 'test'
}
def check(candidate):
assert candidate('') == []
assert candidate('asdfgh') == ['a', 'as', 'asd', 'asdf', 'asdfg', 'asdfgh']
assert candidate('WWW') == ['W', 'WW', 'WWW']
def test_he_014():
check(candidate)
Proposed solution
```python
def all_prefixes(string: str) -> List[str]:
""" Return list of all prefixes from shortest to longest of the sentences
['a', 'ab', 'abc', 'aab', 'aabc', 'abc', 'abb', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abc', 'abcErrors (stderr)
no code extracted from response