Added Some Problem Solution on Array in Java

BarChart.java

@@ -0,0 +1,43 @@
+import java.util.Scanner;
+
+public class BarChart {
+
+	public static void main(String[] args) {
+
+		Scanner scn = new Scanner(System.in);
+
+		int tc = scn.nextInt();
+
+		int arr[] = new int[tc];
+
+
+		int max = Integer.MIN_VALUE;
+		for (int i = 0; i < arr.length; i++) {
+			arr[i] = scn.nextInt();
+			 if(arr[i]>max)
+			 {
+				 max = arr[i];
+			 }
+		}	
+
+		for(int floor = max ; floor>=1 ; floor--)
+		{
+			for(int i = 0 ; i<arr.length ; i++)
+			{
+
+				if(arr[i]>=floor)
+				{
+					System.out.print("*\t");
+				}
+				else
+				{
+					System.out.print("\t");
+				}
+
+			}
+			System.out.println();
+		}
+
+	}
+
+}

BinarySearch.java

@@ -0,0 +1,69 @@
+import java.util.Scanner;
+
+public class BinarySearch {
+
+public static int binarySearch(int[] a,int k){
+
+	int low = 0;
+	int high = a.length-1;
+
+
+
+	int ans = -1;
+
+	while(low <= high)
+	{
+
+		int mid = (low+high)/2;
+		if(k<a[mid])
+		{
+			high = mid -1;
+		}
+		else if(k>a[mid])
+		{
+			low = mid + 1;
+		}
+		else
+		{
+			ans = mid;
+			return ans;
+		}
+
+	}
+	return ans;
+
+	  }
+
+	private static void Display(int arr[])
+	{
+		for (int val : arr) {
+
+			System.out.println(val);
+
+		}	
+	}
+
+public static void main(String[] args) {
+
+
+		Scanner scn = new Scanner(System.in);
+
+		int tc = scn.nextInt();
+
+		int arr[] = new int[tc];
+
+		for (int i = 0; i < arr.length; i++) {
+
+			arr[i] = scn.nextInt();
+
+		}	
+
+
+		int k = scn.nextInt();
+
+		int ans = binarySearch(arr,k);
+		System.out.println(ans);
+
+	}
+
+}

DifferenceOfTwoArray.java

@@ -0,0 +1,99 @@
+import java.util.Scanner;
+
+public class DifferenceOfTwoArray {
+
+	private static void Display(int arr[])
+	{
+		for (int val : arr) {
+
+			System.out.println(val);
+
+		}	
+	}
+
+	public static void main(String[] args) {
+
+		Scanner scn = new Scanner(System.in);
+
+		int tcOne = scn.nextInt();
+
+		int arrOne[] = new int[tcOne];
+
+		for (int i = 0; i < arrOne.length; i++) {
+
+			arrOne[i] = scn.nextInt();
+
+		}	
+
+		int tcTwo = scn.nextInt();
+
+		int arrTwo[] = new int[tcTwo];
+
+		for (int i = 0; i < arrTwo.length; i++) {
+
+			arrTwo[i] = scn.nextInt();
+
+		}	
+
+
+
+
+		int arrDiff[] = new int[tcTwo ];
+
+		int i = arrOne.length - 1;
+		int j = arrTwo.length - 1;
+		int k = arrDiff.length - 1;
+
+
+		int c = 0;
+
+		while(k >= 0)
+		{
+
+
+		   int d = c;
+
+		   int a1v = i >= 0? arrOne[i]:0;
+
+		   if( arrTwo[j]+c>=a1v)
+		   {
+		       d = arrTwo[j]+c - a1v;
+		       c = 0;
+		   }
+		   else
+		   {
+		       d = arrTwo[j]+ c + 10 - a1v;
+		       c= -1;
+		   }
+
+			    	arrDiff[k] = d;
+
+			    	i--;
+			    	j--;
+			    	k--;
+			    }
+
+
+		int idx = 0;
+		while(idx < arrDiff.length)
+		{
+			if(arrDiff[idx] == 0)
+			{
+				idx++;
+			}
+			else
+			{
+				break;
+			}
+		}
+
+		while(idx < arrDiff.length)
+		{
+			System.out.println(arrDiff[idx]);
+			idx++;
+		}
+
+//		Display(arrDiff);
+	}
+
+}

ExitPointOfMatrix.java

@@ -0,0 +1,89 @@
+import java.util.Scanner;
+
+public class ExitPointOfMatrix {
+
+	public static void Display(int [][] a)
+	{
+		for (int i = 0; i < a.length; i++) {
+			for (int j = 0; j < a[0].length; j++) {
+
+				System.out.print(a[i][j]+" "); 
+
+			}
+			System.out.println();
+		}
+	}
+
+	public static void main(String[] args) {
+
+		Scanner scn = new Scanner(System.in);
+
+		int row = scn.nextInt();
+		int coloumn = scn.nextInt();
+
+		int [][] matrix = new int[row][coloumn]; 
+
+		for (int i = 0; i < matrix.length; i++) {
+			for (int j = 0; j < matrix[0].length; j++) {
+
+				matrix[i][j] = scn.nextInt(); 
+
+			}
+		}
+
+//		Display(matrix);
+
+		int i = 0 , j = 0 , dir = 0;
+
+
+		while(true)
+		{
+
+			dir = (dir + matrix[i][j]) % 4;
+
+			if(dir == 0)
+			{
+				j++;
+			}
+			else if(dir == 1)
+			{
+				i++;
+			}
+			else if(dir == 2)
+			{
+				j--;
+			}
+			else if(dir == 3)
+			{
+				i--;
+			}
+
+			if(i < 0)
+			{
+				i++;
+				break;
+			}
+			else if(j < 0)
+			{
+				j++;
+				break;
+			}
+			else if(i == matrix.length)
+			{
+				i--;
+				break;
+			}
+			else if(j == matrix[0].length)
+			{
+				j--;
+				break;
+			}
+
+		}
+
+		System.out.println(i);
+		System.out.println(j);
+
+	}
+
+}

FindElementInArray.java

@@ -0,0 +1,36 @@
+import java.util.Scanner;
+public class FindElementInArray {
+
+	public static void main(String[] args) {
+
+		Scanner scn = new Scanner(System.in);
+
+		int tc = scn.nextInt();
+
+		int arr[] = new int[tc];
+
+
+
+		for (int i = 0; i < arr.length; i++) {
+			arr[i] = scn.nextInt();
+		}
+
+		int d = scn.nextInt();
+
+		int ans = -1;
+
+		for (int i = 0; i < arr.length; i++) {
+			if(arr[i]==d)
+			{
+				ans = i;
+				break;
+			}
+
+		}
+
+		System.out.println(ans);
+
+
+	}
+
+}