IBM | AMAZON | ACCENTURE OA Exams SOLUTIONS
Open in Telegram
To get geniune help contact us We know how important job is... #tatasteel #accenture #ibm #Tcsnqt #tcspaidnqt #placementexam
Show moreThe country is not specifiedEducation22 490
8 865
Subscribers
No data24 hours
-207 days
-9830 days
Data loading in progress...
Similar Channels
Tags Cloud
No data
Any problems? Please refresh the page or contact our support manager.
Incoming and Outgoing Mentions
---
---
---
---
---
---
Attracting Subscribers
February '25
February '25
+1
in 0 channels
January '25
+2
in 0 channels
Get PRO
December '24
+2
in 0 channels
Get PRO
November '24
+8
in 0 channels
Get PRO
October '24
+13
in 0 channels
Get PRO
September '24
+48
in 0 channels
Get PRO
August '24
+174
in 0 channels
Get PRO
July '24
+62
in 0 channels
Get PRO
June '24
+10
in 0 channels
Get PRO
May '24
+20
in 0 channels
Get PRO
April '24
+12
in 0 channels
Get PRO
March '24
+8
in 0 channels
Get PRO
February '24
+3
in 0 channels
Get PRO
January '24
+103
in 0 channels
Get PRO
December '23
+3
in 0 channels
Get PRO
November '23
+25
in 0 channels
Get PRO
October '23
+34
in 0 channels
Get PRO
September '23
+58
in 0 channels
Get PRO
August '23
+6
in 0 channels
Get PRO
July '23
+61
in 0 channels
Get PRO
June '23
+87
in 0 channels
Get PRO
May '23
+42
in 0 channels
Get PRO
April '23
+248
in 0 channels
Get PRO
March '23
+136
in 0 channels
Get PRO
February '23
+8
in 0 channels
Get PRO
January '23
+52
in 0 channels
Get PRO
December '22
+8
in 0 channels
Get PRO
November '22
+9
in 0 channels
Get PRO
October '22
+310
in 0 channels
Get PRO
September '22
+243
in 0 channels
Get PRO
August '22
+5 616
in 0 channels
Get PRO
July '22
+465
in 0 channels
Get PRO
June '22
+787
in 0 channels
Get PRO
May '22
+1 167
in 0 channels
Get PRO
April '22
+1 705
in 0 channels
Get PRO
March '22
+3 552
in 0 channels
Get PRO
February '22
+2 748
in 0 channels
Get PRO
January '22
+2 595
in 0 channels
| Date | Subscriber Growth | Mentions | Channels | |
| 16 February | 0 | |||
| 15 February | 0 | |||
| 14 February | +1 | |||
| 13 February | 0 | |||
| 12 February | 0 | |||
| 11 February | 0 | |||
| 10 February | 0 | |||
| 09 February | 0 | |||
| 08 February | 0 | |||
| 07 February | 0 | |||
| 06 February | 0 | |||
| 05 February | 0 | |||
| 04 February | 0 | |||
| 03 February | 0 | |||
| 02 February | 0 | |||
| 01 February | 0 |
Channel Posts
+2
š¢ NAMMA YATRI done successfully ā¤
All codes Done Successfully ā
šÆ Clearance Guarantee ā
Contact @UrTrusty
Help done through Remote access ā„
| 2 | š¢ GOOGLE,IBM,AMAZON, ACCENTURE and any OA/Placements exam help available
100% clearance will be provided
Full exam help will be provided
To book slot contact @UrTrusty | 592 |
| 3 |  +5š¢ COGNIZANT EXAM done successfully ā¤
Both Code + Both Sql + Frond-End Code Done Successfully ā
šÆ Clearance Guarantee ā
Contact @UrTrusty
Help done through Remote access ā„ | 580 |
| 4 |  +4š¢ COGNIZANT EXAM done successfully ā¤
Both Code + Both Sql + Frond-End Code Done Successfully ā
šÆ Clearance Guarantee ā
Contact @UrTrusty
Help done through Remote access ā„ | 697 |
| 5 |  +1š¢ IBM EXAM done successfully ā¤
Contact @UrTrusty
šÆ clearance
Help done through Remote access ā„ | 581 |
| 6 | š¢ IBM,AMAZON, ACCENTURE and any OA/Placements exam help available
100% clearance will be provided
Full exam help will be provided
To book slot contact @UrTrusty | 765 |
| 7 | IPV6 Code
Java
IBM
public static String convertToIpv6(String ipv4Address) {
String[] octets = ipv4Address.split("\\.");
if (octets.length != 4) {
return "Invalid input";
}
if (octets[0].equals("127")) {
return "::1";
}
StringBuilder ipv6 = new StringBuilder("::FFFF:");
try {
for (int i = 0; i < 4; i++) {
int octet = Integer.parseInt(octets[i]);
if (octet < 0 || octet > 255) {
return "Invalid input";
}
String hex = String.format("%02X", octet);
ipv6.append(hex);
if (i == 1) {
ipv6.append(":");
}
}
} catch (NumberFormatException e) {
return "Invalid input";
}
return ipv6.toString();
}
IPV6 Code
Java
IBM
Triangle Code
C++
IBM
double calculate_area(int a, int b, int c) {
double p = (a + b + c) / 2.0;
return (p * (p - a) * (p - b) * (p - c));
}
int compare(const void* a, const void* b) {
triangle* t1 = (triangle*)a;
triangle* t2 = (triangle*)b;
if (t1->area < t2->area)
return -1;
else if (t1->area > t2->area)
return 1;
else
return 0;
}
int sort_by_area(triangle* tr, int n) {
if (tr == NULL || n <= 0) {
return -1;
}
for (int i = 0; i < n; i++) {
tr[i].area = calculate_area(tr[i].a, tr[i].b, tr[i].c);
}
qsort(tr, n, sizeof(triangle), compare);
return 0;
}
Triangle Code
C++
IBM | 1 112 |
| 8 | public static String convertToIpv6(String ipv4Address) {
String[] octets = ipv4Address.split("\\.");
if (octets.length != 4) {
return "Invalid input";
}
if (octets[0].equals("127")) {
return "::1";
}
StringBuilder ipv6 = new StringBuilder("::FFFF:");
try {
for (int i = 0; i < 4; i++) {
int octet = Integer.parseInt(octets[i]);
if (octet < 0 || octet > 255) {
return "Invalid input";
}
String hex = String.format("%02X", octet);
ipv6.append(hex);
if (i == 1) {
ipv6.append(":");
}
}
} catch (NumberFormatException e) {
return "Invalid input";
}
return ipv6.toString();
}
IPV6 Code
Java
IBM
Triangle Code
C++
IBM
https://telegram.me/+Q_kf6B6EFexiNmU9
double calculate_area(int a, int b, int c) {
double p = (a + b + c) / 2.0;
return (p * (p - a) * (p - b) * (p - c));
}
int compare(const void* a, const void* b) {
triangle* t1 = (triangle*)a;
triangle* t2 = (triangle*)b;
if (t1->area < t2->area)
return -1;
else if (t1->area > t2->area)
return 1;
else
return 0;
}
int sort_by_area(triangle* tr, int n) {
if (tr == NULL || n <= 0) {
return -1;
}
for (int i = 0; i < n; i++) {
tr[i].area = calculate_area(tr[i].a, tr[i].b, tr[i].c);
}
qsort(tr, n, sizeof(triangle), compare);
return 0;
}
Triangle Code
C++
IBM | 1 |
| 9 |  +2š¢ DELOITTE EXAM done successfully ā¤
Contact @UrTrusty
šÆ clearance
Help done through Remote access ā„ | 859 |
| 10 | šØ TATA STEEL Exam only limited students help will be done..
Book your slots who want to clear exam
Contact @UrTrusty to book slot
100 percent clearance will be given for TATA STEEL EXAM
IBM, AMAZON, JUSPAY, LTI MINDTREE Exam help available | 561 |
| 11 | š¢ IBM,AMAZON, CISCO and any OA/Placements exam help available
100% clearance will be provided
Full exam help will be provided
To book slot contact @UrTrusty | 1 205 |
| 12 | š¢ IBM,JUSPY,WALMART and any OA/Placements exam help available
100% clearance will be provided
Full exam help will be provided
To book slot contact @UrTrusty
Take remote access/mode help and pay after code pass | 249 |
| 13 |  +4š¢ BROWSERSTACK EXAM done successfully ā¤
Contact @UrTrusty
šÆ clearance
Help done through Remote access ā„ | 1 808 |
| 14 | š¢ INFOSYS
Ā IBM,ACCENTURE,WALMART and any OA/Placements exam help available
100% clearance will be provided
Full exam help will be provided
To book slot contact @UrTrusty
Take remote access/mode help and pay after code pass | 687 |
| 15 |  No text... | 1 822 |
| 16 | #include <iostream>
#include <vector>
#include <numeric>
#define MOD 1000000007
using namespace std;
long long mod_inv(long long x, long long mod) {
Ā Ā Ā long long result = 1;
Ā Ā Ā long long power = mod - 2;
Ā Ā Ā while (power) {
Ā Ā Ā Ā Ā Ā Ā if (power % 2) {
Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā Ā result = result * x % mod;
Ā Ā Ā Ā Ā Ā Ā }
Ā Ā Ā Ā Ā Ā Ā x = x * x % mod;
Ā Ā Ā Ā Ā Ā Ā power /= 2;
Ā Ā Ā }
Ā Ā Ā return result;
}
vector<long long> factorial(int n, long long mod) {
Ā Ā Ā vector<long long> fact(n + 1, 1);
Ā Ā Ā for (int i = 2; i <= n; ++i) {
Ā Ā Ā Ā Ā Ā Ā fact[i] = fact[i - 1] * i % mod;
Ā Ā Ā }
Ā Ā Ā return fact;
}
long long binomial_coeff(int n, int k, const vector<long long>& fact, long long mod) {
Ā Ā Ā if (k > n || k < 0) {
Ā Ā Ā Ā Ā Ā Ā return 0;
Ā Ā Ā }
Ā Ā Ā return fact[n] * mod_inv(fact[k], mod) % mod * mod_inv(fact[n - k], mod) % mod;
}
long long count_ways(int N, int K, const vector<int>& A) {
Ā Ā Ā int sum_A = accumulate(A.begin(), A.end(), 0);
Ā Ā Ā int M = K - sum_A;
Ā Ā Ā vector<long long> fact = factorial(M + N - 1, MOD);
Ā Ā Ā return binomial_coeff(M + N - 1, N - 1, fact, MOD);
}
int main() {
Ā Ā Ā int N, K;
Ā Ā Ā cin >> N >> K;
Ā Ā Ā vector<int> A(N);
Ā Ā Ā for (int i = 0; i < N; ++i) {
Ā Ā Ā Ā Ā Ā Ā cin >> A[i];
Ā Ā Ā }
Ā Ā Ā cout << count_ways(N, K, A) << endl;
Ā Ā Ā return 0;
}
DISTURBUTING BOOKS ā
| 1 705 |
| 17 | š¢ INFOSYS
Ā IBM,ACCENTURE,WALMART and any OA/Placements exam help available
100% clearance will be provided
Full exam help will be provided
To book slot contact @UrTrusty | 928 |
| 18 |  +1Infosys
Permutation tree code ā
Tree LIS ā
Yet to subsequence ā
Strange Strings ā
Longest Beautiful Prefix ā
Cleared šÆ | 1 278 |
| 19 | https://www.linkedin.com/posts/prabhatnayak31_software-engineer-activity-7222528992656941056-2yCW | 1 603 |
| 20 | IBM
Front end developer
https://careers.ibm.com/job/20687087/front-end-developer-bangalore-in/?codes=SN_LinkedIn&Codes=SN_LinkedIn | 1 820 |
