Uncommon Integers - Two Arrays

Uncommon Integers - Two Arrays 

Problem:

The program must accept two integer arrays of sizes M and N as the input. The program must print all the uncommon integer(s) (ascending order) in the given two arrays. If there is no uncommon integer in the given two arrays then the program must print -1 as the output. 

Boundary Condition(s): 

1 <= M, N <= 10000 

Input Format: 

The first line contains the values of M and N separated by a space. The second line contains M integers separated by space(s). The third line contains N integers separated by space(s). 

Output Format: 

The first line contains either all the uncommon integer(s) separated by space(s) or -1. 

Example Input/Output 1: 

Input: 

5 5 

87 5 6 12 91 

5 1 7 87 8 

Output: 

1 6 7 8 12 91 

Explanation: 

The uncommon integers in the first array are 6 12 91 The uncommon integers in the second array are 1 7 8 The uncommon integers from both the arrays are combined and sorted in ascending order. Hence the output is 1 6 7 8 12 91 

Example Input/Output 2: 

Input: 

10 6 

37 79 94 50 92 7 6 23 98 6 

6 7 57 85 55 78 

Output: 

23 37 50 55 57 78 79 85 92 94 98 

Explanation: 

The uncommon integers in the first array are 37 79 94 50 92 23 98 The uncommon integers in the second array are 57 85 55 78 The uncommon integers from both the arrays are combined and sorted in ascending order. Hence the output is 23 37 50 55 57 78 79 85 92 94 98

Program:

import java.util.*;

import java.io.*;

public class Hello {


    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in); 

        int n = sc.nextInt(); 

        int m = sc.nextInt(); 

        TreeSet <Integer> ans = new TreeSet<>();

        TreeSet <Integer> t = new TreeSet<>(); 

        TreeSet <Integer> s = new TreeSet<>(); 

        for(int i=0;i<n;i++)

        {

            t.add(sc.nextInt());

        }

        for(int i=0;i<m;i++)

        {

            s.add(sc.nextInt());

        }

        for(int i : t)

        {

            if(!s.contains(i))

            {

                ans.add(i);

            }

        }

        for(int i : s)

        {

            if(!t.contains(i))

            {

                ans.add(i);

            }

        }

        if(ans.size() > 0)

        {

            for(int i : ans)

            {

                System.out.print(i+ " ");

            }

        }

        else

        {

            System.out.print("-1");

        }

}

}

Comments

Post a Comment

Popular posts from this blog

Pronic Integers in N - InfyTQ question

Pronic Integers in N - InfyTQ question Problem:  The program must accept an integer N as the input. The program must print all the pronic integers formed by a series of continuously occurring digits (in the same order) in N as the output. The pronic integers can be represented as n*(n+1). Input:  93042861 Output: 930 30 0 42 2 6 Program: import math  s = input().strip() def check_pronic(num):      sq = math.floor(math.sqrt(num))      return (sq*(sq+1)) == num  l = []   for i in range(len(s)):      for j in range(i,len(s)):          substr = int(s[i:j+1])          if s[i:j+1] == "0":             l.append(substr)         elif s[i:j+1][0]!='0' and check_pronic(substr):             l.append(substr)  print(*l)             Expl...
Read more

Count Strong Points - Accenture

 Count Strong Points - Accenture Problem: The program must accept an integer matrix of size RxC as the input. The program must print the number of strong points in the given matrix as the output. The strong points are located at the element(s) whose all the surrounding elements are smaller than the given element. Input:  3 3  56 92 45  19 41 51  55 31 80 Output: 3  Program: n,m = map(int,input().split()) l = []  for i in range(n):      l.append(list(map(int,input().split()))) count = 0      for i in range(n):      for j in range(m):         c = 0         if i-1 >= 0 and l[i-1][j] >= l[i][j]:             c = 1          if i+1 < n and l[i+1][j] >= l[i][j]:              c = 1          if j-1 >= 0 and l[i][j-1] >= l[i][j]:     ...
Read more

Letters at position of multiples of a number

Letters at position of multiples of a number   Problem: A string of length L consists of characters is passed as input to the program. A given number N is also passed as the input to the program. The program must print the characters at the positions which are multiples of the given number.  Input Format:  The first line will contain the string of length L.  The second line will contain the number N.  Boundary Conditions:  3 <= L <= 50  1 <= N <= 30  Output Format:  The characters at the positions which are multiples of the given number.  Example Input/Output 1:  Input:  abcdef  3  Output:  cf  Explanation:  Multiples of 3 are like 3,6,9,... So the characters at positions 3,6 namely c and f are printed as output.  Example Input/Output 2:  Input:  environment  2  Output:  niomn  Explanation:  As it must be multiples of 2, the characters at even pos...
Read more