Skip to main content

Problem Statement 2

After Sorting odd and even indexed position element of the Array separately. Find the Sum of 2nd smallest element from both arrays.

Take the size of the array as input from the user.
Input array elements 

Ex:-   int[ ] arr = { 2, 4, 9, 0, 3, 5, 7, 1 };
            
          oddindexedarray = { 2, 9, 3, 7 }       evenindexedarray = { 4, 0, 5, 1 }
        
After sorting :- 
          
         oddindexedarray = { 2, 3, 7, 9 }        evenindexedarray = { 0, 1, 4, 5 }

        hence, answer should be  3 + 1 = 4

Note:- Array size should be not less than 4.

Java

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
 import java.util.Scanner;
 public class DivideArray{
     public static void main(String []args){
        Scanner sc = new Scanner(System.in);
        int size = sc.nextInt();
        int[] arr = new int[size];
        for(int i=0; i<size; i++)
            arr[i] = sc.nextInt();
        int ans = find2nd(arr, 0) + find2nd(arr, 1);
        System.out.println(ans);
     }
     public static int find2nd(int[] arr, int n){
         int min = Integer.MAX_VALUE;
         int sec_min = Integer.MAX_VALUE;
         for(int i=n; i<arr.length; i=i+2){
             if(arr[i]<min){
                 sec_min = min;
                 min = arr[i];
             }
             else if(arr[i]<sec_min && arr[i]!=min)
                sec_min = arr[i];
         }
         return sec_min;
     }
 }

Python

size = int(input("Enter size:"))
arr = []
for i in range(0,size):
    arr.append(int(input()))
even, odd = [], []
for i in range(0,size):
    if i%2==0:
        even.append(arr[i])
    else:
        odd.append(arr[i])
even.sort()
odd.sort()
print(even[1]+odd[1])


Popular posts from this blog

Check whether a number is Seed of another number

 A number P is said to be the seed of another number Q if multiplying P with its digits equates to Q. Ex:-  123 is seed of 738 as    123 * 1 * 2 * 3 = 738  Java 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 public class Seed{ public static void main (String[] args){ int num1 = 123 , num2 = 738 ; num1 = Math. min (num1,num2); num2 = Math. max (num1,num2); System. out . println (checkSeed(num1, num2)); } public static boolean checkSeed ( int num1, int num2){ int seed = num1; while (num1> 0 ){ seed = seed * (num1% 10 ); num1 = num1 / 10 ; } if (seed==num2) return true ; else return false ; } } Python def checkSeed(num1,num2): seed = num1 while num1 > 0 : seed = seed * (num1 % 10 ) num1 = num1 // 10 if seed == n
Read more

Program to sort the first half of an array in ascending and second half in descending order

Ex:-  [2, 4, 3, 10, 5, 8] [2, 4, 3]  and [10, 5, 8] ====>  [2, 3, 4] ascending                                                              [10, 8, 5] descending [ 2, 3, 4, 10, 8, 5] is the required answer.  Java 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 public class ArraySort{ public static void main (String[] args){ int [] arr = { 2 , 4 , 3 , 10 , 5 , 8 }; //sorting first half in ascending order for ( int i= 0 ; i<(arr. length / 2 ); i++){ for ( int j=i+ 1 ; j<(arr. length / 2 ); j++){ if (arr[i]>arr[j]){ int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; } } } //sorting second half in descending order for ( int i=(arr. length / 2 ); i<arr. length ; i++){ for ( int j=i+ 1 ; j<arr. length ; j++)
Read more

Write a method to move hyphens to the left and characters to the right in a string

 Ex:-     code--heist--   ==>     ----codeheist Note:-  Return null or None if str is empty. Java 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 public static String moveHyphens (String str) { if (str. length ()== 0 ) return null ; else { String result = "" ; for ( int i= 0 ; i<str. length (); i++){ char ch = str. charAt (i); if (ch== '-' ) result = ch + result; else result += ch; } return result; } } Python def moveHyphens (str): if len(str)== 0 : return None else : result = "" for char in str: if char== '-' : result = char + result; else : result += char return result
Read more