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

12) 127/513

11)420 L

10) 5.156

9) 83.5

8) 1782.7

7) 300

✅Share✅Share✅Share ✅share✅ complete 2k😍 @Coding_000

6)49.33

5)9180

4) 11.25

3)y/(b-a)

2) BD

1)2^3*3*7^1

IBM --------😁😁 All IBM solutions will be uploaded there. Link: @Coding_000😁

✅Share✅Share✅Share ✅share✅ complete 2k😍 i will send solutions tcs 2pm slot @Coding_000

2nd code python

2ND code tcs python

#include <bits/stdc++.h> using namespace std; void countToMakeDiffEqual(int arr[], int n) {     int ma = 0;     unordered_map<int, int> m;     for (int i = 0; i < n; i++)     {         m[arr[i]]++;         ma = max(ma, m[arr[i]]);     }     if (n <= 2)         cout << 0 << endl;     else if (ma == 1)     {         cout << n - 2 << endl;     }     else         cout << n - ma << endl; } signed main() {     int n;     cin >> n;     int a[n];     for (int i = 0; i < n; i++)         cin >> a[i];     countToMakeDiffEqual(a, n);     return 0; } C++ @Coding_000