We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent be16094 commit c94d1d8Copy full SHA for c94d1d8
README.md
@@ -5,8 +5,9 @@ complexity and how I arrive at them.
5
6
For expediency, when problems involve an array, I am OK with using a Python list
7
instead and using the following operations:
8
-- `for i in range(n)` to iterate over the list
9
-- `for i in range(bigger, smaller, -1)` to iterate backwards
+- `for i in range(n):` to iterate over the list
+- `for i in range(bigger, smaller, -1):` to iterate backwards
10
+- `for i, v in enumerate(nums):` to iterate over index and value simultaneously
11
- `nums[-1]` to get the last element
12
13
While these operations are indeed Pythonic, they don't provide any extra
0 commit comments