Python solution for day 16 (#161)

* Add @vishalshirke7 as a contributor

* Update @vishalshirke7 as a contributor

* Added python solutions for Day 4

* modified readme

* Add @Vishal

* reverted adding as a contributor

* Update README.md

* Update CONTRIBUTORS.md

* Update CONTRIBUTORS.md

* Added python solutions for day 7

* Edited python solution for day 7

* Edited python solution for day 7

* Added python solution for day 10

* Changed readme for day 10

* minor changes

* Python solution for day 11

* Python solution for day10 and day11

* Added python solution for day 13

* python solution for day 14

* Python solution for day 16

Author: vishalshirke7

day14/Python/sumdigits.py

@@ -0,0 +1,14 @@
+"""
+  @author : vishalshirke7
+  @date : 08/01/2019
+"""
+
+
+def sum_of_digits(n):
+    if n <= 0:
+        return n
+    else:
+        return (n % 10) + sum_of_digits(n // 10)
+
+
+print(sum_of_digits(int(input())))

day14/README.md

@@ -90,8 +90,29 @@ public class SumDigits {
 }
 ```
 
-#### [Solution](./Java/Sumrec.java)
+### Python Implementation
+
+#### [Solution by  @vishalshirke7](./Python/sumdigits.py)
+```python
+
+"""
+  @author : vishalshirke7
+  @date : 08/01/2019
+"""
+
+
+def sum_of_digits(n):
+    if n <= 0:
+        return n
+    else:
+        return (n % 10) + sum_of_digits(n // 10)
 
+
+print(sum_of_digits(int(input())))
+
+
+#### [Solution](./Java/Sumrec.java)
+```
 /**
  * @date 08/01/19
  * @author SPREEHA DUTTA

day16/Python/tower_hanoi.py

@@ -0,0 +1,17 @@
+"""
+  @author : vishalshirke7
+  @date : 10/01/2019
+"""
+
+
+def towerhanoi(n, from_rod, to_rod, aux_rod):
+    if n == 1:
+        print("Move disk 1 from rod %d to rod %d"%(from_rod, to_rod))
+        return
+    towerhanoi(n - 1, from_rod, aux_rod, to_rod)
+    print("Move disk 1 from rod %d to rod %d"%(from_rod, to_rod))
+    towerhanoi(n - 1, aux_rod, to_rod, from_rod)
+
+
+no_of_disks = int(input())
+towerhanoi(no_of_disks, 'A', 'C', 'B')

day16/README.md

@@ -44,4 +44,29 @@ console.log ('/* ===== for 2 disks ===== */');
 towerOfHanoi (2, 'A', 'C', 'B');
 console.log ('\n/* ===== for 3 disks ===== */');
 towerOfHanoi (3, 'A', 'C', 'B');
+```
+
+## Python Implementation
+
+### [Solution](./Python/tower_hanoi.py)
+```python
+
+"""
+  @author : vishalshirke7
+  @date : 10/01/2019
+"""
+
+
+def towerhanoi(n, from_rod, to_rod, aux_rod):
+    if n == 1:
+        print("Move disk 1 from rod %d to rod %d"%(from_rod, to_rod))
+        return
+    towerhanoi(n - 1, from_rod, aux_rod, to_rod)
+    print("Move disk 1 from rod %d to rod %d"%(from_rod, to_rod))
+    towerhanoi(n - 1, aux_rod, to_rod, from_rod)
+
+
+no_of_disks = int(input())
+towerhanoi(no_of_disks, 'A', 'C', 'B')
+
 ```