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
Posts Archive
+2
š¢ NAMMA YATRI done successfully ā¤
All codes Done Successfully ā
šÆ Clearance Guarantee ā
Contact @UrTrusty
Help done through Remote access ā„
18 Nov 2024, 09:36
š¢ 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
19 Oct 2024, 06:44
+5
š¢ COGNIZANT EXAM done successfully ā¤
Both Code + Both Sql + Frond-End Code Done Successfully ā
šÆ Clearance Guarantee ā
Contact @UrTrusty
Help done through Remote access ā„
19 Oct 2024, 06:43
+4
š¢ COGNIZANT EXAM done successfully ā¤
Both Code + Both Sql + Frond-End Code Done Successfully ā
šÆ Clearance Guarantee ā
Contact @UrTrusty
Help done through Remote access ā„
02 Oct 2024, 11:09
+1
š¢ IBM EXAM done successfully ā¤
Contact @UrTrusty
šÆ clearance
Help done through Remote access ā„
29 Sep 2024, 11:46
š¢ 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
22 Sep 2024, 20:43
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
08 Sep 2024, 08:54
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
08 Sep 2024, 08:54
08 Sep 2024, ~08:54
+2
š¢ DELOITTE EXAM done successfully ā¤
Contact @UrTrusty
šÆ clearance
Help done through Remote access ā„
08 Sep 2024, 08:50
šØ 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
08 Sep 2024, 04:46
22 Sep 2024, ~20:43
š¢ 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
26 Aug 2024, 21:44
22 Sep 2024, ~20:43
š¢ 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
24 Aug 2024, 00:31
26 Aug 2024, ~21:43
+4
š¢ BROWSERSTACK EXAM done successfully ā¤
Contact @UrTrusty
šÆ clearance
Help done through Remote access ā„
16 Aug 2024, 07:27
š¢ 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
15 Aug 2024, 00:40
24 Aug 2024, ~00:31
#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 ā
04 Aug 2024, 02:59
š¢ 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
03 Aug 2024, 07:46
15 Aug 2024, ~00:40
Repost from IBM | AMAZON | ACCENTURE OA Exams SOLUTIONS
+1
Infosys
Permutation tree code ā
Tree LIS ā
Yet to subsequence ā
Strange Strings ā
Longest Beautiful Prefix ā
Cleared šÆ
03 Aug 2024, 07:46
22 Jul 2024, 21:23
