diff --git a/functions/palindrome_number.py b/functions/palindrome_number.py
index 26529ec..080a01f 100644
--- a/functions/palindrome_number.py
+++ b/functions/palindrome_number.py
@@ -1,2 +1,12 @@
 def palindrome_number(x):
-    pass
+    temp = x
+    reverse = 0
+    while(x>0):
+        dig = x%10
+        reverse = reverse*10 + dig
+        x = x//10
+
+        if temp == reverse:
+            return True
+        else:
+            return False
diff --git a/functions/two_sum.py b/functions/two_sum.py
index 0a8adcb..fd2afb0 100644
--- a/functions/two_sum.py
+++ b/functions/two_sum.py
@@ -1,2 +1,6 @@
 def twoSum(n, t):
-    pass
+    for i in range(len(n)):
+        for j in range(i + 1, len(n)):
+            if n[j] == t - n[i]:
+                return [i, j]
+#Did this push to the right branch? 
\ No newline at end of file
diff --git a/tests/two_sum_test.py b/tests/two_sum_test.py
index a2724cf..caed5b4 100644
--- a/tests/two_sum_test.py
+++ b/tests/two_sum_test.py
@@ -1,2 +1,38 @@
 import pytest
 from functions.two_sum import twoSum
+
+
+def test_returns_0_1_for_2_7_11_15_with_target_9():
+    # Arrange
+    n = [2, 7, 11, 15]
+    t = 9
+
+    # Act
+    answer = twoSum(n, t)
+
+    # Assert
+    assert answer == [0, 1]
+
+
+def test_returns_1_2_for_3_2_4_with_target_6():
+    # Arrange
+    n = [3, 2, 4]
+    t = 6
+
+    # Act
+    answer = twoSum(n, t)
+
+    # Assert
+    assert answer == [1, 2]
+
+
+def test_returns_0_1_for_3_3_with_target_6():
+    # Arrange
+    n = [3, 3]
+    t = 6
+
+    # Act
+    answer = twoSum(n, t)
+
+    # Assert
+    assert answer == [0, 1]
\ No newline at end of file