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 0809d99 commit 075ede4Copy full SHA for 075ede4
README.md
@@ -0,0 +1,15 @@
1
+# LeetCode Python Solutions
2
+This repo contains my Python solutions to LeetCode problems. I try to give ample
3
+documentation to maximize the pedagogy of my solutions, including time and space
4
+complexity and how I arrived 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
10
+- `nums[-1]` to get the last element
11
12
+While these operations are indeed Pythonic, they don't provide any extra
13
+functionality as compared to a low-level array. No short-cuts are intended.
14
15
+I very much welcome corrections. Thanks.
0 commit comments