en
Feedback

Don't get caught by a cheater! Telemetrio finds and tags such channels 👉 If you want to see the tag, subscribe

Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Coding | EXAMS | IBM ACCENTURE | VIRTUSA | IBM | AMAZON | TCS | EPAM | WILEY EDGE | TECH MAHINDRA | JPMORGAN | HCL | WIPRO

Open in 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

Show more
3 257
Subscribers
No data24 hours
-107 days
-3930 days
Posts Archive
#include using namespace std; int main() { string S; cin >> S; int n = S.length(); int dp[n + 1]; memset(dp, 0x3f, sizeof dp)
#include <bits/stdc++.h> using namespace std; int main() {     string S;     cin >> S;     int n = S.length();     int dp[n + 1];     memset(dp, 0x3f, sizeof dp);     dp[0] = 0;     for (int i = 0; i < n; i++) {         int digit = S[i] - '0';         for (int j = max(0, i - 2); j < i; j++) {             int sum = 0;             for (int k = j; k <= i; k++) {                 sum += S[k] - '0';             }             if (sum % 3 == 0) {                 int cost = digit;                 for (int k = j; k <= i; k++) {                     cost = min(cost, S[k] - '0'); //@Coding_000                 }                 dp[i + 1] = min(dp[i + 1], dp[j] + cost);             }         }     }     cout << dp[n] << endl;     return 0; } C++ INFOSYS EXAM ANS 10AM ALL Slots are available
22 Jan 2023, 00:01

Guys share questions here...👇👇 https://t.me/exams_discussion share and support ✅
21 Jan 2023, 23:44
22 Jan 2023, ~00:22

How many of u writing INFOSYS today 10am & 3 pm  Give heart..reactions fast ❤️
21 Jan 2023, 21:52

Deloitte WILEY EDGE AMAZON SDE Slots are available Contact @ILOVEU_143✅
21 Jan 2023, 20:24
22 Jan 2023, ~01:49

INFosys Exam 👇👇 SP & DSP Free solutions...join add ur frdss fast💥💥 https://t.me/exams_discussion https://t.me/exams_discussion https://t.me/exams_discussion Share to ur frds...✅✅ @Coding_000✅😍
21 Jan 2023, 20:24
22 Jan 2023, ~02:42

Add ur frds.... I will help u maximum codes share here...😊👍
21 Jan 2023, 12:05
21 Jan 2023, ~20:24

Attention guys 💢💢 Those who have Infosys SP and DSE exam. ✊✊ I request everyone Don't pay money to pay anyone for Infosys SP and DSE exam.🙏🙏🙏🙏 Because everyone have different different coding questions and plagarism there. Codes are too hard. Please don't waste your money on this exam 😬😬😬. I think no one will slove the Infosys codes Because codes are too hard 😅😅😅 Be aware with scammers and don't waste your money on this exam 🤗🤗 Our LOVE team knows everything about every company 👍👍👍👍👍 Note: we are not helping Infosys SP and DSE exam 🙂🙂 Please share this information to your friends. So everyone will know the reality of Infosys SP and DSE exam ✊✊✊✅ #ILOVEU
21 Jan 2023, 11:33
21 Jan 2023, ~11:42

INFosys Exam 👇👇 SP & DSP Free solutions...join add ur frdss fast💥💥 https://t.me/exams_discussion https://t.me/exams_discussion https://t.me/exams_discussion Share to ur frds...✅✅ @Coding_000✅😍
21 Jan 2023, 11:30
21 Jan 2023, ~20:24

Quantitative 1 13 2 686 3 3:1:1 4 10 5 1022 Logical 1 13 2 U 3 25/3/96 4 840 5 WATER Programming Logic 1 O(log n) 2 To create a variable that is shared across all instances of a class 3 Hash Table 4 AND 5 O(n+m) Join here👇👇 @Coding_000✅
21 Jan 2023, 10:42
21 Jan 2023, ~22:35

Deloitte WILEY EDGE AMAZON SDE Slots are available Contact @ILOVEU_143✅
21 Jan 2023, 10:32
21 Jan 2023, ~20:24

INFosys Exam 👇👇 SP & DSP Free solutions...join add ur frdss fast💥💥 https://t.me/exams_discussion https://t.me/exams_discussion https://t.me/exams_discussion Share to ur frds...✅✅ @Coding_000✅😍
21 Jan 2023, 10:32
21 Jan 2023, ~11:30

Any  One Send me Deliotee Coding Question 👇👇
21 Jan 2023, 09:44
21 Jan 2023, ~10:32