Уже доступно! Исследование Telegram 2025 — ключевые инсайты года 
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 340
Подписчики
+224 часа
+17 дней
+2730 день
Архив постов
3 341
static void divide(String str, int n) {
if (str.length() % n != 0) {
System.out.print("Invalid Input: String size");
System.out.print(" is not divisible by n");
return;
}
int parts = str.length() / n;
int start = 0;
int t = parts;
while (start < str.length()) {
String temp = new String(str);
System.out.print(temp.substring(start, parts) + "\n");
start = parts;
parts += t;
// if(start < str.length()) System.out.println(); to ignore
// final new line
}
}
Count a's in each line
🚀🚀
https://t.me/offcampusjobs_0
3 341
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 341
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 341
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 341
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 341
Fake program
Piggy bank
In C ++ ❤️❤️100% working
https://t.me/offcampusjobs_0
3 341
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 341
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 341
EPAM Off-Campus Drive | 2022 Batch | 6LPA
bit.ly/3BZ1vow
✅ Share post with ur college 2022 Batches
https://t.me/offcampusjobs_0
3 341
EPAM Off-Campus Drive | 2022 Batch | 6LPA
bit.ly/3BZ1vow
✅ Share post with ur college 2022 Batches
https://t.me/offcampusjobs_0
3 341
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 341
Advertisement code
Join for more ❤️
https://t.me/offcampusjobs_0
https://t.me/offcampusjobs_0
3 341
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
