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 367
المشتركون
-124 ساعات
-127 أيام
-4630 أيام
أرشيف المشاركات
Start exam late...6:50✅
Guys i will share Ans here...😊
All the best...❤️👨💻
How many writing accenture
6:30
Hit like...👍👍
AnimatedSticker.tgs0.02 KB
int LetteredNumberSum(char* str, int len) {
if (str == nullptr) {
return 0;
}
int sum = 0;
for (int i = 0; i < len; i++) {
char letter = str[i];
int ans = 0;
//@rishi1193
switch (letter) {
case 'A':
ans = 1;
break;
case 'B':
ans = 10;
break;
case 'C':
ans = 100;
break;
case 'D':
ans = 1000;
break;
case 'E':
ans = 10000;
break;
case 'F':
ans = 100000;
break;
case 'G':
ans = 1000000;
break;
default:
ans = 0;
break;
}
sum += ans;
}
return sum;
}
C++
def NextSmallerNumber(a):
if a is None:
return None
n = len(a)
result = [-1] * n
stack = []
for i in range(n - 1, -1, -1):
while stack and stack[-1] >= a[i]:
stack.pop()
if stack:
result[i] = stack[-1]
stack.append(a[i])
return result
python
Share screenshot of my channel to larger groups if u need coding answers also
Share our channel screenshot in large groups ✅✅✅✅✅
For coding answers 🏃🏃🏃🏃
Share our channel screenshot in large groups ✅✅✅✅✅
For coding answers 🏃🏃🏃🏃
متاح الآن! بحث تيليغرام 2025 — أهم رؤى العام 
