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 343
المشتركون
-424 ساعات
-187 أيام
-5230 أيام
أرشيف المشاركات
AWS Certified Cloud Practitioner 😃 Solutions available 😍
who are will to write contact @ILOVEU_000 ✅
@ILOVEU_000
GLOBAL CERTIFICATION AWS CERTIFIED CLOUD PRACTITIONER😊😊
Hi guys ❤️
COGNIZANT GENC EXAM Tomorrow Help Available ✅✅
All Slots are available🙌🙌
Book ur slot ASAP with @ILOVEU_000😎😎 Clear your first rounds 💯💯💯💯
Your exam clearence is our responsibility 🙌🙌🙌Only limited seats Hurry and Grab your slots ⭐⭐⭐
Scrollup and see our past work then only decide 👆👆🎉
📌📌 @Coding_000
Placements Help Available 👍👍
If you also want to crack your current placements
Contact: @ILOVEU_000
Book your slots ASAP
Scroll above and check the work
💯 Clearence @Coding_000
Note: It's paid💶🤑
✅Share✅Share✅Share ✅share✅
Cognizant off campus drive
GenC - Generation Cognizant (Entry level)
Role : PAT
Experience: fresher
Location: PAN India
Qualification: BE/BTech/ME/MTech/MCA
Passout year: 2023
Salary: 4 - 4.5 LPA
Join us : @Coding_000
Apply Now:https://app.joinsuperset.com/company/cognizant/SouthTNColleges.html
Placements Help Available 👍👍
If you also want to crack your current placements
Contact: @ILOVEU_000
Book your slots ASAP
Scroll above and check the work
💯 Clearence @Coding_000
Note: It's paid💶🤑
✅Share✅Share✅Share ✅share✅
Many people's got this mail 🙂🙂
This is IRC mail guys that means it's just a mock test 👍
It's not main exam guys 👍
Don't confuse about this mail ☺️
Telegram: @Coding_000
str1 = input()
str2 = input ()
vowels = 'aeiou'
c1 = c2 = 0
for ch in str1:
if ch in vowels:
c1 += 1
for ch in str2:
if ch in vowels:
c2 += 1
print(min(c1,c2))
input2[-1] +=1
ans = input2[::-1]
i=0
while i<= input1:
if ans[i]>=9:
ans[i+1]+=1
i+=1
else:
print(input1-i)
break
Python
LCS With Vowels
📌📌TCS NQT OCTOBER 27 th Exam
Morning & Afternoon Slot ☀️☀️
We will Provide Entire Exam Answers With PART:-A & PART:-B 💯💯
⭐Ninja & Digital Roles Assistance is available ⭐
TCS Intake Mass Hiring For Freshers 😀 So don't miss the opportunity To become a TCSER❤️
Book ur slot ASAP and Grab ur complete Exam Accurate Answers ✅✅💯💯
👇👇For Slot Booking 👇👇
@ILOVEU_000
@ILOVEU_000
Your Exam Clearence Is our responsibility and unbreakable Promise 🙌🙌
📌📌 Telegram:
https://t.me/Coding_000
https://t.me/Coding_000
😉☝️☝️For proofs just scrollup our channel and see our 19th,20,21st,22nd,23rd,24th,25th 28th work ❤️
❌ Don't go for Free answers they are all wrong(they just give answers randomly to increase there followers) they don't care about ur exam ❌
Project available any body want message me
@ILOVEU_000
Placements Help Available 👍👍
If you also want to crack your current placements
Contact: @ILOVEU_000
Book your slots ASAP
Scroll above and check the work
💯 Clearence @Coding_000
Note: It's paid💶🤑
✅Share✅Share✅Share ✅share✅
(Python3)
Total Number of possible pairs(a,b)
All test cases passes
Telegram:- @Coding_000
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
متاح الآن! بحث تيليغرام 2025 — أهم رؤى العام 
