TCS NQT Questions.txt

1.  
    Problem Statement – An automobile company manufactures both a two wheeler (TW) and a four wheeler (FW). A company manager wants to make the production of both types of  vehicle according to the given data below:
    
    1st data, Total number of vehicle (two-wheeler + four-wheeler)=v
    2nd data, Total number of wheels = W
    The task is to find how many two-wheelers as well as four-wheelers need to manufacture as per the given data.
    Example :
    
    Input :
    200  -> Value of V
    540   -> Value of W
    
    Output :
    TW =130 FW=70
    
    Explanation:
    130+70 = 200 vehicles
    (70*4)+(130*2)= 540 wheels
    
    Constraints :
    
    2<=W
    W%2=0
    V<W
    Print “INVALID INPUT” , if inputs did not meet the constraints.
    
    The input format for testing 
    The candidate has to write the code to accept two positive numbers separated by a new line.
    
    First Input line – Accept value of V.
    Second Input line- Accept value for W.
    The output format for testing 
    
    Written program code should generate two outputs, each separated by a single space character(see the example)
    Additional messages in the output will result in the failure of test case
    
2. 
    Problem Statement – Given a string S(input consisting) of ‘*’ and ‘#’. The length of the string is variable. The task is to find the minimum number of ‘*’ or ‘#’ to make it a valid string. The string is considered valid if the number of ‘*’ and ‘#’ are equal. The ‘*’ and ‘#’ can be at any position in the string.
    Note : The output will be a positive or negative integer based on number of ‘*’ and ‘#’ in the input string.
    
    (*>#): positive integer
    (#>*): negative integer
    (#=*): 0
    Example 1:
    Input 1:
    
    ###***   -> Value of S
    Output :
    
    0   → number of * and # are equal
    
3. 
    Given an integer array Arr of size N the task is to find the count of elements whose value is greater than all of its prior elements.
    
    Note : 1st element of the array should be considered in the count of the result.
    
    For example,
    Arr[]={7,4,8,2,9}
    As 7 is the first element, it will consider in the result.
    8 and 9 are also the elements that are greater than all of its previous elements.
    Since total of  3 elements is present in the array that meets the condition.
    Hence the output = 3.
    Example 1:
    
    Input 
    5 -> Value of N, represents size of Arr
    7-> Value of Arr[0]
    4 -> Value of Arr[1]
    8-> Value of Arr[2]
    2-> Value of Arr[3]
    9-> Value of Arr[4]
    
    Output :
    3
    
    Example 2:
    5   -> Value of N, represents size of Arr
    3  -> Value of Arr[0]
    4 -> Value of Arr[1]
    5 -> Value of Arr[2]
    8 -> Value of Arr[3]
    9 -> Value of Arr[4]
    
    Output : 
    5
    
    Constraints
    
    1<=N<=20
    1<=Arr[i]<=10000
    
4. 
    A parking lot in a mall has RxC number of parking spaces. Each parking space will either be  empty(0) or full(1). The status (0/1) of a parking space is represented as the element of the matrix. The task is to find index of the prpeinzta row(R) in the parking lot that has the most of the parking spaces full(1).
    
    Note :
    RxC- Size of the matrix
    Elements of the matrix M should be only 0 or 1.
    
    Example 1:
    Input :
    3   -> Value of R(row)
    3    -> value of C(column)
    [0 1 0 1 1 0 1 1 1] -> Elements of the array M[R][C] where each element is separated by new line.
    Output :
    3  -> Row 3 has maximum number of 1’s
    
    Example 2:
    input :
    4 -> Value of R(row)
    3 -> Value of C(column)
    [0 1 0 1 1 0 1 0 1 1 1 1] -> Elements of the array M[R][C]
    Output :
    4  -> Row 4 has maximum number of 1’s

5. 
    A party has been organised on cruise. The party is organised for a limited time(T). The number of guests entering (E[i]) and leaving (L[i]) the party at every hour is represented as elements of the array. The task is to find the maximum number of guests present on the cruise at any given instance within T hours.
    
    Example 1:
    Input :
    
    5    -> Value of T
    [7,0,5,1,3]  -> E[], Element of E[0] to E[N-1], where input each element is separated by new line 
    [1,2,1,3,4]   -> L[], Element of L[0] to L[N-1], while input each element is separate by new line.
    Output :
    8     -> Maximum number of guests on cruise at an instance.
    
    Explanation:
    
    1st hour:
    Entry : 7 Exit: 1
    No. of guests on ship : 6
    
    2nd hour :
    Entry : 0 Exit : 2
    No. of guests on ship : 6-2=4
    
    Hour 3:
    Entry: 5 Exit: 1
    No. of guests on ship : 4+5-1=8
    
    Hour 4:
    Entry : 1 Exit : 3
    No. of guests on ship : 8+1-3=6
    
    Hour 5:
    Entry : 3 Exit: 4
    No. of guests on ship: 6+3-4=5
    Hence, the maximum number of guests within 5 hours is 8.
    
    Example 2:
    Input:
    4  -> Value of T
    [3,5,2,0]   -> E[], Element of E[0] to E[N-1], where input each element is separated by new line.
    [0,2,4,4]    -> L[], Element of L[0] to L[N-1], while input each element in separated by new line
    
    Output:
    6
    Cruise at an instance
    
    Explanation:
    Hour 1:
    Entry: 3 Exit: 0
    No. of guests on ship: 3
    
    Hour 2:
    Entry : 5 Exit : 2
    No. of guest on ship: 3+5-2=6
    
    Hour 3:
    Entry : 2 Exit: 4
    No. of guests on ship: 6+2-4= 4
    
    Hour 4:
    Entry: 0  Exit : 4
    No. of guests on ship : 4+0-4=0
    
    Hence, the maximum number of guests within 5 hours is 6.
    The input format for testing
    The candidate has to write the code to accept 3 input.
    First input- Accept  value for number of T(Positive integer number)
    Second input- Accept T number of values, where each value is separated by a new line.
    Third input- Accept T number of values, where each value is separated by a new line.
    The output format for testing
    The output should be a positive integer number or a message as given in the problem statement(Check the output in Example 1 and Example 2)
    
    Constraints:
    
    1<=T<=25
    0<= E[i] <=500
    0<= L[i] <=500

6.
    At a fun fair, a street vendor is selling different colours of balloons. He sells N number of different colours of balloons (B[]). The task is to find the colour (odd) of the balloon which is present odd number of times in the bunch of balloons.
    
    Note: If there is more than one colour which is odd in number, then the first colour in the array which is present odd number of times is displayed. The colours of the balloons can all be either upper case or lower case in the array. If all the inputs are even in number, display the message “All are even”.
    
    Example 1:
    
    7  -> Value of N
    [r,g,b,b,g,y,y]  -> B[] Elements B[0] to B[N-1], where each input element is sepārated by ṉew line.
    Output :
    
    r -> [r,g,b,b,g,y,y]  -> “r” colour balloon is present odd number of times in the bunch.
    Explanation:
    From the input array above:
    
    r: 1 balloon 
    g: 2 balloons
    b:  2 balloons
    y : 2 balloons
    Hence , r is only the balloon which is odd in number.
    Example 2:
    Input:
    
    10 -> Value of N
    [a,b,b,b,c,c,c,a,f,c] -> B[], elements B[0] to B[N-1] where input each element is separated by new line.
    Output :
    b-> ‘b’ colour balloon is present odd number of times in the bunch.
    
    Explanation:
    From the input array above:
    
    a: 2 balloons
    b: 3 balloons 
    c: 4 balloons 
    f: 1 balloons 
    Here, both ‘b’ and ‘f’ have odd number of balloons. But ‘b’ colour balloon occurs first.
    Hence , b is the output.
    
    Input Format for testing
    The candidate has to write the code to accept: 2 input 
    
    First input: Accept value for number of N(Positive integer number).
    Second Input : Accept N number of character values (B[]), where each value is separated by a new line.
    Output format for testing
    The output should be a single literal (Check the output in example 1 and example 2)
    
    Constraints:
    
    3<=N<=50
    B[i]={{a-z} or {A-Z}}
    
7.
    There is a JAR full of candies for sale at a mall counter. JAR has the capacity N, that is JAR can contain maximum N candies when JAR is full. At any point of time. JAR can have M number of Candies where M<=N. Candies are served to the customers. JAR is never remain empty as when last k candies are left. JAR if refilled with new candies in such a way that JAR get full.
    Write a code to implement above scenario. Display JAR at counter with available number of candies. Input should be the number of candies one customer can order at point of time. Update the JAR after each purchase and display JAR at Counter.
    
    Output should give number of Candies sold and updated number of Candies in JAR.
    
    If Input is more than candies in JAR, return: “INVALID INPUT”
    Given,
    N=10, where N is NUMBER OF CANDIES AVAILABLE
    K =< 5, where k is number of minimum candies that must be inside JAR ever.
    Example 1:(N = 10, k =< 5)
    
    Input Value
    3
    Output Value
    NUMBER OF CANDIES SOLD : 3
    NUMBER OF CANDIES AVAILABLE : 7
    
    Example : (N=10, k<=5)
    
    Input Value
    0
    Output Value
    INVALID INPUT NUMBER OF
    CANDIES LEFT : 10
    
8.
    Selection of MPCS exams include a fitness test which is conducted on ground. There will be a batch of 3 trainees, appearing for running test in track for 3 rounds. You need to record their oxygen level after every round. After trainee are finished with all rounds, calculate for each trainee his average oxygen level over the 3 rounds and select one with highest oxygen level as the most fit trainee. If more than one trainee attains the same highest average level, they all need to be selected.
    
    Display the most fit trainee (or trainees) and the highest average oxygen level.
    
    Note:
    
    The oxygen value entered should not be accepted if it is not in the range between 1 and 100.
    If the calculated maximum average oxygen value of trainees is below 70 then declare the trainees as unfit with meaningful message as “All trainees are unfit.
    Average Oxygen Values should be rounded.
    Example 1:
    INPUT VALUES
    95
    92
    95
    92
    90
    92
    90
    92
    90
    
    OUTPUT VALUES
    Trainee Number : 1
    Trainee Number : 3
    
    Note:
    Input should be 9 integer values representing oxygen levels entered in order as
    
    Round 1
    
    Oxygen value of trainee 1
    Oxygen value of trainee 2
    Oxygen value of trainee 3
    Round 2
    
    Oxygen value of trainee 1
    Oxygen value of trainee 2
    Oxygen value of trainee 3
    Round 3
    
    Oxygen value of trainee 1
    Oxygen value of trainee 2
    Oxygen value of trainee 3
    Output must be in given format as in above example. For any wrong input final output should display “INVALID INPUT”
    
9. 
    Problem Statement
    
    A washing machine works on the principle of Fuzzy System, the weight of clothes put inside it for washing is uncertain But based on weight measured by sensors, it decides time and water level which can be changed by menus given on the machine control area.  
    
    For low level water, the time estimate is 25 minutes, where approximately weight is between 2000 grams or any nonzero positive number below that.
    
    For medium level water, the time estimate is 35 minutes, where approximately weight is between 2001 grams and 4000 grams.
    
    For high level water, the time estimate is 45 minutes, where approximately weight is above 4000 grams.
    
    Assume the capacity of machine is maximum 7000 grams
    
    Where approximately weight is zero, time estimate is 0 minutes.
    
    Write a function which takes a numeric weight in the range [0,7000] as input and produces estimated time as output is: “OVERLOADED”, and for all other inputs, the output statement is
    
    “INVALID INPUT”.
    
    Input should be in the form of integer value –
    
    Output must have the following format –
    
    Time Estimated: Minutes
    
    Example:
    Input value
    2000
    Output value
    Time Estimated: 25 minutes

10. 
    Problem Statement
    
    The Caesar cipher is a type of substitution cipher in which each alphabet in the plaintext or messages is shifted by a number of places down the alphabet.
    For example,with a shift of 1, P would be replaced by Q, Q would become R, and so on.
    To pass an encrypted message from one person to another, it is first necessary that both parties have the ‘Key’ for the cipher, so that the sender may encrypt and the receiver may decrypt it.
    Key is the number of OFFSET to shift the cipher alphabet. Key can have basic shifts from 1 to 25 positions as there are 26 total alphabets.
    As we are designing custom Caesar Cipher, in addition to alphabets, we are considering numeric digits from 0 to 9. Digits can also be shifted by key places.
    For Example, if a given plain text contains any digit with values 5 and keyy =2, then 5 will be replaced by 7, “-”(minus sign) will remain as it is. Key value less than 0 should result into “INVALID INPUT”
    
    Example 1:
    Enter your PlainText: All the best
    Enter the Key: 1
    
    The encrypted Text is: Bmm uif Cftu
    
    Write a function CustomCaesarCipher(int key, String message) which will accept plaintext and key as input parameters and returns its cipher text as output.
    
11.
    K Reverse Count
    The program must accept an integer Array values and another
    two digits value K. The program must print the number of times the reversed
    value of K is present in Array
    
    1 <= N <= 10^16
    
    10 <= K <= 99
    
    Input:
    
    19 59 69 9
    90
    Output:
    
    4
    Explanation:
    
    Reverse of K=90 is 9 which is present 4 times in
    N.
12. 
    A doctor has a clinic where
    he serves his patients. The doctor’s consultation fees are different for
    different groups of patients depending on their age. The patients age has read
    from each node from SLL Model. If the patient’s age is below 17, fees is 200
    INR. If the patient’s age is between 17 and 40, fees is 400 INR. If patient’s
    age is above 40, fees is 300 INR. Write a code to calculate earnings in a day
    for which one array/List of values representing age of patients visited on that
    day is passed as input.
    
    
    Note:
    
    
    Age should not be zero or
    less than zero or above 120
    
    
    Doctor consults a maximum of
    20 patients a day
    
    
    Example 1:  18 21 45 60 87 22 10 12
    
    Output
    : Total Income ?   INR
    
13. 
    Given an integer
    array nums of size n, return the minimum number of moves
    required to make all array elements equal.
    In one move, you can
    increment n - 1 elements of the array by 1.
    
    Example 1:
    Input: nums = [1,2,3]
    Output: 3
    
    Explanation:
     Only three moves are needed (remember each
    move increments two elements):
    [1,2,3]  => 
    [2,3,3]  =>  [3,4,3] 
    =>  [4,4,4]
    
    Example 2:
    Input: nums = [1,1,1]
    Output:
    0
    
14. 
    Interchange First Last N Characters:
    
    The program must accept a string S and
    interchange the first and last N characters. Then the program must print the
    revised string value.
    
    2 <= Length of S <= 100
    
    1 <= N <= (Length of S)/2
    
    The first line contains S.
    The second line contains N.
    The first line contains a string value.
    
    Input:
    abcdefgh
    3

    Output:    
    fghdeabc
    
    Input:
    mango
    2
    
    Output:
    gonma
    
15. 
    To print Arayy values to 24 Hrs Time Format
    int arr[]={1,6,7,5};
    Output :
    17:56
    16:57

    int arr[]={1,2,3,4};
    Output :
    23:41
    23:14
    21:43
    21:34
    14:32
    14:23
    13:42
    13:24
    12:43
    12:34
    
    int arr[]={1,5,5,5};
    Output :
    15:55
    
    int arr[]={5,5,5,5};
    Output :
    NULL