DivBytes

  The input specifies there is 1 test case. For the first test case, the size of the array is 6. The array elements are 5 6 1 2 3 4. We use the arrayRotateCheck function to find the rotation index. Iteration 1: 5 > 6 (not true) Iteration 2: 6 > 1 (true) The current index (i) is 1, and i + 1 is 2. So, the rotation index is 2. The function returns 2. The output for the test case is 2. public   class   Solution   {      public   static   int   arrayRotateCheck ( int []   arr ){          for ( int   i   =   0   ;   i   <   arr . length - 1 ; i ++){              if ( arr [ i ]   >   arr [ i + 1 ]){                  return   i + 1 ;           ...

 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 intersectionTwoArray { public static void intersectionTwoArray ( int [] arr1 , int [] arr2 , int size ) { for ( int i = 0 ; i < size ; i ++ ) { for ( int j = 0 ; j < size ; j ++ ) { if ( arr1 [ i ] == arr2 [ j ]) { System . out . println ( arr2 [ j ]) ; } } } } public static void main ( String [] args ) { // TODO Auto-generated method stub Scanner scan = new Scanner ( System . in ) ; int size = scan . nextInt () ; int [] arr1 = new int [ size ] ; for ( int i = 0 ; i < size ; i ++ ) { arr1 [ i ] = scan . nextInt () ; } int [] arr2 = new int [ size ] ; for ( int j = 0 ; j < size ; j ++ ) { arr2 [ j ] = scan . nextInt () ; } ///if u want to call in void intersectionTwoArray ( arr1 ...

  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 } }