Add problem of the day

1 files changed, 13 insertions, 0 deletions

diff --git a/2020/08/18/README.md b/2020/08/18/README.md
new file mode 100644
index 0000000..a69a1e3
--- /dev/null
+++ b/2020/08/18/README.md
@@ -0,0 +1,13 @@
+│   Given a list of numbers, where every number shows up twice except for
+│   one number, find that one number.
+│   Example:
+│Input: [4, 3, 2, 4, 1, 3, 2]
+│Output: 1
+│
+│   Here's the function signature:
+│def singleNumber(nums):
+│  # Fill this in.
+│print singleNumber([4, 3, 2, 4, 1, 3, 2])
+│# 1
+│
+│   Challenge: Find a way to do this using O(1) memory.