Why time complexity in solution #1 is O(n)?

Courses
,
1

Time Complexity
The time complexity of this problem is O(n) as the list is iterated over once.
But indeed the list was iterated over only half of the size.

Sorry I couldn’t find appropriate tags for the question from the list

2

Hi @Denis_Prokhorov, can you please share the lesson link? Thanks!