๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.52K subscribers
5.56K photos
3 videos
95 files
9.7K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
#include <bits/stdc++.h>


using namespace std;

int main() {
    int T;
    cin >> T;
    while (T--) {
        int N;
        cin >> N;
        vector<long long> A(N);
        for (int i = 0; i < N; ++i) {
            cin >> A[i];
        }
        sort(A.begin(), A.end());
        long long sum = 0;
        int pairs = N / 2;
        for (int i = 0; i < pairs; ++i) {
            sum += A[N - 1 - i] - A[i];
        }
        cout << sum << endl;
    }
    return 0;
}

Maximum score
Google โœ…
#include <bits/stdc++.h>
using namespace std;

int main() {
    int N;
    cin >> N;
    vector<long long> a(N);
    for (int i = 0; i < N; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());
   
    vector<long long> prefix_sum(N + 1, 0);
    for (int i = 0; i < N; i++) {
        prefix_sum[i + 1] = prefix_sum[i] + a[i];
    }
   
    vector<long long> suffix_sum(N + 1, 0);
    for (int i = N - 1; i >= 0; i--) {
        suffix_sum[i] = suffix_sum[i + 1] + a[i];
    }
   
    vector<long long> sum_left(N + 1, 0);
    for (int k = 1; k <= N; k++) {
        int m = (k - 1) / 2;
        long long median = a[m];
        long long sum_prev = prefix_sum[m + 1];
        long long sum_next = prefix_sum[k] - sum_prev;
        sum_left[k] = median * (m + 1) - sum_prev + (sum_next - median * (k - (m + 1)));
    }
   
    vector<long long> sum_right(N + 1, 0);
    for (int m = 1; m <= N; m++) {
        int median_pos = (m - 1) / 2;
        int median_idx = (N - m) + median_pos;
        long long median = a[median_idx];
        long long sum_prev = suffix_sum[N - m] - suffix_sum[median_idx + 1];
        long long sum_next = suffix_sum[median_idx + 1];
        int left_count = median_idx - (N - m) + 1;
        int right_count = m - left_count;
        sum_right[m] = median * left_count - sum_prev + (sum_next - median * right_count);
    }
   
    long long ans = LLONG_MAX;
    for (int k = 1; k < N; k++) {
        ans = min(ans, sum_left[k] + sum_right[N - k]);
    }
   
    cout << ans << endl;
   
    return 0;
}
Work division โœ…
Google
Ubisoft Solutions is Hiring Data Analyst Fresher

Role : Data Analyst Fresher

Location: Pune/ Bangalore

Package:4.25 LPA

Write your Name and Email in the Comment Section
Shortlisting Applicant will receive the exam link by mail.

Send your Resume: hr_pooja07@ubi.com
โœจBNY Mellon is hiring Software Engineer Intern/Full Timeโœจ

๐—ฅ๐—ผ๐—น๐—ฒ -> Software Engineer Intern/Full Time
๐—˜๐˜…๐—ฝ๐—ฒ๐—ฐ๐˜๐—ฒ๐—ฑ ๐—ฃ๐—ฎ๐—ฐ๐—ธ๐—ฎ๐—ด๐—ฒ -> ~20-25LPA
๐—”๐—ฝ๐—ฝ๐—น๐—ถ๐—ฐ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐—Ÿ๐—ถ๐—ป๐—ธ: -> https://assessment.hackerearth.com/challenges/new/hiring/bny-mellon-code-divas-diversity-challenge-2025/