arr pr

Manoj18121812 · Manoj18121812 · commit 2c32824ff7f3 · 2025-09-14T09:18:42.000+05:30
diff --git a/Tcs.practic.array/MedianOfArray.java b/Tcs.practic.array/MedianOfArray.java
@@ -0,0 +1,32 @@
+package tcs.practice.array;
+
+import java.util.Arrays;
+
+public class MedianOfArray {
+
+	public static void main(String[] args) {
+		int arr[] = {2,3,5,6,9,4,1,58,35};
+		
+		medianofarray(arr);
+
+	}
+
+	private static void medianofarray(int[] arr) {
+		
+		Arrays.sort(arr);
+		int n=arr.length;
+		if(n%2==0) {
+			int ind1 = (n / 2) - 1;
+			int ind2 = (n / 2);
+			double median =(arr[ind1] + arr[ind2]) / 2;
+			System.out.println("Median is :"+median);
+		}
+		else
+		{
+			System.out.print("Median is :" + arr[(n / 2)]);
+		}
+	}
+		
+	}
+
+
diff --git a/Tcs.practic.array/MergeArrayAndfindMedian.java b/Tcs.practic.array/MergeArrayAndfindMedian.java
@@ -0,0 +1,39 @@
+package tcs.practice.array;
+
+import java.util.Arrays;
+
+public class MergeArrayAndfindMedian {
+
+	public static void main(String[] args) {
+		
+		int arr[] = {1,2};
+		int arr1[]= {3,4};
+		
+		double result =findmedian(arr,arr1);
+		System.out.println(result);
+
+	}
+
+	private static double findmedian(int[] arr, int[] arr1) {
+		
+		int merged[] = new int[arr.length+arr1.length];
+		int i=0;
+		for(int num:arr) {
+			merged[i++]=num;
+		}
+		
+		for(int num:arr1) {
+			merged[i++]=num;
+		}
+		Arrays.sort(merged);
+		int n=merged.length;
+		
+		if(n%2==1) {
+			return merged[n/2];
+		}
+		else {
+			return (merged[n/2-1]+merged[n / 2] )/ 2.0;
+		}
+	}
+
+}
diff --git a/Tcs.practic.array/NonRepeatingElementInArray.java b/Tcs.practic.array/NonRepeatingElementInArray.java
@@ -0,0 +1,38 @@
+package tcs.practice.array;
+
+import java.util.*;
+import java.util.HashMap;
+import java.util.List;
+
+public class NonRepeatingElementInArray {
+
+	public static void main(String[] args) {
+	
+		int arr[] = {1,2,-1,1,3,1};
+		
+		nonreapeatingelement(arr);
+
+	}
+
+	private static void nonreapeatingelement(int[] arr) {
+		
+		HashMap<Integer,Integer> map = new HashMap<>();
+		
+		for(int num: arr) {
+			map.put(num, map.getOrDefault(num, 0)+1);
+		}
+		
+		List<Integer>list= new LinkedList<>();
+		
+		for(int num:arr) {
+			if(map.get(num)==1) {
+				list.add(num);
+			}}
+		
+		System.out.println(list);
+		for (int num : arr) {
+            if (map.get(num) == 1) {
+                System.out.print(num + " ");
+            }
+}
+}}
