Bunch of Room Keys TCS NQT

Bunch of Room Keys TCS NQT 

Problem:

In a lodge, there is a bunch of room keys having key number stamped on each key. There may be few duplicate keys in the bunch (i.e., more than one key with the same number). A room can be opened with a key which must have the room's number. There is a rare chance of blank keys (-) which are the keys without numbers, and no room can be opened with those keys. The program must accept the list of key numbers available in the bunch as the input. The character q or Q in the input represents the end of the key numbers list. The program must print the output based on the following conditions. 

- The program must print the string value "Blank Keys: " followed by the number of blank keys in the bunch. 

- Then the program must print the string value "Total Keys: " followed by the total number of keys available in the bunch. 

- Finally, the program must print the string value "Number of rooms: " followed by the total number of rooms available in the lodge as the output. 



Boundary Condition(s): 

1 <= Length of each key number <= 5 

Input Format: 

The lines, each contains a string value representing the key numbers available in the bunch. The last line contains the character 'q' or 'Q' represents the end of the key numbers list. 

Output Format: 

The first line contains the string value "Blank Keys: " followed by the number of blank keys in the bunch. The second line contains the string value "Total Keys: " followed by the total number of keys available in the bunch. The third line contains the string value "Number of rooms: " followed by the total number of rooms available in the lodge. 

Example Input/Output 1: 

Input: 

A101 

A103 

A102

B202

 - 

A102 

A101 

B201 

B203 

- 

B203 

Q 

Output: 

Blank Keys: 2 

Total Keys: 11 

Number of rooms: 6 

Explanation: 

The number of blank keys in the list of key numbers is 2. So Blank Keys: 2 is printed. There are 9 numbered keys and 2 blank keys, the total number of keys in the bunch is 11. So Total Keys: 11 is printed. The number of unique key numbers in the list is 6. So Number of rooms: 6 is printed. 

Example Input/Output 2: 

Input: 

A100 

B205 

B103 

C115 

C100 

- 

B205 

A100 

- 

B205 

- 

C114 

q 

Output: 

Blank Keys: 3 

Total Keys: 12 

Number of rooms: 6

Program:

blank = 0 

total_key = 0

unique_key = []

while 1:

    s = input().strip() 

    if s == 'q' or s == 'Q':

        break 

    if s == '-':

        blank += 1

    elif s not in unique_key:

        unique_key.append(s)

    total_key += 1     

print("Blank Keys:",blank)

print("Total Keys:",total_key)

print("Number of rooms:",len(unique_key))

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