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
JOB JOB JOB JOB ❤️
⚠️ Reminder - who didn't apply yet
✅TCS -
https://t.me/offcampusjobs_0/629
✅INFOSYS -
https://t.me/offcampusjobs_0/635
✅COGNIZANT -
https://t.me/offcampusjobs_0/683
✅EPAM-
https://t.me/offcampusjobs_0/672
✅INCEDO-
https://t.me/offcampusjobs_0/632
🔆Share in ur College WhatsApp Groups
https://t.me/offcampusjobs_0
3 238
n = int(input())
array = list(map(int,input().split()))
array.sort()
a = max(array)
array = array[:-1]
b = min(array)
array = array[1:]
c = max(array)
array = array[:-1]
d = min(array)
array = array[1:]
print(a -b + d - c)
Algebra code in python 100% working
https://t.me/offcampusjobs_0
3 238
str1=input()
str2=input()
n=len(str1)
n1=len(str2)
count=0
for i in range(min(n, n1)):
if (str1[i]!=str2[i]):
count+=1
print(count+abs(len(str1)-len(str2)))
English Teacher
In C ++ ❤️❤️100% working
https://t.me/offcampusjobs_0
3 238
static int sum_of_differences(int arr[], int N)
{
// Stores the sum
int sum = 0;
int i, j, flag;
// Traverse the array
for(i = 0; i < N - 1; i++)
{
if (arr[i] < arr[i + 1])
{
flag = 0;
for(j = i + 1; j < N - 1; j++)
{
// increasing sub-array is found
if (arr[j] >= arr[j + 1])
{
sum += (arr[j] - arr[i]);
i = j;
flag = 1;
break;
}
}
if (flag == 0 && arr[i] < arr[N - 1])
{
// Update sum
sum += (arr[N - 1] - arr[i]);
break;
}
}
}
return sum;
}
Family Piggy
In C ++ ❤️❤️100% working
https://t.me/offcampusjobs_0
3 238
CURRENCY EXCHANGE
❤️❤️100% working
https://t.me/offcampusjobs_0
def count(S, m, n ):
if (n == 0):
return 1
if (n < 0):
return 0;
if (m <=0 and n >= 1):
return 0
return count( S, m - 1, n ) + count( S, m, n-S[m-1] );
n=int(input())
m1 =int(input())
arr=[]
for i in range(1,m1+1):
arr.append(i)
m = len(arr)
print(count(arr, m, n))
❤️❤️100% working
https://t.me/offcampusjobs_0
3 238
def f(n):
if n==1:
return n
else:
return n*f(n-1)
n=int(input())
s=2*f(n-1)
print(s)
International round table python ❤️❤️100% working
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_0
3 238
EPAM Off-Campus Drive | 2022 Batch | 6LPA
bit.ly/3BZ1vow
✅ Share post with ur college 2022 Batches
https://t.me/offcampusjobs_0
3 238
Housing Society Code :
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n],b[n],d=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
b[i]=0;
}
for(int i=0;i<n;i++)
{
int k = a[i],c=1;
for(int j=i+1;j<n;j++)
{
if(b[i]==0 && a[i]==a[j])
{
c++;
b[j]++;
}
}
if(c%2==0)
{
d++;
}
}
cout<<d;
return 0;
}
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
3 238
String inception ::
#include <iostream>
using namespace std;
int main() {
string s;
cin>>s;
int n=s.size();
for(int i=0;i<n;i++){
char c=s[i];
int a=c-'a';
a+=5;
a%=26;
s[i]=char(a+'a');
}
cout<<s<<endl;
return 0;
}
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
3 238
# Straight Line number or not❤️
def isStraighLineNum(N):
# N must be > 99
if (N <= 99):
return False;
str1 = str(N);
# Difference between consecutive
# digits must be same
d = int(str1[1]) - int(str1[0]);
for i in range(2, len(str1)):
if (int(str1[i]) -
int(str1[i - 1]) != d):
return False;
return True;
# Driver Code
# Given Number N
N = 135;
# Function Call
if (isStraighLineNum(N)):
print("Yes");
else:
print("No");
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
3 238
CPP ❤️
RAO CODE
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
char arr[n];
for(int i=0;i<n;i++) {
cin>>arr[i];
}
int ans=0;
for(int i=0;i<n;i++) {
for(int j=i+1;j<n;j++) {
if(arr[i]==0 && arr[j]==1) {
ans++;
}
}
}
cout<<ans;
return 0;
}
RAO CODE
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
