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

def calc_valency(element):     return sum(map(int, str(sum(map(int, map(str, map(ord, element))))))) % 9 or 9 def balance_compound(compound, eq_point):     elem1, elem2 = compound[0], compound[1]     val1, val2 = calc_valency(elem1), calc_valency(elem2)     results = []     for mult1 in range(1, eq_point // val1 + 1):         rem_point = eq_point - mult1 * val1         if rem_point % val2 == 0:             mult2 = rem_point // val2             results.append(f"{elem1}{mult1} {elem2}{mult2}")     for i in range(len(results) - 2, -1, -1):         print(results[i])     if not results:         print("Not Possible") compound_input = input().strip() equivalent_point_input = int(input().strip()) balance_compound(compound_input, equivalent_point_input) Compound ✅ Codevita python3 Share @coding_000😊

Bubble Code Tcs CodeVita Share @coding_000❤️ #include <stdio.h> int count_desc=0,count_asc=0; void bubbleSort_descend(int array[], int size) {   for (int step = 0; step < size - 1; ++step) {     for (int i = 0; i < size - step - 1; ++i) {       if (array[i] < array[i + 1]) {         int temp = array[i];         array[i] = array[i + 1];         array[i + 1] = temp;         count_desc++;       }     }   } } void bubbleSort_ascend(int array[], int size) {   for (int step = 0; step < size - 1; ++step) {     for (int i = 0; i < size - step - 1; ++i) {       if (array[i] > array[i + 1]) {         int temp = array[i];         array[i] = array[i + 1];         array[i + 1] = temp;         count_asc++;       }     }   } } int main() {     int size;     scanf("%d",&size);     int data[size],data1[size];     for(int i=0;i<size;i++){         scanf("%d",&data[i]);         data1[i]=data[i];     }   bubbleSort_descend(data, size);   bubbleSort_ascend(data1, size);   if(count_desc>count_asc)   printf("%d",count_asc);   else   printf("%d",count_desc); }

Zero Count Tcs codevita #include <iostream> using namespace std; int Coding_000(int L, int K) {     if (K == 0) {         return L;     }     if (K == L) {         return 0;     }     int maxZeros = 0;     if (K > 0) {         maxZeros = 1;     }     return maxZeros; } int main() {     int L, K;     cin >> L >> K;     int result = Coding_000(L, K);     cout << result << endl;     return 0; }

StringfromRank Tcs Codevita def generate_string_from_rank(rank, length):     result = []     alphabets = [chr(ord('a') + i) for i in range(26)]     rank -= 1     for i in range(length):         index = rank % 26         result.append(alphabets[index])         rank //= 26     result.reverse()     return ''.join(result) # Input rank = int(input()) length = int(input()) # Output result_string = generate_string_from_rank(rank, length) print(result_string)

Super Market tcs codevita def max_bag_sold(n, m, customers, rice_bags):     customers.sort(reverse=True)     rice_bags.sort(reverse=True)         b_sold = 0     b_index = 0         for customer in customers:         while b_index < m and rice_bags[b_index][1] > customer[1]:             b_index += 1                 if b_index < m and rice_bags[b_index][0] >= customer[0]:             b_sold += 1             b_index += 1     return b_sold n, m = map(int, input().split()) customers = [tuple(map(int, input().split())) for _ in range(n)] rice_bags = [tuple(map(int, input().split())) for _ in range(m)] result = max_bag_sold(n, m, customers, rice_bags) print(result)

Binary String #include <iostream> using namespace std; int main() {     int l, k;     cin >> l >> k;     int max_zeros = 0;     int current_zeros = 0;     for (int i = 0; i < l; i++) {     if (B[i] == '1') {         max_zeros = max(max_zeros, current_zeros);         current_zeros = 0;     } else {         current_zeros++;     }     }     max_zeros = max(max_zeros, current_zeros);     cout << max_zeros << endl;     return 0; } Binary String C++ TCS Codevita

Good String def main():     s = input()     n = len(s)     s1 = input()     n1 = len(s1)         ascii = [ord(char) for char in s]     ascii1 = [ord(char) for char in s1]         nearest_values = []         for i in range(n1):         min_diff = float('inf')         nearest_value = -1         for j in range(n):             diff = abs(ascii1[i] - ascii[j])             if diff < min_diff:                 min_diff = diff                 nearest_value = ascii[j]         nearest_values.append(nearest_value)         count = sum(abs(ascii1[i] - nearest_values[i]) for i in range(n1))     print(count) if name == "main":     main()

def max_zeros(L, K):     if K == 0:         return L     zeros = L - K     max_length = zeros // (K + 1)     remaining = zeros % (K + 1)     if remaining > 0:         max_length += 1     return max_length L, K = map(int, input().split()) print(max_zeros(L, K),end="") Zero Count ✅ Python3

Super market Code C++ TCS Codevita #include <iostream> #include <vector> #include <algorithm> using namespace std; int placementlelo(int n, int m, vector<pair<int, int>>& dealer, vector<pair<int, int>>& x) {     sort(dealer.rbegin(), dealer.rend());     sort(x.rbegin(), x.rend());     int b = 0;     int i = 0;     for (const auto& c : dealer) {         while (i < m && x[i].second > c.second) {             i++;         }         if (i < m && x[i].first >= c.first) {             b++;             i++;         }     }     return b; } int main() {     int n, m;     cin >> n >> m;     vector<pair<int, int>> dealer(n);     for (int i = 0; i < n; i++) {         cin >> dealer[i].first >> dealer[i].second;     }     vector<pair<int, int>> x(m);     for (int i = 0; i < m; i++) {         cin >> x[i].first >> x[i].second;     }     int ans = placementlelo(n, m, dealer, x);     cout << ans << endl;     return 0; } Super market Code C++ TCS Codevita

Conflict Code C++ TCS Codevita #include <iostream> #include <vector> #include <unordered_set> using namespace std; void backtrack(int current_expertise, vector<int>& current_team, unordered_set<int>& visited, int& placementlelo, const vector<vector<int>>& graph, const vector<int>& expertise) {     bool is_conflict_free = true;     for (size_t i = 0; i < current_team.size() - 1; ++i) {         for (size_t j = i + 1; j < current_team.size(); ++j) {             if (find(graph[current_team[i]].begin(), graph[current_team[i]].end(), current_team[j]) != graph[current_team[i]].end()) {                 is_conflict_free = false;                 break;             }         }     }     if (is_conflict_free) {         placementlelo = max(placementlelo, current_expertise);         for (int i = 1; i < graph.size(); ++i) {             if (visited.find(i) == visited.end() && find(current_team.begin(), current_team.end(), i) == current_team.end()) {                 current_team.push_back(i);                 visited.insert(i);                 backtrack(current_expertise + expertise[i - 1], current_team, visited, placementlelo, graph, expertise);                 current_team.pop_back();                 visited.erase(i);             }         }     } } int solve(int n, int c, const vector<vector<int>>& conflicts, const vector<int>& expertise) {     vector<vector<int>> graph(n + 1);     for (const auto& conflict : conflicts) {         int u = conflict[0], v = conflict[1];         graph[u].push_back(v);         graph[v].push_back(u);     }     int placementlelo = 0;     vector<int> current_team;     unordered_set<int> visited;     backtrack(0, current_team, visited, placementlelo, graph, expertise);     return placementlelo; } int main() {     int n, c;     cin >> n >> c;     vector<vector<int>> conflicts;     for (int i = 0; i < c; ++i) {         int u, v;         cin >> u >> v;         conflicts.push_back({u, v});     }     vector<int> expertise(n);     for (int i = 0; i < n; ++i) {         cin >> expertise[i];     }     int placementlelo = solve(n, c, conflicts, expertise);     cout << placementlelo << endl;     return 0; } Conflict Code C++ TCS Codevita

TECH Mahindra Exam Round 2 Help available.👨‍💻 100% Clearance GUARANTEE.✅ Check our past Results. 👇👇 https://t.me/Coding_000/5567?single https://t.me/Coding_000/5563?single Contact @ILOVEU_143 ✅

Dm @ILOVEU_143✅ For Coding Help or Any Exam Help 😄 💯 Clearance ✅

IBM EXAM ON 27 PLEASE CHECK IT Share @coding_000

Those who wants IBM Help Free join and share my channel ✅ Share 😍😊✅ Don't pay to anyone 😊 we will post all solutions 😊 @Coding_000❤️ @Coding_000 share ✅  share ✅ share✅ our channel 😊 CONTACT- @ILOVEU_143 ❤️ Show some love and support guys😁

Those who wants IBM Help Free join and share my channel ✅ Share 😍😊✅ Don't pay to anyone 😊 we will post all solutions 😊 @Coding_000❤️ @Coding_000 share ✅  share ✅ share✅ our channel 😊 CONTACT- @ILOVEU_143 ❤️ Show some love and support guys😁😁😊👍👍

Tech Mahindra Round-2 Qualified 😊✅🥳🥳 💯% Clearance Guarantee ✅ Dm @ILOVEU_143                  For Any Exam Help 😁✌️

Accenture Exam Cleared Successfully ✅ Candidate Got interview Mail 🥳😍 Contact @ILOVEU_143👨‍💻 Share @coding_000❤️

Tech Mahindra Round-2 Qualified 😊✅🥳🥳 💯% Clearance Guarantee ✅ Dm @ILOVEU_143                  For Any Exam Help 😁✌️

TECH Mahindra Exam Round 2 Help available.👨‍💻 100% Clearance GUARANTEE.✅ Check our past Results. 👇👇 https://t.me/Coding_000/5567?single https://t.me/Coding_000/5563?single Contact @ILOVEU_143 ✅