First challenge (YearOfProgramming#309)

* challenge_0 in python

* challenge_1 in python

* [Python] Challenge_2

* [Python] Challenge_3

Author: randdane

challenge_0/python/whiterd/README.md

@@ -0,0 +1,5 @@
+#!/usr/bin/env python
+
+from __future__ import print_function
+
+print('Hello World!')

challenge_0/python/whiterd/src/hello_world.py

@@ -0,0 +1,4 @@
+
+Input: string
+
+Output: a reversed string of the given input

challenge_1/python/whiterd/README.md

@@ -0,0 +1,7 @@
+#!/usr/bin/env python
+
+from __future__ import print_function
+
+user_input = input('Enter text to be reversed: ')
+
+print(user_input[::-1])

challenge_1/python/whiterd/src/reverse_me.py

@@ -0,0 +1,4 @@
+
+Input: a list of integers.
+
+Output: the only non-repeated integer.

challenge_2/python/whiterd/README.md

@@ -0,0 +1,23 @@
+#!/usr/bin/env python
+
+'''
+    Input:  An array of random integers where every integer is repeated except
+    for a single one.
+
+    Output:  The single integer that does NOT repeat.
+'''
+
+from __future__ import print_function
+
+array_1 = [2,3,4,2,3,5,4,6,4,6,9,10,9,8,7,8,10,7]
+array_2 = [2,'a','l',3,'l',4,'k',2,3,4,'a',6,'c',4,'m',6,'m','k',9,10,9,8,7,8,10,7]
+
+def find_distinct(array):
+    for i in array:
+        if array.count(i) == 1:
+            return i
+
+
+if __name__ == '__main__':
+    print(find_distinct(array_1))
+    print(find_distinct(array_2))

challenge_2/python/whiterd/src/find_distinct.py

@@ -0,0 +1,8 @@
+Find Majority Element
+---------------------
+
+* Given an array of size n, find the majority element. The majority element is the element that appears more than n/2 times.
+
+* Assume:
+	* the array is non-empty.
+	* the majority element always exist in the array.

challenge_3/python/whiterd/README.md

@@ -0,0 +1,19 @@
+#!/usr/bin/env python
+
+'''
+    Input:  An array of integers.
+
+    Output:  The single integer that occurs most often.
+'''
+
+from __future__ import print_function
+from collections import Counter
+
+given_array = [2,2,3,7,5,7,7,7,4,7,2,7,4,5,6,7,7,8,6,7,7,8,10,12,29,30,19,10,7,7,7,7,7,7,7,7,7]
+
+def find_major(array):
+    counted = Counter(array)
+    return counted.most_common(1)[0][0]
+
+
+print(find_major(given_array))