Magicpin Coding Questions and Answers

#include<stdio.h>

int main() {
	int arr[100];
	int length, i, j, oddlen, evenlen, temp;
	int odd[50], even[50];
	printf("Enter the length of the array: ");
	scanf("%d", &length);

	for (i = 0; i < length; i++) {
    	printf("Enter element at index %d: ", i);
    	scanf("%d", &arr[i]);
	}

	if (length % 2 == 0) {
    	oddlen = length / 2;
    	evenlen = length / 2;
	} else {
    	oddlen = length / 2;
    	evenlen = (length / 2) + 1;
	}

	for (i = 0; i < length; i++) {
    	if (i % 2 == 0) {
        	even[i / 2] = arr[i];
    	} else {
        	odd[i / 2] = arr[i];
    	}
	}

	for (i = 0; i < evenlen - 1; i++) {
    	for (j = i + 1; j < evenlen; j++) { if (even[i] > even[j]) {
            	temp = even[i];
            	even[i] = even[j];
            	even[j] = temp;
        	}
    	}
	}

	for (i = 0; i < oddlen - 1; i++) {
    	for (j = i + 1; j < oddlen; j++) { if (odd[i] > odd[j]) {
            	temp = odd[i];
            	odd[i] = odd[j];
            	odd[j] = temp;
        	}
    	}
	}

	printf("\nSorted even array: ");
	for (i = 0; i < evenlen; i++) {
    	printf("%d ", even[i]);
	}
	printf("\n");

	printf("Sorted odd array: ");
	for (i = 0; i < oddlen; i++) {
    	printf("%d ", odd[i]);
	}
	printf("\n");

	printf("%d", even[evenlen - 2] + odd[oddlen - 2]);
    
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main ()
{
  int arr[100];
  int length, i, j, oddlen, evenlen, temp, c, d;
  int odd[50], even[50];
  cout << "enter the length of array : "; cin >> length;
  for (i = 0; i < length; i++)
    {
      cout << "Enter element at " << i << " index : "; cin >> arr[i];
    }
  if (length % 2 == 0)
    {
      oddlen = length / 2;
      evenlen = length / 2;
    }
  else
    {
      oddlen = length / 2;
      evenlen = (length / 2) + 1;
    }
  for (i = 0; i < length; i++)	// seperation of even and odd array
    {
      if (i % 2 == 0)
	{
	  even[i / 2] = arr[i];
	}
      else
	{
	  odd[i / 2] = arr[i];
	}
    }
  for (i = 0; i < evenlen - 1; i++)	// sorting of even array 
    {
      for (j = i + 1; j < evenlen; j++) { temp = 0; if (even[i] > even[j])
	    {
	      temp = even[i];
	      even[i] = even[j];
	      even[j] = temp;
	    }
	}
    }
  for (i = 0; i < oddlen - 1; i++)	// sorting of odd array 
    {
      for (j = i + 1; j < oddlen; j++) { temp = 0; if (odd[i] > odd[j])
	    {
	      temp = odd[i];
	      odd[i] = odd[j];
	      odd[j] = temp;
	    }
	}
    }
  cout << "\nSorted even array : ";	// printing even array
  for (i = 0; i < evenlen; i++)
    {
      cout << even[i] << " ";
    }
  cout << "\n";
  cout << "Sorted odd array : ";	// printing odd array 
  for (i = 0; i < oddlen; i++)
    {
      cout << odd[i] << " ";
    }
  cout << endl;
  cout << even[evenlen - 2] + odd[oddlen - 2];	// printing final result 
}

import java.util.Scanner;
import java.util.ArrayList;
import java.util.Collections;
public class Main
{
  public static void main (String[]args)
  {
    Scanner sc = new Scanner (System.in);
      System.out.print ("Enter size of array : ");
    int arrsize = sc.nextInt ();
    int[] main = new int[arrsize];
      ArrayList < Integer > even = new < Integer > ArrayList ();
      ArrayList < Integer > odd = new < Integer > ArrayList ();
      System.out.println ("Enter " + arrsize + " Elements");
    for (int i = 0; i < arrsize; i++)
        main[i] = sc.nextInt ();
    for (int i = 0; i < arrsize; i++)
      {
	if (i % 2 == 0)
	  even.add (main[i]);
	else
	  odd.add (main[i]);
      }
    Collections.sort (even);
    Collections.sort (odd);
    System.out.println ("Sorted even array ");
  for (int e:even)
      System.out.print (e + " ");
    System.out.println ();
    System.out.println ("sorted odd array ");
  for (int e:odd)
      System.out.print (e + " ");
    System.out.println ();
    int evensec = even.get (even.size () - 2);
    int oddsec = odd.get (odd.size () - 2);
    System.out.println ("Second Largest Element in Even List is:" + evensec);
    System.out.println ("Second Largest Element in Odd List is:" + oddsec);
    System.
      out.println ("Sum Of Second Largest Element Of Odd and Even List:" +
		   (evensec + oddsec));
  }
}

array = []
evenArr = []
oddArr = []
n = int(input("Enter the size of the array:"))
for i in range(0,n):
    number = int(input("Enter Element at {} index:".format(i)))
    array.append(number)
    if i % 2 == 0:
        evenArr.append(array[i])
    else:
        oddArr.append(array[i])
evenArr = sorted(evenArr)
print("Sorted Even Array:", evenArr[0:len(evenArr)])
oddArr = sorted(oddArr)
print("Sorted Odd Array:", oddArr[0:len(oddArr)])
print(evenArr[1] + oddArr[1])
evenArr = sorted(evenArr)
print("Sorted Even Array:", evenArr[0:len(evenArr)])
oddArr = sorted(oddArr)
print("Sorted Odd Array:", oddArr[0:len(oddArr)])
print(evenArr[-2] + oddArr[-2])