-
Given a list of N (1 <= N <= 50000) integer. You are required to compute the number of pairs of indexes whose values are the same, and also the maximum distance between two indexes with equal values. N will be given in the first line of the input. N lines follow each one with one integer from the list. If no identical pairs are found, print NA, otherwise print a single line with two integers, the number of identical pairs, and the maximum distance between indexes with equal values.
Sample Input1:
6
1
2
3
2
4
2
Sample Output1:
2 4
Sample Input2:
4
1
2
3
4
Sample Output2:
NA
-
The e-commerce company ‘Easy Shopping’ displays some specific products for its premium customers on its user interface. The company shortlisted a list of N products. The list contains the price of each product. The company will select random products for display. The selection criteria states that only those products whose price is a perfect cube number will be selected for display. The selection process is automated and is done by the company’s system. The company wishes to know the total count of the products selected for display.
Input Format:
Write an algorithm to find the count of products that will be displayed.
The first line of the input consists of an integer – numProducts, representing the number of products(N).
Output Format:
The second line consists of N space-separated integers – price0, price1,…,priceN-1 representing the product price of the N shortlisted products.
Print an integer representing the number of products that will be selected for display.
Output Format:
0<=numProducts<=10^6
Sample Input:
0<=price<=10^6
6
125 216 54 81 48 343
Sample Output:
3
-
You are given an array Arr of N integers. You need to find the length of longest Peak Subarray of the given array Arr.
Input Format:
Peak Array: Array A of length K is called as a peak Array, if following condition holds true:
A[1]<A[2]<A[3]<….<A[K].
Formally any strictly increasing array is called a Peak Array.
Subarray: Subarray of any array is a contiguous part of the array (with length greater than zero).
Your task is to find the length of the longest peak subarray of a given array.
Note: Array of length 1 is always a Peak Array.
First line of input, single integer value N
Output Format:
Second line of input, contains N integers with space-separation for Array Arr.
Print an integer that represents the length of longest peak subarray.
Sample Input:
5
3 3 9 8 4
Sample Output:
2
-
Suppose, for a stock, we have a series of N daily price quotes. For each day, the task is to find how many such continuous days (including current day) are there prior to the current day where the price of the stock was less than or equal to the price on the current day.
Hint: Start counting continuously from the current day to all days before it; stop when the stock is higher than the current day.
For example, 6 day’s stock prices are as follows: {100, 60, 70, 65, 80, 85}
Input Format:Day 1 2 3 4 5 6 Stock Price 100 60 70 65 80 85 Output 1 1 2 1 4 5
First input, the candidate has to write the code to accept a single integer value N denoting the number of days.
Output Format:
Second input, the code should accept N number of integer values separated by a space.
Output should be N integer values from the list separated by a single space character.
Constraints:
2 <= N <= 100 0 <= L[i] <= 100000
Sample Input:
6
100 60 70 65 80 85
Sample Output:
1 1 2 1 4 5
