From 4dfcdacf409d8bd8511a0ba11758218360ba3537 Mon Sep 17 00:00:00 2001
From: Jagjit Singh <jagjitsingh@Jagjits-MacBook-Pro.local>
Date: Sun, 13 Oct 2019 20:22:05 +0530
Subject: [PATCH 1/3] find duplicates in arra using hashmap in java

---
 FindDuplicates.java | 61 +++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 61 insertions(+)
 create mode 100644 FindDuplicates.java

diff --git a/FindDuplicates.java b/FindDuplicates.java
new file mode 100644
index 0000000..8f6686e
--- /dev/null
+++ b/FindDuplicates.java
@@ -0,0 +1,61 @@
+package com.jagjit.Hactoberfest;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+public class FindDuplicates {
+
+	// function that return the value
+	private static List<Integer> findDuplicates(int[] nums) {
+
+		List<Integer> result = new ArrayList<Integer>();
+
+		// initialising the hashmap
+		int count = 0;
+		Map<Integer, Integer> map = new HashMap<Integer, Integer>();
+		
+		//iterates through every element 
+		for (int i = 0; i < nums.length; i++) {
+			
+			//if map contains duplicate value then add to result list
+			if (map.containsKey(nums[i])) {
+				result.add(nums[i]);
+			}
+			//putting the value in the map
+			map.put(nums[i], count++);
+		}
+		
+		//return the final list
+		return result;
+
+	}
+
+	public static void main(String[] args) {
+
+		// allocating memory for 5 integers.
+		int[] nums = new int[8];
+
+		// initialize the first elements of the array
+		nums[0] = 4;
+		nums[1] = 3;
+		nums[2] = 2;
+		nums[3] = 7;
+		nums[4] = 8;
+		nums[5] = 2;
+		nums[6] = 3;
+		nums[7] = 1;
+
+		List<Integer> result = findDuplicates(nums);
+
+		for (Integer i : result) {
+			
+			//print the value of duplicates value
+			System.out.print(i + " ");
+
+		}
+
+	}
+
+}

From d0059a2417602b5a5ab1f2e6811490c488bc204b Mon Sep 17 00:00:00 2001
From: Jagjit Singh <jagjitsingh@Jagjits-MacBook-Pro.local>
Date: Sun, 13 Oct 2019 23:06:20 +0530
Subject: [PATCH 2/3] commit according to rules

---
 #442/java/hashmap/.DS_Store                      | Bin 0 -> 6148 bytes
 .../java/hashmap/Solution.java                   |   8 ++++++++
 2 files changed, 8 insertions(+)
 create mode 100644 #442/java/hashmap/.DS_Store
 rename FindDuplicates.java => #442/java/hashmap/Solution.java (87%)

diff --git a/#442/java/hashmap/.DS_Store b/#442/java/hashmap/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..fd11fdedca78ff1c832f4580f8adbb8a3f8412a0
GIT binary patch
literal 6148
zcmeHKJx{|>3_L@JN(iYV;~SZfm|3E#49xulw6K68vQXx1{A@UXfQSME3j;b!_Pyu$
z@{$|k7=W!0_m{v5z>@BWR}XXZ>+Ul<s*DloyvH*hFyILnc$`&#pK$Iewq*4<O!zyz
zV0Y6Gcl&<Wv&tXwihlkU#+6J8NC7Dz1*Cu!_`L$&duhv)L`5ke1*E{I0{(qybjPl6
zOpH$lLyQ2#1=C?%$1Fi?o*;IGV<Iy&ODZv`RwITbo%vREUE!FRbXc6s`_#!+6N<&@
z%(p0qb%}~nKnhG1IL__L`~Nllhxva>(oPCUfq$idEjHWDny*y7b@p=JYa9KR{$Z?*
na)xNd#AwCbcq=~pQrCRV>s{fP7<A@?PSlTp>mri^f1$uTgMAzB

literal 0
HcmV?d00001

diff --git a/FindDuplicates.java b/#442/java/hashmap/Solution.java
similarity index 87%
rename from FindDuplicates.java
rename to #442/java/hashmap/Solution.java
index 8f6686e..f65ae06 100644
--- a/FindDuplicates.java
+++ b/#442/java/hashmap/Solution.java
@@ -5,6 +5,14 @@
 import java.util.List;
 import java.util.Map;
 
+
+/**
+ * https://leetcode.com/problems/find-all-duplicates-in-an-array/
+ * runtime beats 9.32% of Java submissions
+ * memory usage beats 36.11% of Java submissions
+ */
+
+
 public class FindDuplicates {
 
 	// function that return the value

From 21d127c2e172ff162767ae170ff80abf9d6faff2 Mon Sep 17 00:00:00 2001
From: Jagjit Singh <jagjitsingh@Jagjits-MacBook-Pro.local>
Date: Mon, 14 Oct 2019 11:18:35 +0530
Subject: [PATCH 3/3] Java Solution of Climbing Stairs

---
 #70/java/dynamic_programming/Solution.java | 24 ++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 #70/java/dynamic_programming/Solution.java

diff --git a/#70/java/dynamic_programming/Solution.java b/#70/java/dynamic_programming/Solution.java
new file mode 100644
index 0000000..044d512
--- /dev/null
+++ b/#70/java/dynamic_programming/Solution.java
@@ -0,0 +1,24 @@
+package com.jagjit.Hactoberfest;
+
+/**
+ * https://leetcode.com/problems/climbing-stairs/ Runtime: 0 ms, faster than
+ * 100.00% of Java online submissions for Climbing Stairs. Memory Usage: 33.2
+ * MB, less than 5.26% of Java online submissions for Climbing Stairs.
+ */
+public class Solution {
+
+	// below the function which returns count
+	public int climbStairs(int n) {
+		int[] dp = new int[n];
+		if (n < 2) {
+			return 1;
+		}
+		dp[0] = 1;
+		dp[1] = 2;
+		for (int i = 2; i < n; i++) {
+			dp[i] = dp[i - 1] + dp[i - 2];
+		}
+		return dp[n - 1];
+	}
+
+}