en
Feedback
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 337
Subscribers
-424 hours
-147 days
-5330 days
Posts Archive
Guys if you want remaining answers share the screenshot in large groups โœ… and share with your friends ๐Ÿ”ฅ I haven't seen anyone sharing the answers ๐Ÿฅบ I won`t post ans now no one is sharing ๐Ÿ˜ข @Coding_000

19)๐š ๐š’๐š๐š‘ ๐šŠ๐š— ๐šŠ๐šŒ๐šŒ๐š’๐š๐šŽ๐š—๐š 20)๐™ผ๐šŠ๐š‹๐šŽ๐š• ๐š‘๐šŠ๐š ๐š‹๐šŽ๐šŽ๐š— 21)๐š“๐šŠ๐šŒ๐š” ๐šŽ๐šก๐š™๐š›๐šŽ๐šœ๐šœ 22)๐šƒ๐š˜๐š—๐šŽ ๐š๐šŽ๐šŠ๐š 23)๐™ถ๐š›๐šŽ๐šŠ๐š ๐š–๐šž๐šœ๐š’๐šŒ 24)๐š’๐š—๐š๐š’๐šŠ๐š— ๐šŒ๐š•๐šŠ๐šœ๐šœ๐š’๐šŒ๐šŠ๐š• 25)๐š’๐š ๐š’๐šœ ๐š—๐š˜๐š ๐š’๐š—๐šŒ๐š•๐šž๐šœ๐š’๐šŸ๐šŽ

Guys if you want remaining answers share the screenshot in large groups โœ… and share with your friends ๐Ÿ”ฅ I haven't seen anyone sharing the answers ๐Ÿฅบ @Coding_000

#include using namespace std; int getSum(int n) {     if (n < 10)     {    &n
#include <bits/stdc++.h> using namespace std; int getSum(int n) {     if (n < 10)     {         if (n == 1)             return 1;         else             return 0;     }     int sum = 0;     while (n != 0)     {         sum = sum + n % 10;         n = n / 10;     }     return getSum(sum); } int main() {   int n;   cin>>n;   cout<<getSum(n);     return 0; } C++ language ๐Ÿ™‚ Telegram - Shareโœ…โœ… ๐Ÿ‘‡๐Ÿ‘‡ @Coding_000

#include using namespace std; int main() { &nbsp;&nbsp;&nbsp; int n; &nbsp;&nbsp;&nbsp; cin &gt;&gt; n; &nbsp;&nbsp;&nbsp; ve
#include <bits/stdc++.h> using namespace std; int main() {     int n;     cin >> n;     vector<int> vec(n, 0);     for (int i = 0; i < n; i++)     {         vec[i];     }     int ans = 1;     for (int i = 1; i < n; i++)     {         if (vec[i - 1] < vec[i])         {             int t = vec[i] - vec[i - 1];             int m = max(m, t);             ans += m;         }         else         {             ans++;         }     }     cout << ans;     return 0; } ๐Ÿ™‚ Telegram - Shareโœ…โœ… ๐Ÿ‘‡๐Ÿ‘‡ https://t.me/coding_solutions_all @Coding_000

we providing fast ans please share to large group make 2k ๐Ÿ˜

Guys if you want remaining answers share the screenshot in large groups โœ… and share with your friends ๐Ÿ”ฅ I haven't seen anyone sharing the answers ๐Ÿฅบ @Coding_000