Loops are used to work with strings as well as numbers. For example, you can get a specific character by its index, and also form strings in loops.
Below is some sample code that prints the letters of each word on a separate line:
def print_name_by_symbol(name):
i = 0
# This check will run until the end of the string,
# including the last character. Its index is `length - 1`.
while i < len(name):
# Accessing the symbol by its index
print(name[i])
i += 1
name = 'Arya'
print_name_by_symbol(name)
# => 'A'
# => 'r'
# => 'y'
# => 'a'
The main thing in this code is to put the proper condition in while
. This can be done in two ways: i < len(name)
or i <= len(name) - 1
- they'll both give the same result.
Implement a function called print_reversed_word_by_symbol()
that prints a word passed to it character by character, as in the example from the theory, but in reverse order.
word = 'Hexlet'
print_reversed_word_by_symbol(word)
# => 't'
# => 'e'
# => 'l'
# => 'x'
# => 'e'
# => 'H'
If you've reached a deadlock it's time to ask your question in the «Discussions». How ask a question correctly:
Tests are designed so that they test the solution in different ways and against different data. Often the solution works with one kind of input data but doesn't work with others. Check the «Tests» tab to figure this out, you can find hints at the error output.
It's fine. 🙆 One task in programming can be solved in many different ways. If your code passed all tests, it complies with the task conditions.
In some rare cases, the solution may be adjusted to the tests, but this can be seen immediately.
It's hard to make educational materials that will suit everyone. We do our best but there is always something to improve. If you see a material that is not clear to you, describe the problem in “Discussions”. It will be great if you'll write unclear points in the question form. Usually, we need a few days for corrections.
By the way, you can participate in courses improvement. There is a link below to the lessons course code which you can edit right in your browser.
Your exercise will be checked with these tests:
1import index
2from hexlet.test import expect_output
3
4
5def test(capsys):
6 index.print_reversed_word_by_symbol('Hexlet')
7 expected = 't\ne\nl\nx\ne\nH'
8 expect_output(capsys, expected)
9
Teacher's solution will be available in: