one file added

Account.java

@@ -0,0 +1,7 @@
+package Balance;
+
+public class Account {
+    public void Display_Balance(){
+        System.out.println("Display_Method is called");
+    }
+}

muskan 2D ARRAY DS CODE.java

@@ -0,0 +1,117 @@
+Given a  2D Array, arr:
+
+1 1 1 0 0 0
+0 1 0 0 0 0
+1 1 1 0 0 0
+0 0 0 0 0 0
+0 0 0 0 0 0
+0 0 0 0 0 0
+An hourglass in A is a subset of values with indices falling in this pattern in 's graphical representation:
+
+a b c
+  d
+e f g
+There are  hourglasses in . An hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every hourglass in , then print the maximum hourglass sum. The array will always be .
+
+Example
+
+
+-9 -9 -9  1 1 1 
+ 0 -9  0  4 3 2
+-9 -9 -9  1 2 3
+ 0  0  8  6 6 0
+ 0  0  0 -2 0 0
+ 0  0  1  2 4 0
+The  hourglass sums are:
+
+-63, -34, -9, 12, 
+-10,   0, 28, 23, 
+-27, -11, -2, 10, 
+  9,  17, 25, 18
+The highest hourglass sum is  from the hourglass beginning at row , column :
+
+0 4 3
+  1
+8 6 6
+Note: If you have already solved the Java domain's Java 2D Array challenge, you may wish to skip this challenge.
+
+Function Description
+
+Complete the function hourglassSum in the editor below.
+
+hourglassSum has the following parameter(s):
+
+int arr[6][6]: an array of integers
+Returns
+
+int: the maximum hourglass sum
+Input Format
+
+Each of the  lines of inputs  contains  space-separated integers .
+
+Constraints
+
+Output Format
+
+Print the largest (maximum) hourglass sum found in .
+
+Sample Input
+
+1 1 1 0 0 0
+0 1 0 0 0 0
+1 1 1 0 0 0
+0 0 2 4 4 0
+0 0 0 2 0 0
+0 0 1 2 4 0
+Sample Output
+
+19
+Explanation
+
+ contains the following hourglasses:
+
+image
+
+The hourglass with the maximum sum () is:
+
+2 4 4
+  2
+1 2 4
+
+
+Solution:
+
+import java.util.Scanner;
+
+
+public class Intro2dArray {
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+        int multiDimArr[][] = new int[6][6];
+        for(int row = 0; row < 6; row++){
+            for(int col = 0; col < 6;col++){
+                multiDimArr[row][col] = sc.nextInt();
+            }
+        }
+        System.out.println(Solve(multiDimArr));
+    }
+    static int Solve(int arr[][]){
+        int max = Integer.MIN_VALUE;
+        int total = 0;
+        for(int row = 0; row < 4; row++){
+
+            for(int col = 0; col < 4; col++ ){
+
+                total = arr[row][col] + arr[row][col+1] + arr[row][col+2];
+                total += arr[row+1][col+1];
+                total += arr[row+2][col] + arr[row+2][col+1] + arr[row+2][col+2];
+                max = total>max?total:max;
+            }
+        }
+        return max;
+
+    }
+
+}