Вже доступно! Дослідження Telegram за 2025 — головні інсайти року 
Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO
Відкрити в 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
Показати більше3 362
Підписники
Немає даних24 години
-67 днів
-3930 день
Архів дописів
All codes uploaded check above..👆👆👆👆👆👆
// Infosys
//Given Array A having N integers and divisor K
int morethanNbyK(vector<int> arr, int n, int k)
{
int x = n / k;
int ans = 0;
unordered_map<int, int> freq;
for (auto i : arr)
freq[i]++;
for (auto i : freq)
{
if (i.second > x)
{
ans += i.first;
}
}
return ans;
}
// @coding_000✅
// Infosys
// N flowers on a Recatangular pana
int ans = 100000000;
void solve(vector<int> a, int n, int k, int index, int sum,
int maxsum)
{
if (k == 1)
{
maxsum = max(maxsum, sum);
sum = 0;
for (int i = index; i < n; i++)
{
sum += a[i];
}
maxsum = max(maxsum, sum);
ans = min(ans, maxsum);
return;
}
sum = 0;
for (int i = index; i < n; i++)
{
sum += a[i];
maxsum = max(maxsum, sum);
solve(a, n, k - 1, i + 1, sum, maxsum);
}
}
int GetMaxBeauty(int N, int K, vector<int> A)
{
solve(A, N, K, 0, 0, 0);
return ans;
}
// @coding_000
My request to our group family don't trust anyone simply and don't lose money 🙏🥹
@Coding_000 ✅
All codes uploaded check above..👆👆👆👆👆👆
Take screenshot of my channel and share to large groups if u need more answers❤️😍
def getLargestString(s, k):
frequency_array = [0] * 26
for i in range(len(s)):
frequency_array[ord(s[i]) -
ord('a')] += 1
ans = ""
i = 25
while i >= 0:
if (frequency_array[i] > k):
temp = k
st = chr( i + ord('a'))
while (temp > 0):
ans += st
temp -= 1
frequency_array[i] -= k
j = i - 1
while (frequency_array[j] <= 0 and
j >= 0):
j -= 1
if (frequency_array[j] > 0 and
j >= 0):
str1 = chr(j + ord( 'a'))
ans += str1
frequency_array[j] -= 1
else:
break
elif (frequency_array[i] > 0):
temp = frequency_array[i]
frequency_array[i] -= temp
st = chr(i + ord('a'))
while (temp > 0):
ans += st
temp -= 1
else:
i -= 1
return ans
if name == "main":
S = input()
k = 3
print (getLargestString(S, k))
Python
Bob code✅✅
Telegram:- @Coding_000✅
Guys...pls...share our channel i will provide.solutions here...don`t spam on me...✅✅
My request to our group family don't trust anyone simply and don't lose money 🙏🥹
No one sharing our channel guys..the followers not increased yet..😐😔
Take screenshot of my channel and share to large groups if u need more answers❤️😍
All codes uploaded check above..👆👆
