Most Favorite Place in India - TCS NQT

Most Favorite Place in India - TCS NQT 

Problem:

A travel agency is conducting a survey for the most favorite place to visit in India. There are 5 options given to their customers which are given below. 

1 Jaipur 

2 Agra 

3 Rishikesh 

4 Goa 

5 Mysore 

The program must accept a list of integers representing the options selected by the customers. The program must print the name of the most preferred favorite place to visit among the given 5 places as the output. In case of more than one preferred destinations, the program must print the name of those places in the above mentioned order. 

Boundary Condition(s): 

1 <= options <= 5 

Input Format: 

The lines, each containing an integer representing the option selected by a customer. 

Output Format: 

The line(s) containing a string value representing the most preferred favorite place to visit. 

Example Input/Output 1: 

Input: 

1 

4 

5 

2 

2 

3 

5 

2 

3 

2 

2 

1 

1 

Output: 

Agra 

Explanation: 

For each place, the name of the place and the number of customers preferred are given below. Jaipur - 3 Agra - 5 Rishikesh - 2 Goa - 1 Mysore - 2 Here the most preferred favorite place to visit among the given 5 places is Agra. Hence the output is Agra. 

Example Input/Output 2: 

Input: 

4 

3 

2 

4 

1 

3 

4 

1 

3 

Output: 

Rishikesh 

Goa

Program:

city = ['Jaipur','Agra','Rishikesh','Goa','Mysore'] 

l = []

count = [0]*5 

while 1:

    try: 

        x = int(input())

        l.append(x)

        count[x-1] += 1 

    except:

        break

for i in range(1,6):

    if l.count(i) == max(count):

        print(city[i-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