ch
Feedback

不要被骗子欺骗!Telemetrio 会找到并标记这些频道 👉 如果想查看标记,请订阅

CODING SOLUTIONS | IBM | AMAZON CODING SOLUTIONS

CODING SOLUTIONS | IBM | AMAZON CODING SOLUTIONS

前往频道在 Telegram

For any placement exam help contact: @tcsrolex

显示更多
8 815
订阅者
无数据24 小时
-207 天
-11730 天
帖子存档
🤡TCS NQT Exam August 15th help will be done 🛑Genuine Help 100% guaranteed clearance👍 booking will start from Tomorrow 😍 Telegram - Share✅✅ https://t.me/coding_solutions_all @tcs_nqt_answers_August

TCS PRA JAVA MCQ 1)grep status file1 2)Xp training 3)option C 4) option B 5)true 6)false 7) truncate 8)alter 9) option B 10) option A 11) option A 12) option C 13) option A 14)B,D 15)all of the above 16) option A 17) strong 18) option A 19) option B 20)h1 21)span 22) object 23)10 24)Go Green45 26) JDK 25)OPTION B 27)0 28) option A 29)false 30)easy to learn Telegram - Share✅✅ https://t.me/coding_solutions_all

TCS PRA JAVA MCQ 1)grep status file1 2)Xp training 3)option C 4) option B 5)true 6)false 7) truncate 8)alter 9) option B 10) option A 11) option A Telegram - Share✅✅ https://t.me/coding_solutions_all

Hexaware (only for 2023 batch) Apply link given below 👇👇 https://app.joinsuperset.com/company/hexaware/ Telegram - Share✅✅ https://t.me/coding_solutions_all

TCS IRA 1) All of the above 2)Excellence 3)IBM Watson 4)All of the above 5)Application Caching 6)A 7)Accurate and affrimative 8)Order 9)All of the above 10)C 11)wc-r 12)Option A ( to exit stauts special shell..) 13)>>symbol 14)h 15)?unix directory 16)B 17)B 18)IN 19)All the above will be printed 20)D 21)C 22)B 23)B 24)C 25)D 26)<th colspan="2">2020</th> 27)B 28) Telegram - Share✅✅ https://t.me/coding_solutions_all

How many of you need help for upcoming TCS NQT EXAM🤩 Let me know how many of them need help 🤩 give "👍" Who need help

Those who have TCS on August 15 will start bookings soon 🤩

Maximum multiple code in python 3 Telegram - Share✅✅ https://t.me/coding_solutions_all
Maximum multiple code in python 3 Telegram - Share✅✅ https://t.me/coding_solutions_all

Kth max code in java Telegram - Share✅✅ https://t.me/coding_solutions_all
Kth max code in java Telegram - Share✅✅ https://t.me/coding_solutions_all

#include int main() { int n, reverse = 0, remainder; scanf("%d", &amp;n); int p=n; while (n != 0) { remainder = n % 10; rever
#include <stdio.h> int main() { int n, reverse = 0, remainder; scanf("%d", &n); int p=n; while (n != 0) { remainder = n % 10; reverse = reverse * 10 + remainder; n /= 10; } int c=reverse -p; int d=abs(c); printf(" %d", d); return 0; } Code in c Telegram - Share✅✅ https://t.me/coding_solutions_all

#include int main() { char str[100]; int counter; printf("Enter a string: "); gets(str); // toggle each string characters for
#include <stdio.h> int main() { char str[100]; int counter; printf("Enter a string: "); gets(str); // toggle each string characters for (counter = 0; str[counter] != NULL; counter++) { if (str[counter] >= 'A' && str[counter] <= 'Z') str[counter] = str[counter] + 32; //convert into lower case else if (str[counter] >= 'a' && str[counter] <= 'z') str[counter] = str[counter] - 32; //convert into upper case } printf("String after toggle each characters: %s", str); return 0; } Language : C Telegram - Share✅✅ https://t.me/coding_solutions_all

int diff_primes_in_ranges(int input1, int intput2) { int ans = 0; int i, j, flag; for (i = input1; i &lt;= intput2; i++) { if
int diff_primes_in_ranges(int input1, int intput2) { int ans = 0; int i, j, flag; for (i = input1; i <= intput2; i++) { if (i == 1 || i == 0) continue; flag = 1; for (j = 2; j <= i / 2; ++j) { if (i % j == 0) { flag = 0; break; } } if (flag == 1) ans++; } return ans; }

KPIT SOLUTION:- C++ int k=input1/2000; input1=input1%2000; k=k+input1/500; input1=input1%500; k=k+input1/200; input1=input1%2
KPIT SOLUTION:- C++ int k=input1/2000; input1=input1%2000; k=k+input1/500; input1=input1%500; k=k+input1/200; input1=input1%200; k=k+input1/100; input1=input1%100; return k;