Wipro NLTH Previous Year All Slot Programming Answers

> [11th Jan 2021 to 17th Jan 2021]

>

 

1) Security Key

A company is transmitting data to another server. The data is in the form of numbers. To secure the data during transmission, they plan to obtain a security key that will be sent along with the data. The security key is identified as the count of the repeating digits in the data.

Write an algorithm to find the security key for the data. Input

The input consists of an integer data, representing the data to be transmitted. Output

Print an integer representing the security key for the given data. If no data is repeated it should display

-1








/>

Text Box: Wipro NLTH Previous Year All Slot Programming Answers [11th Jan 2021 to 17th Jan 2021] 1) Security Key Description

 


 

 


 

 


 

 


 

 

 

 

#

Input

Expected Output

 

1

578378923

3

 

Programming Language: C (GCC 9.2.0)

2)

Text Box: Encode as Number Description

 

Text Box: A company wishes to encodes its data. The data is in the form of a number. They wish to encode the data with respect to a specific digit. They wish to count the number of times the specific digit reoccurs in the given data so that they can encode the data accordingly. Write an algorithm to find the count of the specific digit in the given data. Input The input consists of two space-separated integers- data and digit, representing the data to be encoded and the digit to be counted in the data. Output Print an integer representing the count of the specific digit.

Constraints                                                                                                                 

 

 NA                                                                                                                                        

Example                                                                                                                 

 

Text Box: Input: 572378233 3 Output: 3


Text Box: Explanation

 


 

 

 

 

#

Input

Expected Output

1

572378233 3

3

 

 

 


 

3)

Text Box: Sum of Adjacent Distances Difficulty: easy Max Points: 10 Description

 


 

Text Box: NA

Text Box: Example

 


 

 


 

 

 

 

#

Input

Expected Output

1

5 10 11 7 12 14

12

 

sum=sum+t;

 

 

 

printf("%d",sum);

 

}

 

 

}
 
4)

Text Box: Odd Even Online Game Difficulty: easy Max Points: 10 Description

 


 

 


 

 


 

 


 

 

#

Input

Expected Output

1

8 10 98 3 33 12 22 21 11

10 98 12 22 3 33 21 11

 

Programming Language: C (GCC 9.2.0)

#include <stdio.h>

 

int main()

{

    int n;

    scanf("%d", &n);

    int i,a[n];

    for(i=0;i<n;i++)

    {

        scanf("%d",&a[i]);

 

    }

    for(i=0;i<n;i++)

    {

        if(a[i]%2==0)

            printf("%d ",a[i]);

    }

    for(i=0;i<n;i++)

    {

        if(a[i]%2!=0)

            printf("%d ",a[i]);

}

}

 

 

5)

Text Box: One Time Password Difficulty: easy Max Points: 10 Description

 

Text Box: An e-commerce site wishes to enhance its ordering process. They plan to implement a new scheme of OTP (One Time Password) generation for order confirmations. The OTP can be any number of digits. For OTP generation, the user will be asked to enter two random numbers. The first number entered should always be smaller than the second number. The OTP is calculated as the sum of the maximum and the minimum prime values in the range of the user-entered numbers. Write an algorithm to find the OTP Input The input consists of two space-separated integers – firstNumber and secondNumber, representing the two numbers entered by the user. Both numbers are considered in the range. Output


Text Box: Constraints

Text Box: Print an integer representing the sum of the largest and smallest prime numbers in the range of given numbers.

 


 

 


 

 


 

 

 

 

#

Input

Expected Output

1

-97 50

50

 

Text Box: Programming Language: C (GCC 9.2.0) #include<stdio.h> int main() { long long int x,y,t; scanf("%lld %lld",&x,&y); if(x>y) { t=x; x=y; y=t; } long long int i,maxp,minp; while(1) { if(x<0) t=-x; else t=x; for(i=2;i<=t/2;i++) { if(t%i==0)


 

 

 

6)

Text Box: SecretMessage agency Difficulty: easy Max Points: 10 Description

 

Text Box: SecretMessage agency provides message encoding and decoding services for secure data transfer. The first step in decoding includes removal of special characters and the whitespaces from the message, as special characters and whitespaces do not hold any meaning. Write an algorithm to help the agency find the number of special characters and whitespaces in a given message. Input The input consists of a string message, representing the message that need to be decoded by the agency. Output


Text Box: Print an integer representing the number of special characters and whitespaces present in a given message.

 

Text Box: Constraints

 


 

 


 

 


 

 

 

 

#

Input

Expected Output

1

gasgg54@#vscsd!s*

4

 


7)

Garments company Apparel                                                                           


Text Box: Difficulty: easy Max Points: 10 Description

 


 

 


 

 


 

 


 

 

#

Input

Expected Output

1

8 79 77 54 81 48 34 25 16

3

Text Box: Programming Language: C (GCC 9.2.0) #include<stdio.h> int main() { int n; scanf("%d",&n); int a[n],i; for(i=0;i<n;i++) { scanf("%d",&a[i]); } int sroot,c=0; for(i=0;i<n;i++) { for(sroot=2;sroot*sroot<a[i];sroot++) ; if(sroot*sroot==a[i]) c++; } printf("%d",c); }

 

8)

Text Box: Bucketize Ids Difficulty: easy Max Points: 10 Description

 

Text Box: A company wishes to bucketize their item IDs for better search operations. The bucket for the item ID is chosen on the basis of the maximum value of the digit in the item ID. Write an algorithm to find the bucket to which the item ID will be assigned. Input The input consists of an integer item1D, representing the identity number of the item. Output Print an integer representing the bucket to which the item ID will be assigned.

Constraints                                                                                                                 

 

 

  NA                                                                                                                                        

Example                                                                                                                 


Text Box: Input: 32387634 Output: 8

 

Text Box: Explanation

 


 

 

 

 

#

Input

Expected Output

1

32387634

8

 

 

Programming Language: C (GCC 9.2.0)

#include <stdio.h>

 

int main()

{

long int n;

 

    scanf("%ld",&n);

    int m;

    m=n%10;

    while(n)

 

{

 

if(m>n%10)

 

            m=n%10;

        n=n/10;

    }

printf("%d",m);

 

return 0;

 

}

 

 

9)

Text Box: Bingo-Online Lottery Game Difficulty: easy Max Points: 10 Description

 

Text Box: A game company has designed an online lottery game, Bingo. In this game, N number cards are displayed. Each card has a value on it. The value can be negative or positive. The player must


Text Box: Constraints

Text Box: choose two cards. To win the game, the product of the values of the two cards must be the maximum value possible for any pair of cards in the display. The winning amount will be the sum of the two cards chosen by the player. Write an algorithm to find the winning amount as the sum of the values of the two cards whose product value is maximum. Input The first line of the input consists of an integer numCards, representing the number of cards (N). The second line consists of N space-separated integers , val1 , val2…., valN representing the values on the cards. Output Print an integer representing the sum of the values of the two cards whose product value is maximum.

 


 

 


 

 


 

 

 

 

#

Input

Expected Output

1

7 9 -3 8 -6 -7 8 10

19

 

 

10)

Text Box: Digital Secure Data Transfer Solutions Difficulty: easy Max Points: 10 Description

 

Text Box: The company Digital Secure Data Transfer Solutions provides data encryption and data sharing services. Their process uses a key K for encryption when transmitting characters. To encrypt a character, the character is replaced by the following Kth character with the same case in the English alphabet set. The English alphabetical set is considered in a cyclic fashion for the last K characters. Write an algorithm to find the character used to encrypt the given character. Input The input consists of a space-separated character and integer - character and key, representing the character to be transmitted, and the key (K), respectively. Output


Text Box: Print a character representing the encrypted character.

Text Box: Constraints

 


 

 


 

 


 

 

 

 

#

Input

Expected Output

1

D 3

G

 

Text Box: Programming Language: C (GCC 9.2.0) #include <stdio.h> int main() { char ch; int k; scanf("%c",&ch); scanf("%d",&k); k=k%26; if(ch>='a' && ch<='z') { if(ch+k>'z') ch=ch+k-26; else ch=ch+k; } if(ch>='A' && ch<='Z') { if(ch+k>'Z')

 

11)

Text Box: Pooled cab service Difficulty: easy Max Points: 10 Description

 


 

 


 

 


 

 

Text Box: There are three employees with distances 38, 48 and 39 whose distance from the office lies within the given range.


Text Box: Public Test Cases

 

 

 

#

Input

Expected Output

1

6 30 50 29 38 12 48 39 55

38 48 39

 


 

12)

Text Box: Kth Shortest Processing Queue Difficulty: easy Max Points: 10 Description

 

Text Box: A company wishes to modify the technique by which tasks in the processing queue are executed. There are N processes with unique IDs from 0 to N-1. Each of these tasks has its own execution time. The company wishes to implement a new algorithm for processing tasks. For this purpose they have identified a value K By the new algorithm, the processor will first process the task that has the Kth shortest execution time. Write an algorithm to find the Kth shortest execution time. Input The first line of the input consists of two space-separated integers - numTasks and valueK representing the number of tasks (N) and the value K, which is used as reference, respectively. The second line consists of N space-separated integers - exectuionTimep exectuionTime2, , exectuion7imeN representing the execution times of the tasks.


Text Box: Constraints

Text Box: Output Print an integer representing the Kth shortest execution time.

 


 

 


 

 


 

 

 

 

#

Input

Expected Output

1

7 5 9 -3 8 -6 -7 18 10

9

 

 

Programming Language: C (GCC 9.2.0)

#include <stdio.h> int main()

{

    int n,k;

    scanf("%d %d", &n,&k);

    int a[n],i,j,t; for(i=0;i<n;i++)

{

 

 

scanf("%d",&a[i]);

}

 

for(i=0;i<n-1;i++)

{

 

for(j=0;j<n-1-i;j++)

{

if(a[j]>a[j+1])

 

{

t=a[j];

 

a[j]=a[j+1];

 

13)

Text Box: Charlie Magic Mirror Difficulty: easy Max Points: 10 Description

 

Text Box: Charlie has a magic mirror. The mirror shows right rotated versions of given word.To generate different right-rotations of a word. Write the word in a circle in clockwise order, then start reading from any given character in clockwise order till you have covered all the characters. In the word “sample”, if we start with ‘P’, we get the right rotated word as “plesam”. There are six such right rotations of “sample” including itself. The inputs to the function isSameReflection consists of two string, word1 and word2. The function returns 1 if word1 and word2 are right rotations of the same word and -1 if they are not. Both word1 and word2 will strictly contain characters between ‘a’-‘z’ (lower case letters).

Constraints                                                                                                                 

 

 NA                                                                                                                                        

Example                                                                                                                 

 

Text Box: INPUT: plesam OUTPUT: 1

Explanation                                                                                                                 

 

 NA                                                                                                                                        

Public Test Cases                                                                                                                 

 

#

Input

Expected Output

1

sample plesam

1

 

Programming Language: C (GCC 9.2.0)

#include <stdio.h>

 

int main()

{

    int i,j;

    char s1[100],s2[100],s3[100];

    scanf("%s %s", s1,s2);

    for(i=0,j=0;s2[i]!='\0';i++,j++)

    {

        s3[j]=s2[i];

    }

    for(i=0;s2[i]!='\0';i++,j++)

    {

        s3[j]=s2[i];

    }

    s3[j]='\0';

    j=0;

    for(i=0;s3[i]!='\0';i++)

    {

        if(s3[i]==s1[j])

        {

            j++;

        }

        else

            j=0;

        if(s1[j]=='\0')

        {

            printf("1");

            break;

        }

 

 

}

if(s1[j]!='\0')

{

printf("-1");

}

 

return 0;

 

}

 

14)

Text Box: Employee’s Rating Point Difficulty: easy Max Points: 10 Description


Text Box: Constraints