Why not use len(alist) in an iterator?

[snippsat]

Should not use range(len(sequence)) when can just simple loop over and get the result.

from string import ascii_lowercase

alphabet = [a for a in ascii_lowercase]
for letter in alphabet:
    print(letter, end=' ')

Output:
a b c d e f g h i j k l m n o p q r s t u v w x y z 

So over there is no manipulation of index,the just use a simple loop

---

We see to often range(len(sequence)) used when need manipulation of index,often this is a not a good way.
To make simple example that need manipulation of index,only now we use enumerate.

from string import ascii_lowercase

alphabet = [a for a in ascii_lowercase]
increment = 5
for index, letter in enumerate(alphabet):
    new_index = index + increment
    print(f'original index = {index}, new index = {new_index}, letter = {letter}')

Output:
original index = 0, new index = 5, letter = a
original index = 1, new index = 6, letter = b
original index = 2, new index = 7, letter = c
.....

It works with range(len(sequence)),but the way over with enumerate is better(explain last).

from string import ascii_lowercase

alphabet = [a for a in ascii_lowercase]
increment = 5
for index in range(len(alphabet)):
    letter = alphabet[index]
    new_index = index + increment
    print(f'original index = {index}, new index = {new_index}, letter = {letter}')

Output:
original index = 0, new index = 5, letter = a
original index = 1, new index = 6, letter = b
original index = 2, new index = 7, letter = c
.....

---

Using range(len(sequence)) is less ideal because it separates the index and value retrieval,
making the code less readable and more prone to off-by-one errors or indexing mistakes.
In contrast, enumerate combines the index and value retrieval,making the code more straightforward and less error-prone.