0

Array 1

can someone pls give me the idea to write the code for the below problem? I will upload the code shortly. pls correct any mistakes. thanks. Given two arrays of integers output the smallest number in the first array not present in the second one. Input Specification: The first line contains the size Nl of the first array. Next line give the contents of the first array. Next line contains the size N2 of the second array. Next line give the contents of the second array. Output Format: Output must be a single number which is the smallest number occurring in the first array that does not occur in the second. In case there is no such number, output NO. Variable Constraints: The sizes of the arrays are smaller than 20. Each array entry is an integer which fits an int data type. Example: Input: 3 2 3 4 4 1 3 5 7 1 3 5 7 Output: 2 Input 1 1 2 1 2 Output NO https://code.sololearn.com/c9HC4afzClIN/?ref=app John Wells

26th Sep 2018, 4:20 PM
Nilutpol Kashyap
Nilutpol Kashyap - avatar
1 Odpowiedź
0
John Wells sir can you please help me with the code
26th Sep 2018, 6:19 PM
Nilutpol Kashyap
Nilutpol Kashyap - avatar