From 6d0e3f810b86ba95ed6a76881ce9d6d508ca5238 Mon Sep 17 00:00:00 2001
From: Your Name <you@example.com>
Date: Fri, 4 Oct 2019 20:56:39 +0530
Subject: [PATCH 1/2] Add hackerrank problem to Contributors list

---
 Hackerrank/Main.java | 34 ++++++++++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 Hackerrank/Main.java

diff --git a/Hackerrank/Main.java b/Hackerrank/Main.java
new file mode 100644
index 0000000..ed744b8
--- /dev/null
+++ b/Hackerrank/Main.java
@@ -0,0 +1,34 @@
+//to find the maximum occurring character
+import java.util.*;
+public class Main {
+ static final int N = 256;
+ public static void main(String args[]){
+  Scanner x=new Scanner(System.in);
+   int n=x.nextInt();
+   x.nextLine();
+  
+  String str[]=new String[100];
+   for(int i=0;i<n;i++)
+   str[i]=x.nextLine();
+   for(int k=0;k<n;k++)
+   {  int ctr[] = new int[N];
+      String str1=str[k];
+  int l = str1.length();
+  for (int i = 0; i < l; i++)
+   ctr[str1.charAt(i)]++;
+  int max = -1;
+  char result = ' ';
+
+  for (int i = 0; i < l; i++) {
+   if (max < ctr[str1.charAt(i)]) {
+    max = ctr[str1.charAt(i)];
+    result = str1.charAt(i);
+   }
+  }
+
+  System.out.println( result);
+  
+ }
+ 
+ 
+}}

From 79674da0edcdd0cbc76a8b4c44311ac1030fd48d Mon Sep 17 00:00:00 2001
From: Your Name <you@example.com>
Date: Fri, 4 Oct 2019 21:05:11 +0530
Subject: [PATCH 2/2] Add hackerrank problem on 2d array to Contributors list

---
 Hackerrank/Array2D.java | 46 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 46 insertions(+)
 create mode 100644 Hackerrank/Array2D.java

diff --git a/Hackerrank/Array2D.java b/Hackerrank/Array2D.java
new file mode 100644
index 0000000..9354d0e
--- /dev/null
+++ b/Hackerrank/Array2D.java
@@ -0,0 +1,46 @@
+ import java.io.*;
+import java.math.*;
+import java.security.*;
+import java.text.*;
+import java.util.*;
+import java.util.concurrent.*;
+import java.util.regex.*;
+//HOUR GLASS PROBLEM
+public class Array2D {
+   static int r=6;
+   static int c=6;
+   public static int sumat(int arr[][])
+   {     if (r < 4 || c < 4) 
+        return -1; 
+      
+        int max=Integer.MIN_VALUE,sum=0;
+        for (int i = 0; i < r-2; i++) {
+            for(int j=0;j<c-2;j++)
+            {
+              sum=(arr[i][j]+arr[i][j+1]+arr[i][j+2])+(arr[i+1][j+1])+(arr[i+2][j]
+              +arr[i+2][j+1]+arr[i+2][j+2]);
+              max = Math.max(max, sum); }}return max;
+   }
+
+   
+    public static void main(String[] args) {
+          Scanner sc = new Scanner(System.in);
+
+        int[][] mat = new int[6][6];
+        for(int i=0;i<6;i++)
+        {
+            for(int j=0;j<6;j++)
+            {
+              
+              mat[i][j]=sc.nextInt();
+            }
+        }
+        int n=sumat(mat);
+        
+              
+            
+    
+    if(n!=-1)
+    System.out.println(n);}
+}
+