DivBytes

 Question:  You have been given an array/list(ARR) of size N. You need to swap every pair of alternate elements in the array/list. You don't need to print or return anything, just change in the input array itself. Ans:  package learningJava ; import java . util .*; public class swapAlternate { public static int [] swapAlternate ( int arr [] , int size , int temp ) { for ( int i = 0 ; i < size - 1 ; i = i + 2 ) { temp = arr [ i ] ; arr [ i ] = arr [ i + 1 ] ; arr [ i + 1 ] = temp ; } return arr ; } //main function start from here public static void main ( String [] args ) { Scanner scan = new Scanner ( System . in ) ; System . out . print ( "Enter Size of Array:" ) ; int size = scan . nextInt () ; int temp = 0 ; System . out . println ( "Enter Array Element:" ) ; int arr [] = new int [ size ] ; for ( int i = 0 ; i < size ; ...

Question:  Given two unsorted arrays of non-negative integers, 'arr1' and 'arr2' of size 'N' and 'M', respectively. Your task is to find the pair of elements (one from each array), such that their absolute (non-negative) difference is the smallest, and return the difference. Example : N = 3, arr1 = [10, 20, 30] M = 2, arr2 = [17, 15]  The smallest difference pair is (20, 17) with an absolute difference of 3. So, the answer is 3.   package learningJava ; public class pairSmallest { public static int pairDifference ( int arr1 [] , int arr2 [] , int min ) { for ( int i = 0 ; i < arr1 . length ; i ++ ) { for ( int j = 0 ; j < arr2 . length ; j ++ ) { //iterate from 0th index to arr2 size int difference = Math . abs ( arr1 [ i ] - arr2 [ j ]) ; //difference between 2 arrays //Math.abs is a function for get absolute value instead negative value if ( difference < min ) ...

Question :  What is Sorting in Java ? Ans: Sorting in Java refers to the process of arranging elements in a specific order, often in ascending (smallest to largest) or descending (largest to smallest) order. Java provides various ways to sort data structures like arrays, collections, and lists.  Question: Why use Sorting ? Ans:  Sorting algorithms are used in computer science and programming for a variety of reasons: 1. **Data Retrieval and Searching**: Sorted data is much easier and faster to search. Algorithms like binary search can be used to find elements in a sorted list efficiently, reducing the time complexity from O(n) to O(log n). 2. **Data Presentation**: Sorted data is often presented to users in a more readable and meaningful way. For example, a sorted list of names or numbers is more user-friendly than an unsorted one. 3. **Data Analysis**: In data analysis and statistics, sorting can help identify trends and patterns more easily. It can simplify tasks like ...

 What is Triplet Sum ? Ans: "Triplet sum" ka matlab hota hai ki aap ek array mein se teeno elements ko select karke unka sum calculate karte hain. Triplet sum ek common programming problem hai, jahan aapko ek array of integers diya hota hai aur aapko teeno aise elements ko dhundna hota hai jo ki ek specific sum ke barabar hain. Yadi hum ek example dekhein, to maan lijiye aapke paas ek array hai: [1, 2, 3, 4, 5, 6] aur aapko triplet sum nikalna hai jiska sum 9 ho. To aapke pasandida triplet sum [2, 3, 4] hoga kyunki 2 + 3 + 4 = 9. Triplet sum problems programming interviews mein bhi aksar puche jate hain aur inhe solve karne ke liye alag-alag algorithms ka istemal hota hai. Aap brute-force approach ka istemal karke, yani teeno nested loops ka istemal karke, ya efficient tarike se bhi triplet sum problems ko solve kar sakte hain. package aRray ; import java . util .*; public class tripletSum { public static void main ( String [] args ) { // TODO Auto-generated m...

  Question: What is pair Sum ? Ans:  "Pair sum" ka matlab hota hai ki aapko ek array mein diye gaye kisi bhi do numbers ka sum nikalna hai. Java mein pair sum nikalne ke liye aap ek array mein se do numbers ko select karke unka sum calculate kar sakte hain. Yeh kaam aksar loops (for loop ya while loop) ka istemal karke kiya jata hai. Ek example ke roop mein, agar aapke paas ek array hai [2, 4, 6, 8, 10] aur aapko 10 ke liye pair sum nikalna hai, to aap is tarah se kar sakte hain: package aRray ; import java . util .*; public class pairSum { public static void main ( String [] args ) { // TODO Auto-generated method stub Scanner scan = new Scanner ( System . in ) ; int size = scan . nextInt () ; int count = 0 ; int targetSum = 10 ; // yaha jo add krke chahiye wo dalenge int [] arr = new int [ size ] ; // array of size for ( int i = 0 ; i < size ; i ++ ) { arr [ i ] = scan . nextInt () ; } ...

  package aRray ; import java . util .*; public class practicalArray { public static int findDuplicate ( int arr [] , int size ) { for ( int i = 0 ; i < size ; i ++ ) { for ( int j = i + 1 ; j < size ; j ++ ) { if ( arr [ i ] == arr [ j ]) { return arr [ i ] ; } } } return - 1 ; } public static void main ( String [] args ) { Scanner scan = new Scanner ( System . in ) ; int size = scan . nextInt () ; int [] arr = new int [ size ] ; for ( int i = 0 ; i < size ; i ++ ) { arr [ i ] = scan . nextInt () ; } int result = findDuplicate ( arr , size ) ; System . out . println ( result ) ; //print process } }

package aRray ; import java . util .*; public class practicalArray { // check gratest number public static int greatestNumber ( int size , int [] arr , int max ) { for ( int i = 0 ; i < size ; i ++ ) { if ( arr [ i ] > max ) { max = arr [ i ] ; } } return max ; } public static void main ( String [] args ) { Scanner scan = new Scanner ( System . in ) ; int size = scan . nextInt () ; int arr [] = new int [ size ] ; int max = 0 ; for ( int i = 0 ; i < size ; i ++ ) { arr [ i ] = scan . nextInt () ; } int result = greatestNumber ( size , arr , max ) ; System . out . println ( result ) ; } }  

package aRray ; import java . util .*; public class newArrangeNumber { public static void main ( String [] args ) { Scanner scan = new Scanner ( System . in ) ; int size = scan . nextInt () ;                     int start = 0 ;                     int end = size - 1 ; int arr [ ] = new int [ size ] ;                     //this is basically index for ( int value = 1 ; start <= end ; value ++ ) { if ( value % 2 == 1 ) { arr [ start ] = value ; start ++; } else { arr [ end ] = value ; end --; } } for ( int i = 0 ; i < size ; i ++ ) { System . out . println ( arr [ i ]) ; } } }