(43 sloc) 1.27 KBRaw Blame You have been given an integer array/list(ARR) of size N. Where N is equal to [2M + 1]. Now, in the given array/list, 'M' numbers are present twice and one number is present only once. You need to find and return that number which is unique in the array/list. Note: Unique element is always present in the array/list according to the given condition. Input format : The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow. First line of each test case or query contains an integer 'N' representing the size of the array/list. Second line contains 'N' single space separated integers representing the elements in the array/list. Output Format : For each test case, print the unique element present in the array. Output for every test case will be printed in a separate line. Constraints : 1 <= t <= 10^2 0 <= N <= 10^6 Time Limit: 1 sec Sample Input 1: 1 7 2 3 1 6 3 6 2 Sample Output 1: 1 Sample Input 2: 2 5 2 4 7 2 7 9 1 3 1 3 6 6 7 10 7 Sample Output 2: 4 10 Solutions://////

C++ is a general purpose, high level programming language. It is an extension of C language.It…

Answered: You have been given an integer…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

(43 sloc) 1.27 KB

Raw Blame

	You have been given an integer array/list(ARR) of size N. Where N is equal to [2M + 1].
	Now, in the given array/list, 'M' numbers are present twice and one number is present only once.
	You need to find and return that number which is unique in the array/list.
	Note:
	Unique element is always present in the array/list according to the given condition.
	Input format :
	The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.

	First line of each test case or query contains an integer 'N' representing the size of the array/list.

	Second line contains 'N' single space separated integers representing the elements in the array/list.
	Output Format :
	For each test case, print the unique element present in the array.

	Output for every test case will be printed in a separate line.
	Constraints :
	1 <= t <= 10^2
	0 <= N <= 10^6

	Time Limit: 1 sec
	Sample Input 1:
	1
	7
	2 3 1 6 3 6 2
	Sample Output 1:
	1
	Sample Input 2:
	2
	5
	2 4 7 2 7
	9
	1 3 1 3 6 6 7 10 7
	Sample Output 2:
	4
	10
	Solutions://////

Expert Solution

Step by step

Solved in 4 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions