Daily jobs Updates
Відкрити в Telegram
500+ Placement & Competitive Exam Materials 75+ Companies Materials 100+ JOB Updates in a Month 🚀DM for Promotion @Wren_0 🚀Placement Updates: @offcampusjobs_0 🌟 Placment Material: @placement_materials0
Показати більше
Сітка:3 238
Підписники
+224 години
Немає даних7 днів
-5030 днів
Архів дописів
3 238
Python :RAO CODE❤️
100% Executing
n=int(input())
l=list(map(int,input().split()[:n]))
s=set(l)
f=[]
for i in s:
if(l.count(i)%2):
f.append(i)
if(len(f)==0):
print('All are even')
else:
for i in f:
print(i)
RAO CODE
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
3 238
Biker Code ::
Java 100% Executing ❤️❤️
import java.util.Scanner;
public class Bikers {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int t =in.nextInt();
int e[]= new int[t];
for(int i=0;i<t;i++)
e[i]= in.nextInt();
int count =0;
for(int i=0;i<t;i++){
for(int j= i+1;j<t;j++){
if(e[i]!=e[j] && e[i]==0){
count++;
}
}
}
System.out.println(count);
}
}
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
3 238
Maximum Number of Guests Cruise Code 100% Executing ❤️❤️
t= int(input ())
Max_g=0
g=0
For _ in range(t):
E=int(input())
L=int(input ())
g+= E-L
If g> max_g:
max_g=g
Print(max_g)
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
3 238
Party code 100% executing ❤️
n=int(input())
entry=[]
exit=[]
for i in range(n):
k=int(input())
entry.append(k)
for i in range(n):
l=int(input())
exit.append(l)
max=0
sum=0
for i in range(n):
sum+=entry[i]-exit[i]
if sum>=max:
max=sum
print(max)
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
3 238
Fun / Party Code :::
Python :
n=int(input())
l=list(map(int,input().split()[:n]))
s=set(l)
f=[]
for i in s:
if(l.count(i)%2):
f.append(i)
if(len(f)==0):
print('All are even')
else:
for i in f:
print(i)
All solution here
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
3 238
Fun / Party Code :::
Python :
n=int(input())
l=list(map(int,input().split()[:n]))
s=set(l)
f=[]
for i in s:
if(l.count(i)%2):
f.append(i)
if(len(f)==0):
print('All are even')
else:
for i in f:
print(i)
All solution here
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
3 238
![string=input() n=int(input()) p=int(string[0:n+1]) for i in range(len(string)-n): p=max(p,int(string[i:i+n+1])) print(p) Join](https://cdn.tlmtr.io/_next/static/media/empty-channel.35ed232f.svg)
string=input()
n=int(input())
p=int(string[0:n+1])
for i in range(len(string)-n):
p=max(p,int(string[i:i+n+1]))
print(p)
Join for more ❤️
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
3 238
#include <iostream>
using namespace std;
int main()
{
int count=1,n,j,i;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
for(i=1;i<n;i++)
{
for( j=0;j<i;j++)
{
if(arr[j]>arr[i])
{
break;
}
}
if(j==i)
count++;
}
cout<<count;
return 0;
}
C++
Join for more ❤️❤️
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
3 238
TCS NQT Solved Paper - 12th Sept 2021 [Morning Slot]
Join us for more ❤️
https://t.me/offcampusjobs_0
3 238
EPAM Off-Campus Drive | 2022 Batch | 6LPA
bit.ly/3BZ1vow
✅ Share post with ur college 2022 Batches
https://t.me/offcampusjobs_03 238
AWS Cloud, Linux, MySQL, GIT
Training Batch 47
*Starts from* 15th sep 2021, 06:30PM IST
✅50 Day's Live Classes.
✅Full practical Oriented.
✅Doubt Classes.
✅What's Group for any question.
🔘 Mentor:- Vinay Sir ( 15 year of teaching Experience in AWS Cloud, MySQL, GIT, DSA, Algorithm )
* For Registration ping me at :
https://wa.me/message/VOHSGXEQ66NKB1
Actual fees Rs. 5000 INR
Discount 50% Rs. 2500 INR on Actual fees.(For this batch only)
And if you Register today itself
Price will be 1500 INR(After all discount)
🔰Websites: https://mtnptech.com
3 238
Fujitsu Hiring Technical Trainee | 3.5 - 4LPA | 2019 2020 2021 Batch
bit.ly/3A65gYJ
Join Us for more
https://t.me/IT_JOB_UPDATES