Scribd
Upload
67 views

Irp May 29th

The document contains 3 coding questions with solutions: 1) A C program to count the number of perfect pairs (where the sum is a perfect square or cube) in an integer array. 2) A Java program that takes a string and dictionary, and returns all possible sentences formed by inserting spaces into the string to separate valid dictionary words. 3) Python and Java programs to reverse a string while keeping punctuation and spaces in their original positions.

Uploaded by

Ch Chaitanya4272
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
67 views

Irp May 29th

The document contains 3 coding questions with solutions: 1) A C program to count the number of perfect pairs (where the sum is a perfect square or cube) in an integer array. 2) A Java program that takes a string and dictionary, and returns all possible sentences formed by inserting spaces into the string to separate valid dictionary words. 3) Python and Java programs to reverse a string while keeping punctuation and spaces in their original positions.

Uploaded by

Ch Chaitanya4272
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 5

2023_Infosys Power Programmer Test 7

IRP 29-05-2022

1)Rajiv and Nitish had a fight because Rajiv was annoying Nitish with his question.
Rajiv being a genius in arrays gave Nitish an array of natural numbers A of length
N with elements A1, A2, . . ., AN. Nitish has to find the total amount of perfect
pairs in the array.

A perfect pair (Ai, Aj) is a pair where (Ai + Aj) is a perfect square or a perfect
cube and i ≠ j.

Since Rajiv and Nitish are not talking with each other after the fight you have
been given the question to solve and inturn make both of them a perfect pair again.

NOTE:- A pair (Ai, Aj) and (Aj, Ai) are the same and not to be counted twice.

CODE :- C

// Write your code here


#include<stdio.h>
int arr[2000];
int st[100002],used[1002];
int num[1001];
int all[56];
int main()
{
int i,t,T,n,k=0;
for(i=0;i<2000;i++)
arr[i]=-1;
for(i=0;i<56;i++)
all[i]=-1;
for(i=1;i<=44;i++)
{
if(i<=12)
{
arr[i*i*i]=1;
}
arr[i*i]=1;
}
for(i=0;i<2000;i++)
{
if(arr[i]==1)
all[k++]=i;
}
scanf("%d",&T);
for(t=1;t<=T;t++)
{
scanf("%d",&n);
for(i=0;i<1002;i++)
{num[i]=0;used[i]=0;}
int count=0;
int flag=0;
for(i=0;i<n;i++)
{
scanf("%d",&st[i]);
//printf("%d ",st[i]);
num[st[i]]+=1;
}
//printf("\n");
/* for(i=0;i<1002;i++)
{
if(num[i]>0)
{
printf("no ");
}
}*/
for(i=1;i<=1000;i++)
{
if(num[i]>=1)
{
for(int j=0;j<k;j++)
{
int c=all[j]-i;;
if(c>0&&c<=1000)
{
if(num[c]>=1&&c!=i)
{count+=num[c]*num[i];
//num[c]=0;
//num[st[i]]=0;
// printf("%d %d\n",st[i],c);
}
else if(c==i&&num[c]>1&&used[c]!=1)
{
//count+=(num[c]*num[c]-1)/2;
flag+=(num[c]*(num[c]-1))/2;
//num[c]=0;
used[c]=1;
// printf("%d %d %d %d\n",st[i],c,num[c],
(num[c]*num[c]);
}

}
}
}
}
printf("%d\n",(count)/2+flag);
}
return 0;
}

2)Given a string s and a dictionary of words dict, add spaces in s to construct a


sentence where each word is a valid dictionary word.
Return all such possible sentences.

For example, given

s = "snakesandladder",

dict = ["snake", "snakes", "and", "sand", "ladder"].

A solution is ["snakes and ladder", "snake sand ladder"].

CODE :- JAVA

import java.util.*;

class DictionaryWord {

public static void main(String[] args) {


Scanner s=new Scanner(System.in);
int t=s.nextInt();
for (int j = 0; j < t; j++) {
int n = s.nextInt();
String[] dict = new String[n];
for (int i = 0; i < n; i++) {
dict[i] = s.next();
}
String str = s.next();
findSol(str, str.length(), "", dict);
}
}
public static void findSol(String str,int n,String res,String[] dict)
{
for (int i = 1; i <=n; i++) {
String s=str.substring(0,i);
if(Arrays.asList(dict).contains(s))
{
if (i==n)
{
res=res+s;
System.out.println(res);
return;
}
String temp=str.substring(i,n);
findSol(temp,temp.length(),res+s+" ",dict);
}
}
}
}

3)You’re given a string as an input. You have to reverse the string by keeping the
punctuation and spaces. You have to modify the source string itself by creating
another string.

CODE :- PYTHON 3.8

str1=list(input())
str2=[]
for i in str1:
if i.isalnum():
str2.append(i)
str2=list(str2[::-1])
for i in range(len(str1)):
if str1[i].isalnum()==False:
str2.insert(i,str1[i])
for i in str2:
print(i,end="")
print()

SOLUTION 2 :-
CODE :- JAVA

import java.util.*;
import java.lang.*;
class Main{
public static void main(String args[]){
Scanner s=new Scanner(System.in);
String str=s.nextLine();
char[] input = str.toCharArray();
char[] result=new char[input.length];
for(int i=0;i<input.length;i++){
if(input[i]==' '||input[i]== ','|| input[i] == '.'||input[i] == '!'||
input[i] == '?'||input[i]== ':' ||input[i] == ';'||input[i]=='-')
result[i]=input[i];
}
int k=0;
for(int i=input.length-1;i>=0;i--){
if(input[i]!=' '&&input[i]!= ','&& input[i] != '.'&&input[i] !=
'!'&&input[i] != '?'&&input[i]!= ':' &&input[i] != ';'&&input[i]!='-')
{
if(result[k]=='\0'){
result[k]=input[i];
k++;
}
else {
result[++k]=input[i];
k++;
}
}

}
for(int i=0;i<input.length;i++){
System.out.print(result[i]);
}
}
}

You might also like