From cfdd1142dedf1d1d7da19c26e909e59184d9720b Mon Sep 17 00:00:00 2001
From: 10coder <37743191+10coder@users.noreply.github.com>
Date: Fri, 5 Jun 2020 00:15:40 +0530
Subject: [PATCH 1/3] DSA_easy_day1

---
 src/hackerrank/easy/Solution.java | 58 +++++++++++++++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 src/hackerrank/easy/Solution.java

diff --git a/src/hackerrank/easy/Solution.java b/src/hackerrank/easy/Solution.java
new file mode 100644
index 0000000..806076d
--- /dev/null
+++ b/src/hackerrank/easy/Solution.java
@@ -0,0 +1,58 @@
+import java.util.Scanner;
+
+public class Solution {
+	public static void main(String args[]) {
+		Scanner sc = new Scanner(System.in);
+		int arr[][] = new int[6][6];
+		int sum[][] = new int[4][4];
+		int largest=Integer.MIN_VALUE;
+        for (int i = 0; i < 6; i++) {
+            String[] arrRowItems = sc.nextLine().split(" ");
+            sc.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
+
+            for (int j = 0; j < 6; j++) {
+                int arrItem = Integer.parseInt(arrRowItems[j]);
+                arr[i][j] = arrItem;
+            }
+        }
+
+		largest = fillHourSum(arr,sum,largest);
+		System.out.println(largest);
+		sc.close();
+	}
+	
+	public static int fillHourSum(int[][] a, int[][] s, int larg) {
+		for(int i=0; i<=3; i++) {
+			for(int j=0; j<=3; j++) {
+				int sum =0;
+				for(int k=i; k<i+3; k++) {
+					for(int l=j; l<j+3; l++) {
+						if(isToSkip(i, j, k, l))
+							try {
+								sum = sum + a[k][l];								
+							} catch (Exception e) {
+								System.out.println(String.format("%s--%s--%s--%s", i, j, k, l));
+							}
+					}
+				}
+				s[i][j] = sum;
+				larg = sum>larg? sum : larg;
+			}
+		}
+		//printArray(s);
+		return larg;
+		}
+	
+	public static void printArray(int[][] a) {
+		for(int i=0;i <a.length ;i++) {
+			for(int j=0; j<a.length; j++) {
+				System.out.print(a[i][j] + "  ");
+			}
+			System.out.println();
+		}
+	}
+
+	private static boolean isToSkip(int i, int j, int k, int l) {
+		return !(k==i+1 && (l==j || l==j+2));
+	}
+}

From f342f7a048635b3117dc9f6556c9d4fd54766bda Mon Sep 17 00:00:00 2001
From: 10coder <37743191+10coder@users.noreply.github.com>
Date: Fri, 5 Jun 2020 00:19:38 +0530
Subject: [PATCH 2/3] Update and rename Solution.java to Aravind_2d_easy.java

---
 src/hackerrank/easy/{Solution.java => Aravind_2d_easy.java} | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 rename src/hackerrank/easy/{Solution.java => Aravind_2d_easy.java} (94%)

diff --git a/src/hackerrank/easy/Solution.java b/src/hackerrank/easy/Aravind_2d_easy.java
similarity index 94%
rename from src/hackerrank/easy/Solution.java
rename to src/hackerrank/easy/Aravind_2d_easy.java
index 806076d..5baeced 100644
--- a/src/hackerrank/easy/Solution.java
+++ b/src/hackerrank/easy/Aravind_2d_easy.java
@@ -1,6 +1,6 @@
 import java.util.Scanner;
 
-public class Solution {
+public class Aravind_2d_easy {
 	public static void main(String args[]) {
 		Scanner sc = new Scanner(System.in);
 		int arr[][] = new int[6][6];

From 69eb0e52bb793a41314d2a655503e4e15fff73c0 Mon Sep 17 00:00:00 2001
From: 10coder <37743191+10coder@users.noreply.github.com>
Date: Fri, 5 Jun 2020 10:15:41 +0530
Subject: [PATCH 3/3] Aravind_day1_medium_SparseArray

---
 .../medium/Aravind_day1_medium_SparseArray    | 43 +++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 src/hackerrank/medium/Aravind_day1_medium_SparseArray

diff --git a/src/hackerrank/medium/Aravind_day1_medium_SparseArray b/src/hackerrank/medium/Aravind_day1_medium_SparseArray
new file mode 100644
index 0000000..41eb50a
--- /dev/null
+++ b/src/hackerrank/medium/Aravind_day1_medium_SparseArray
@@ -0,0 +1,43 @@
+package sparse_arrays;
+
+import java.util.Scanner;
+
+public class Aravind_day1_medium_SparseArray {
+
+	public static void main(String args[]) {
+		String[] strings, q;
+		Scanner sc = new Scanner(System.in);
+		int n = sc.nextInt();
+		strings = new String[n];
+		for(int i=0; i<n; i++) {
+			strings[i] = sc.next();
+		}
+		n = sc.nextInt();
+		q = new String[n];
+		for(int i=0; i<n; i++) {
+			q[i] = sc.next();
+		}
+		//compare arrays
+		sparse(strings, q);
+		sc.close();
+	}
+	
+	public static void sparse(String[] ss, String[] q) {
+		int[] results = new int[q.length];
+		//time complexity O(strings.lengeth * queries.length)
+		//space complexity O(1)
+		//for every queries 
+		for(int i=0; i<results.length; i++) {
+			int c=0;
+			//compare with strings
+			for(int j=0; j<ss.length; j++) {
+				if(q[i].equals(ss[j])) {
+					c++;
+				}
+			}
+			results[i] =c;
+			System.out.println(c);
+		}
+		//return results;
+	}
+}