Merge pull request #331 from ash-sxn/main

Fixed inconsistent class naming of java code (to CamelCase)

Author: gantavyamalviya

Java/.idea/.gitignore

@@ -37,7 +37,7 @@
 package Array;
 import java.util.Scanner;
 
-public class Arrange_Number_In_Array {
+public class ArrangeNumberInArray {
     public static void printArray(int[] arr1) {
         int n = arr1.length;
         for (int i = 0; i < n; i++) {

Java/Array/Arrange_Number_In_Array.java renamed to Java/Array/ArrangeNumberInArray.java

@@ -59,7 +59,7 @@
 
 package Array;
 import java.util.Scanner;
-public class Array_Intersection {
+public class ArrayIntersection {
 
     public static int[] takingInput1() {
         Scanner sc = new Scanner(System.in);

Java/Array/Array_Intersection.java renamed to Java/Array/ArrayIntersection.java

@@ -33,7 +33,7 @@
 package Array;
 import java.util.Scanner;
 
-public class Array_Sum {
+public class ArraySum {
 
     public static int arraySum(int[] arr) {
         int n = arr.length;

Java/Array/Array_Sum.java renamed to Java/Array/ArraySum.java

@@ -8,7 +8,7 @@
 */
 
 
-public class equalSide {
+public class EqualSide {
   public static int findEvenIndex(int[] arr) {
     // your code
     int sum = 0, eq = 0;

Java/Array/equalSide.java renamed to Java/Array/EqualSide.java

@@ -39,7 +39,7 @@
 package Array;
 import java.util.Scanner;
 
-public class Find_Duplicate {
+public class FindDuplicate {
 
     public static int duplicateElement(int[] arr) {
         int n = arr.length;

Java/Array/Find_Duplicate.java renamed to Java/Array/FindDuplicate.java

@@ -38,7 +38,7 @@
 
 package Array;
 import java.util.Scanner;
-public class insertionSort {
+public class InsertionSort {
 
 
     public static int[] takeInput() {

Java/Array/insertionSort.java renamed to Java/Array/InsertionSort.java

@@ -3,7 +3,7 @@
 
 package Two_Dimensional_Array;
 import java.util.Scanner;
-public class Largest_col_sum {
+public class LargestColSum {
     public static int largestcolsum(int [] [] arr2) {
         int rows = arr2.length;
         int cols = arr2[0].length;

Java/Array/Kadane_Algorithm.java renamed to Java/Array/KadaneAlgorithm.java

@@ -53,7 +53,7 @@
 
 package Two_Dimensional_Array;
 import java.util.Scanner;
-public class Largest_Row_Column {
+public class LargestRowColumn {
     public static void largestRowColumn(int [] [] arr2) {
 
         int cols = arr2[0].length;