HYDERABAD BANGLORE REAL-ESTATE ||STOCKS || INVESTMENTS || PLOTS || RENTS
Відкрити в Telegram
Показати більше
1 831
Підписники
Немає даних24 години
Немає даних7 днів
Немає даних30 днів
Архів дописів
Array operations REVATURE
n,m=map(int,input().split())
arr=[]
ans=[]
for i in range(n):
dup=list(map(int,input().split()))
for x in dup:
arr.append(x)
k=int(input())
for i in set(arr):
if(arr.count(i)>=k):
ans.append(i)
ans.sort()
for i in ans:
print(i,end=" ")
Sum of nearest greater / smaller number
Python3
@placementupdatess
n,m=map(int,input().split())
arr=[]
ans=[]
for i in range(n):
dup=list(map(int,input().split()))
for x in dup:
arr.append(x)
k=int(input())
for i in set(arr):
if(arr.count(i)>=k):
ans.append(i)
ans.sort()
for i in ans:
print(i,end=" ")
Sum of nearest greater / smaller number
Python3 ✅
#include <stdio.h>
int main()
{
int i, j, rows;
scanf("%d", &rows);
for(i=1; i<=rows; i++)
{
for(j=1; j<=rows-i; j++)
{
printf(" ");
}
for(j=1; j<=rows; j++)
{
if(i==1 || i==rows || j==1 || j==rows)
printf("*");
else
printf(" ");
}
printf("\n");
}
return 0;
}
C code 🙂✅ pattern of 🤩 stars!
🔖LOWE'S INDIA - HIRING CODEATHON
Batch: 2022
Degree: BE/BTech
Stream: CS, Information Science, Electronics and Telecommunication
OPENS AT: JUN 12, 06:00 AM
CLOSES AT: JUN 13, 11:55 PM
📌Link: https://assessment.hackerearth.com/challenges/hiring/lowes-india-hiring-codeathon/
Telegram: @placementupdatess
@#@placementupdatess
int a=0,b=0;
for(int i=0;i<N;i++){
if(a>=b || i==0){
if(S[i]=='W') {
a++;
}
else{
b++;
}
}
else
{
if(S[i]=='W') {
b++;
}
else{
a++;
}
}
}
printf("%d %d",a,b);
#Round win
Company Name: Zycus
Job Role: Test Engineer
Location : Mumbai / Bangalore
Qualifications: BE in CS/IT
Experience : Freshers
Apply Link : https://cutt.ly/1bNEbpC
Aditya Kumar, [25.05.21 20:41]
[Forwarded from Aditya Kumar]
Amazon Off-Campus 2021 | Software Development Enginee Fresher
Location : Hydrabad
Qualification : B.E / B.Tech /
Work Experience : 0 - 1 Year
Apply - https://freshersworkjob.com/job/amazon-off-campus-2021-software-development-enginee-fresher/
#include <stdio.h>
int main()
{
int c = 0, count = 0;
char s[1000];
printf("Input a string\n");
gets(s);
while (s[c] != '\0') {
if (s[c] == 'a' || s[c] == 'A' || s[c] == 'e' || s[c] == 'E' || s[c] == 'i' || s[c] == 'I' || s[c] =='o' || s[c]=='O' || s[c] == 'u' || s[c] == 'U')
count++;
c++;
}
printf("%d", count);
return 0;
}
Mind 🎄 tree
C code for count of vowels
Accenture Hiring Associate Software Engineer & Software Engineer
indiacampus.accenture.com/register/accenture/vspdhc/apply/?event=3004
Telegram - @placementupdatess
