Array Programs

sathishmepco · sathishmepco · commit e0301e05874f · 2020-08-07T19:29:26.000+05:30
diff --git a/InterviewPrograms/src/com/java/array/ArrayRotation.java b/InterviewPrograms/src/com/java/array/ArrayRotation.java
@@ -4,7 +4,7 @@
 
 /*
  * Rotate the Given array d times
- * 
+ * -------------------------------
  * Write java program to rotate (clockwise) the given array
  * d number of times.
  * 
diff --git a/InterviewPrograms/src/com/java/array/Average.java b/InterviewPrograms/src/com/java/array/Average.java
@@ -1,8 +1,9 @@
 package com.java.array;
 
 /*
- *	Calculate the Average of Given Array
- *
+ * Calculate the Average of Given Array
+ * -------------------------------------
+ * 
  * This is one basic program using array.
  * Steps
  * 1. Declare a variable sum with 0
diff --git a/InterviewPrograms/src/com/java/array/FindAllDuplicates.java b/InterviewPrograms/src/com/java/array/FindAllDuplicates.java
@@ -4,7 +4,7 @@
 
 /*
  * Find All duplicate elements
- * 
+ * ---------------------------
  * Write java program to find all the duplicates
  * elements from the given array.
  *
diff --git a/InterviewPrograms/src/com/java/array/FindMissingNo.java b/InterviewPrograms/src/com/java/array/FindMissingNo.java
@@ -1,7 +1,7 @@
 package com.java.array;
 /*
- *	Find the Missing Number in 1 to N
- *
+ * Find the Missing Number in 1 to N
+ * ----------------------------------
  * An array contains 1 to N numbers 
  * but one number in the array is missing
  * Write the java program to find the missing no
@@ -25,6 +25,7 @@
  *  missing no = 45 - 37
  * 
  * Note::
+ * ------
  * This approach will work only for array contains
  * value from 1 to n (order does not matter)
  */
@@ -40,7 +41,7 @@ public static void main(String[] args) {
 			arraySum += v;
 
 		//array length is 8
-		//one no is missing, then n should by n+1
+		//one no is missing, then n should be n+1
 		// here 8+1
 		n = n+1;
 		
diff --git a/InterviewPrograms/src/com/java/array/FindMostFrequent.java b/InterviewPrograms/src/com/java/array/FindMostFrequent.java
@@ -2,6 +2,7 @@
 
 /*
  * Find the Most Frequent Element in an Array
+ * -------------------------------------------
  * Using Brute Force Approach
  * 
  * For the each element, scan the entire array 
diff --git a/InterviewPrograms/src/com/java/array/FindMostFrequentUsingHashtable.java b/InterviewPrograms/src/com/java/array/FindMostFrequentUsingHashtable.java
@@ -4,7 +4,7 @@
 
 /*
  * Find the Most Frequent Element in an Array
- * 
+ * ------------------------------------------
  * Using Hash Table
  * 
  * We can create a hash table and store elements and 
diff --git a/InterviewPrograms/src/com/java/array/FindMostFrequentUsingSorting.java b/InterviewPrograms/src/com/java/array/FindMostFrequentUsingSorting.java
@@ -4,7 +4,7 @@
 
 /*
  * Find the Most Frequent Element in an Array
- * 
+ * ------------------------------------------
  * Using Sorting
  * 
  * Lets sort the given array. 
diff --git a/InterviewPrograms/src/com/java/array/FindPairForZ.java b/InterviewPrograms/src/com/java/array/FindPairForZ.java
@@ -4,13 +4,15 @@
 
 /*
  * Find the Pair (X,Y) whose sum is Z
+ * -----------------------------------
  * 
  * say the given array is {2,45,7,3,5,1,8,9} 
  * and Z = 10
  * Find the pairs (x,y) whose sum is 10
  * (2,8), (1,9), (3,7) are the pairs
  * 
  * Solution
+ * ---------
  * 1. Sort the given array (ascending order)
  * 2. Declare left pointer (l) which points to
  * left most element of the array (min of array)
diff --git a/InterviewPrograms/src/com/java/array/FindUniqueElt.java b/InterviewPrograms/src/com/java/array/FindUniqueElt.java
@@ -2,6 +2,7 @@
 
 /*
  * Find the only one unique Element in the Array
+ * ---------------------------------------------
  * 
  * In the given array only one element is 
  * occurred one time, all the other elements are
@@ -16,7 +17,7 @@
  *  Write the program to calculate 6
  * 
  * Solution
- * 
+ * --------
  * use ^ (XOR) operator
  * apply ^ (XOR) operator to all the values 
  * in the array.
diff --git a/InterviewPrograms/src/com/java/array/FindingAllSubsets.java b/InterviewPrograms/src/com/java/array/FindingAllSubsets.java
@@ -1,16 +1,16 @@
 package com.java.array;
 
 /*
- *  Find All Possible Subsets of Given Array
+ * Find All Possible Subsets of Given Array
+ * ---------------------------------------- 
+ * say Given array is
+ * {a, b, c, d}
  *  
- *  say Given array is
- *  {a, b, c, d}
- *  
- *  Possible subsets are 
- *	{a} {b} {c} {d}
- *	{a, b} {a, c} {a, d} {b, c} {b, d} {c, d}
- *	{a, b, c} {a, b, d} {a, c, d} {b, c, d}
- *	{a, b, c, d}
+ * Possible subsets are 
+ * {a} {b} {c} {d}
+ * {a, b} {a, c} {a, d} {b, c} {b, d} {c, d}
+ * {a, b, c} {a, b, d} {a, c, d} {b, c, d}
+ * {a, b, c, d}
  *   
  */
 public class FindingAllSubsets {
diff --git a/InterviewPrograms/src/com/java/array/IntersectionOfSortedArrays.java b/InterviewPrograms/src/com/java/array/IntersectionOfSortedArrays.java
@@ -1,7 +1,8 @@
 package com.java.array;
 
 /*
- * 	Intersection of two Sorted Arrays
+ * Intersection of two Sorted Arrays
+ * ----------------------------------
  * 
  * Assume that both the given arrays are 
  * sorted arrays.
@@ -59,7 +60,6 @@ public static void main(String[] args) {
 }
 /*
 	OUTPUT
-	
 	Given array 1 is : 
 	1 2 3 4 5 6 
 	Given array 2 is : 
diff --git a/InterviewPrograms/src/com/java/array/IntersectionOfTwoArrays.java b/InterviewPrograms/src/com/java/array/IntersectionOfTwoArrays.java
@@ -1,10 +1,8 @@
 package com.java.array;
 
 /*
- * 	Find Intersection of Two Arrays
- * 
- * Write a Java Program to find the intersection of 
- * Two Arrays
+ * Find Intersection of Two Arrays
+ * --------------------------------
  * 
  * INTERSECTION
  * Common element in both arrays.
diff --git a/InterviewPrograms/src/com/java/array/MoveAllZerosToEnd.java b/InterviewPrograms/src/com/java/array/MoveAllZerosToEnd.java
@@ -2,7 +2,7 @@
 
 /*
  * Move All the Zeros to end of the Array
- * 
+ * ---------------------------------------
  * Assume the given array contains some zero
  * in some index positions.
  * 
diff --git a/InterviewPrograms/src/com/java/array/MoveAllZerosToFront.java b/InterviewPrograms/src/com/java/array/MoveAllZerosToFront.java
@@ -2,7 +2,7 @@
 
 /*
  * Move All the Zeros to Start of the Array
- * 
+ * -----------------------------------------
  * Assume the given array contains some zero
  * in some index positions.
  * 
diff --git a/InterviewPrograms/src/com/java/array/ReverseArray.java b/InterviewPrograms/src/com/java/array/ReverseArray.java
@@ -1,7 +1,8 @@
 package com.java.array;
 
 /*
- * 	Reverse the Array without using additional Array
+ * Reverse the Array without using additional Array
+ * ------------------------------------------------
  * 
  * given array[]= {1,2,3,4,5,6,7,8,9,10};
  * reversed array[]= {10,9,8,7,6,5,4,3,2,1};
@@ -22,7 +23,6 @@
 
 public class ReverseArray {
 	public static void main(String[] args) {
-		
 		int array[]= {1,2,3,4,5,6,7,8,9,10};
 		int N = array.length;
 		int temp;
diff --git a/InterviewPrograms/src/com/java/array/SecondMaximum.java b/InterviewPrograms/src/com/java/array/SecondMaximum.java
@@ -4,7 +4,7 @@
 
 /*
  * Find the Second Maximum in the Given Array
- * 
+ * ------------------------------------------
  * array {10,32,34,54,19,29,38,45}
  * max is 54, second max is 45
  * 
@@ -27,9 +27,7 @@
  * then update only 2nd max value with ith value
  */
 public class SecondMaximum {
-	
 	public static void main(String[] args) {
-		
 		int array[] = {10,32,34,54,19,29,38,45};
 		
 		//assume 0th index value is maximum
@@ -67,7 +65,6 @@ public static void main(String[] args) {
 
 /*
 	OUTPUT
-	
 	Given array is : 
 	[10, 32, 34, 54, 19, 29, 38, 45]
 	Max value in the array is : 54
diff --git a/InterviewPrograms/src/com/java/array/SecondMinimum.java b/InterviewPrograms/src/com/java/array/SecondMinimum.java
@@ -4,6 +4,7 @@
 
 /*
 * Find the Second Minimum in the Given Array
+* -------------------------------------------
 * 
 * array {10,32,34,54,19,29,38,45}
 * minimum is 10, second minimum is 19
@@ -28,7 +29,6 @@
 */
 public class SecondMinimum {
 	public static void main(String[] args) {
-		
 		int array[] = {10,32,34,54,19,29,38,45};
 	
 		// assume 0th index value is minimum
@@ -65,12 +65,9 @@ public static void main(String[] args) {
 	}
 }
 /*
-
 	OUTPUT
-
 	Given array is : 
 	[10, 32, 34, 54, 19, 29, 38, 45]
 	Minimum value in the array is : 10
 	Second minimum value in the array is : 19
-  
 */
diff --git a/InterviewPrograms/src/com/java/array/UnionArrayUsingHashSet.java b/InterviewPrograms/src/com/java/array/UnionArrayUsingHashSet.java
@@ -4,8 +4,8 @@
 import java.util.HashSet;
 
 /*
- * 	Union Of Two Arrays using HashSet
- * 
+ * Union Of Two Arrays using HashSet
+ * ---------------------------------
  * The Union of Two Arrays Array1, Array2 is the 
  * new array which contains all the elements which are
  * either in array1 or in array2, or in both arrays.
@@ -58,7 +58,6 @@ public static void main(String[] args) {
 }
 /*
 	OUTPUT
-	
 	Given Array 1 is : 
 	17 23 31 14 25 26 
 	Given Array 2 is : 
diff --git a/InterviewPrograms/src/com/java/array/UnionOfSortedArrays.java b/InterviewPrograms/src/com/java/array/UnionOfSortedArrays.java
@@ -4,8 +4,8 @@
 import java.util.ArrayList;
 
 /*
- * 	Union Of Two Sorted Arrays
- * 
+ * Union Of Two Sorted Arrays
+ * --------------------------
  * The Union of Two Arrays Array1, Array2 is the 
  * new array which contains all the elements which are
  * either in array1 or in array2, or in both arrays.
diff --git a/InterviewPrograms/src/com/java/array/UnionOfTwoArrays.java b/InterviewPrograms/src/com/java/array/UnionOfTwoArrays.java
@@ -1,8 +1,8 @@
 package com.java.array;
 
 /*
- * 	Union Of Two Arrays
- *
+ * Union Of Two Arrays
+ * -------------------
  * The Union of Two Arrays Array1, Array2 is the 
  * new array which contains all the elements which are
  * either in array1 or in array2, or in both arrays.
@@ -21,7 +21,6 @@
  * 
  * UnionArray = {17, 23, 31, 14, 25, 26, 44, 8};
  * 
- * 
  */
 public class UnionOfTwoArrays {
 	public static void main(String[] args) {

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`
`5`	`5`	`/*`
`6`	`6`	`* Rotate the Given array d times`
`7`		`- *`
	`7`	`+ * -------------------------------`
`8`	`8`	`* Write java program to rotate (clockwise) the given array`
`9`	`9`	`* d number of times.`
`10`	`10`	`*`
Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`
`5`	`5`	`/*`
`6`	`6`	`* Find All duplicate elements`
`7`		`- *`
	`7`	`+ * ---------------------------`
`8`	`8`	`* Write java program to find all the duplicates`
`9`	`9`	`* elements from the given array.`
`10`	`10`	`*`
Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,7 @@`
`2`	`2`
`3`	`3`	`/*`
`4`	`4`	`* Find the Most Frequent Element in an Array`
	`5`	`+ * -------------------------------------------`
`5`	`6`	`* Using Brute Force Approach`
`6`	`7`	`*`
`7`	`8`	`* For the each element, scan the entire array`
Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`
`3`	`3`	`/*`
`4`	`4`	`* Move All the Zeros to end of the Array`
`5`		`- *`
	`5`	`+ * ---------------------------------------`
`6`	`6`	`* Assume the given array contains some zero`
`7`	`7`	`* in some index positions.`
`8`	`8`	`*`
Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`
`3`	`3`	`/*`
`4`	`4`	`* Move All the Zeros to Start of the Array`
`5`		`- *`
	`5`	`+ * -----------------------------------------`
`6`	`6`	`* Assume the given array contains some zero`
`7`	`7`	`* in some index positions.`
`8`	`8`	`*`