Available now! Telegram Research 2025 — the year's key insights 
Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO
Open in Telegram
Main channel https://t.me/Coding_000 Contact Admin 👉 @ILOVEU_143 for booking your exam slots Web- https://coding000.github.io/Projects/ 💯% clearance in any placement exams OffCampus -https://t.me/Offcampus_000 Discussion- https://t.me/exams_discussion
Show more3 341
Subscribers
No data24 hours
-167 days
-5330 days
Posts Archive
Job is important for everyone 🙂🙂 please try to help genuinely 🙂🙂🙂🙂
@Coding_000
Also share with your friends 🤝
@Coding_000
If more people join the channel will provide any coding solution for free here in the channel 💥💥💥@Coding_000
✅Share✅Share✅Share ✅share✅
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
vector<int> v;
cin>>n;
for(int i=0;i<n;i++)
{
int t;
cin>>t;
v.push_back(t);
}
cin>>k;
sort(v.begin(),v.end());
cout<<v[k-1];
return 0;
}
c++ @Coding_000
AnimatedSticker.tgs0.02 KB
Job is important for everyone 🙂🙂 please try to help genuinely 🙂🙂🙂🙂
@Coding_000
Also share with your friends 🤝
@Coding_000
If more people join the channel will provide any coding solution for free here in the channel 💥💥💥@Coding_000
✅Share✅Share✅Share ✅share✅
int fun(int input1,int input2)
{
int l = input1;
int r = input2;
int ans = 0;
vector c(r+1,true);
c[0]=false;
c[1]=false;
for(int i = 2;i<= sqrt(r);i++)
for(int j = i*i;j<=r;j+=i)
c[j]=false;
for(int i = l;i<=r;i++)
if(c[i])
ans++;
return ans;
}
def ncr(n,r):
num=1
den=1
if r>n or n<0 or r<0:
return 0
else:
for i in range(n,n-r,-1):
num=num*i
for j in range(1,r+1):
den=den*j
return num/den
n=int(input())
r=int(input())
Job is important for everyone 🙂🙂 please try to help genuinely 🙂🙂🙂🙂
@Coding_000
Also share with your friends 🤝
@Coding_000
If more people join the channel will provide any coding solution for free here in the channel 💥💥💥@Coding_000
✅Share✅Share✅Share ✅share✅
n=int(input())
l=list(map(int,input().split()))
x=max(l)
for i in range(n):
if(l[i] in l[:i]):
l[i]=x+1
x+=1
print(sum(l))
mr.mayer and the exam code -python
#include<stdio.h>
int main()
{
int x;
scanf("%d",&x);
while(x--)
{
int n,op=0;
scanf("%d",&n);
int arr[n];
for(int i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
for(int i=0;i<n;i++)
{
if((arr[i]%2 ==0 && arr[i+1]%2 == 0) || (arr[i]%2 ==1 && arr[i+1]%2 ==1))
{
op++;
}
}
if(op==0)
{
printf("YES");
}
else
{
printf("NO");
}
}
}
special array in c @Coding_000
+2alt tab window code java
