diff --git a/#442/Solution.java b/#442/Solution.java
new file mode 100644
index 0000000..67bade0
--- /dev/null
+++ b/#442/Solution.java
@@ -0,0 +1,16 @@
+/**
+ * https://leetcode.com/problems/find-all-duplicates-in-an-array/
+ */
+
+class Solution {
+	public List<Integer> findDuplicates(int[] nums) {
+		List<Integer> duplicates = new ArrayList<Integer>();
+		Set<Integer> noDupes = new HashSet<Integer>();
+        for (int i = 0; i < nums.length; i++){
+            if(noDupes.add(nums[i]) == false) {
+            	duplicates.add(nums[i]);
+            }
+        }
+        return duplicates;
+	}
+}
diff --git a/#70/Solution.java b/#70/Solution.java
new file mode 100644
index 0000000..6afdefb
--- /dev/null
+++ b/#70/Solution.java
@@ -0,0 +1,15 @@
+class Solution {
+    public int climbStairs(int n) {
+	    	if(n ==1) {
+	    		return n;
+	    	}
+	    	int first = 1;
+	    	int second = 2;
+	    	for (int i = 3; i <= n; i++) {
+	    		int third = first + second;
+	    		first = second;
+	    		second = third;
+	    	}
+	    	return second;
+	    }
+}
\ No newline at end of file