CODING SOLUTION - Placement Jobs & Materials

2022-01-12 08:35:35 Scroll Up For WIPRO SOLUTION Open / Comment

2022-01-12 08:33:56 WIPRO NTH Solved Paper – 25th Sept 2021 [Slot 1]:
Telegram - t.me/studymaterial_IT Open / Comment

2022-01-12 08:21:53 Python
Online Exam
Wipro
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-12 08:21:53 Product ID
WIPRO
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-12 08:21:53 Product ID
WIPRO
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-12 08:21:53 #include"stdio.h"
void main() {
int n;
scanf("%d", &n);
if (n >= 30 && n <= 50)
printf("D");
elseif(n >= 51 && n <= 60)
printf("C");
elseif(n >= 61 && n <= 80)
printf("B");
elsif(n >= 81 && n <= 100)
printf("A")
}

C language
E-Commerce Code
Wipro
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-12 08:21:53 int main()
{
int no;
scanf("%d",&no);
int max = 10;
int rem;
while(no){
rem = no%10;
if(remmax= rem;
}
no/=10;
}
printf("%d",max);
}

C language
Count of Unique Authors
Wipro
Telegram - t.me/codingsolution_IT

7.3K views05:21

Open / Comment

2022-01-12 08:21:53 #include"stdio.h"
int main()
{
int n,k,j,temp;
scanf("%d %d",&n,&k);
int a[n],i;
for(i=0;iscanf("%d",&a[i]);
for(i=0;i{
for(j=i+1;j{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("%d",a[k-1]);
return 0;
}

C language
K-th shortest execution time
Wipro
Telegram - t.me/codingsolution_IT

7.2K views05:21

Open / Comment

2022-01-12 08:21:53 #include"stdio.h"
int main(void) {
long long int n;
scanf("%d",&n);
int sum = 0;
int r = 0;
while(n>0){
r = n%10;
if(r%2==0){
sum+=r;
}
n/=10;
}
printf("%d\n",sum);
return 0;
}

C language
Advertisement program
Wipro
Telegram - t.me/codingsolution_IT Open / Comment

2022-01-12 08:21:53 int digsum(int x)
{
int dsum=0;
while(x!=0)
{
dsum+=x%10;
x= x/10;
}
if(dsum>=1&&dsum<=26)
return dsum;
else
digsum(dsum);
}
int main()
{
int n,dsum=0;
scanf("%d",&n);
dsum=digsum(n);
printf("%c",'A'+dsum-1);
return 0;
}

C language
Application ID
Wipro
Telegram - t.me/codingsolution_IT Open / Comment