Privacy Policy This privacy policy applies to the Tic Tac Toe Offline (2 player) app (hereby referred to as "Application") for mobile devices that was created by Ayush Agrawal (hereby referred to as "Service Provider") as a Free service. This service is intended for use "AS IS". Information Collection and Use The Application collects information when you download and use it. This information may include information such as Your device's Internet Protocol address (e.g. IP address) The pages of the Application that you visit, the time and date of your visit, the time spent on those pages The time spent on the Application The operating system you use on your mobile device The Application does not gather precise information about the location of your mobile device. The Service Provider may use the information you provided to contact you from time to time to provide you with important information, required notices and marketing promotions. For a better ex...
Problem statement Given an array ‘A’. Your task is to choose any two different elements of the array say ‘X’ and ‘Y’, such that ‘Z’ is minimum possible. Where ‘Z’ = ‘X’ × ’Y’. Return the minimum possible value of ‘Z’. Example: ‘N’ = [5, 3, 9, 6, 3] ‘X’ can be chosen as 3(index 1) and ‘Y’ can be chosen as 3(index 4). 'Z' = 3*3 = 9. No other combination can have a smaller value of ‘Z’. Detailed explanation ( Input/output format, Notes, Images ) Constraints: 1 <= ‘T’ <= 10 2 <= ‘N’ <= 10^5 -10^4 <= ‘A[i]’ <= 10^4 Time Limit: 1 sec Sample Input 1: 2 6 -6 10 -1 2 10 -1 7 -7 5 -1 -4 -10 -8 10 Sample Output 1: -60 -100 Explanation of sample input 1: For 1st Testcase : ‘X’ can be chosen as -6(index 0) and ‘Y’ can be chosen as 10(index 1). 'Z' = -6*10 = -60. No other combination can have a smaller value of ‘Z’. For 2nd Testcase : ‘X’ can be chosen as -10(index 4) and ‘Y’ can be chosen as 10(index 6). 'Z' = -10*10 = -100. No other combination can ...