Removed LRU Cache: not the best implementation

izanbf1803 · izanbf1803 · commit c21ee61d14b7 · 2017-09-13T19:12:01.000+02:00
diff --git a/README.md b/README.md
@@ -45,8 +45,6 @@ Minimal and clean example implementations of data structures and algorithms in P
     - [single_number](bit/single_number.py)
     - [subsets](bit/subsets.py)
     - [add_without_operator](bit/add_without_operator.py)
-- [cache](cache)
-    - [lru_cache](cache/lru_cache.py)
 - [calculator](calculator)
     - [math_parser](calculator/math_parser.py)
 - [dfs](dfs)
diff --git a/cache/lru_cache.py b/cache/lru_cache.py
diff --git a/math/nth_digit.py b/math/nth_digit.py
@@ -17,4 +17,4 @@ def find_nth_digit(n):
         start *= 10
     start += (n-1) / len
     s = str(start)
-    return int(s[(n-1) % len])
+    return int(s[(n-1) % len])
