๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.52K subscribers
5.56K photos
3 videos
95 files
9.68K 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 n;
    cin >> n;
    vector<int> a(n);
    for(int i=0; i<n; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());
    int ans = 0, count = 1;
    for(int i=1; i<n; i++) {
        if(a[i] > a[i-1]) {
            ans += count;
            count = 1;
        } else {
            count++;
        }
    }
    cout << ans << endl;
    return 0;
}
int findIdleServer(string s, int k) {
    int i = 0, n = s.length();
    for (int j = 0; j < n; ++j, ++i) {
        s[i] = s[j];
        if (i > 0 && s[i - 1] == s[i])
            i -= 2;
    }
    return s.substr(0, i);
Finoability is looking forward to collaborate with the Placement Cells of Under-graduate & Post-graduate colleges across the country to recruit for the Summer Internship Programme 2024 in the field of Finance & Marketing.

Interested colleges are requested to kindly get in touch with us at hr@finoability.com
๐ŸšจJOB OPENING UPDATE๐Ÿšจ

Company โ€“ Tree Top Staffing LLC
Role โ€“ Data Analyst
Exp. โ€“ Fresher
Apply Here โ€“ https://www.linkedin.com/jobs/view/3800053561

Company โ€“ MachineHack Generative AI
Role โ€“ Generative AI Engineer
Exp. โ€“ Fresher
Apply Here โ€“ https://www.linkedin.com/jobs/view/3801085938

Company โ€“ Hexaware Technologies
Role โ€“ Analytics Data science and IOT Engineer
Exp. โ€“ Fresher
Apply Here โ€“ https://www.linkedin.com/jobs/view/3800858321

Company โ€“ Altrata India Private Ltd
Role โ€“ Data Engineer
Exp. โ€“ 0-2 yr
Apply Here โ€“ https://www.naukri.com/job-listings-data-engineer-altrata-india-private-ltd-chennai-tamil-nadu-0-to-2-years-070124001912?src=sortby&sid=1704692157253739_1&xp=5&px=1&nignbevent_src=jobsearchDeskGNB

Company โ€“ SAZ India
Role โ€“ Data Analytics Intern
Exp. โ€“ Fresher
Apply Here โ€“ https://www.linkedin.com/jobs/view/3800760641

Company โ€“ Radio City
Role โ€“ Data Analytics intern
Exp. โ€“ Fresher
Apply Here โ€“ https://internshala.com/internship/detail/data-analytics-internship-in-mumbai-at-radio-city1704438545

Company โ€“ AIqwip
Role โ€“ Data Science intern
Exp. โ€“ Fresher
Apply Here โ€“ https://internshala.com/internship/detail/data-science-internship-in-bangalore-at-aiqwip1704547841

Company โ€“ Across The Globe (ATG)
Role โ€“ Deep Learning
Exp. โ€“ Fresher
Apply Here โ€“ https://internshala.com/internship/detail/deep-learning-work-from-home-job-internship-at-across-the-globe-atg1703825932

Company โ€“ Blackcoffer
Role โ€“ Data Science
Exp. โ€“ Fresher
Apply Here โ€“ https://internshala.com/internship/detail/data-science-work-from-home-job-internship-at-blackcoffer1704450041

ALL THE BEST๐Ÿ’™
SELECT
    YEAR(o.order_date) AS year,
    MONTH(o.order_date) AS month,
    SUM(oi.quantity * oi.price) AS total_revenue
FROM
    orders o
JOIN
    order_items oi ON o.order_id = oi.order_id
GROUP BY
    YEAR(o.order_date),
    MONTH(o.order_date)
ORDER BY
    YEAR(o.order_date),
    MONTH(o.order_date);

SQL โœ…
def count_numbers_in_range(L, R, n, arr):
    count = 0

    for num in arr:
        if L <= num <= R:
            count += 1

    return count

L = int(input())
R = int(input())
n = int(input())
arr = [int(input()) for _ in range(n)]

result = count_numbers_in_range(L, R, n, arr)
print(result)
#include<bits/stdc++.h>
using namespace std;

vector<int> rankSongs(vector<vector<int>> pref) {
    int n = pref.size();
    int m = pref[0].size();

    vector<vector<int>> b(m, vector<int>(m, 0));
    vector<int> w(m, 0), r(m);
    iota(r.begin(), r.end(), 0);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            for (int k = j + 1; k < m; k++) {
                b[pref[i][j]][pref[i][k]]++;
            }
        }
    }

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < m; j++) {
            if (i != j && (b[i][j] > b[j][i] || (b[i][j] == b[j][i] && i < j))) {
                w[i]++;
            }
        }
    }

    sort(r.begin(), r.end(), [&](int i, int j) {
        return w[i] > w[j] || (w[i] == w[j] && i < j);
    });

    return r;
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> p(n, vector<int>(m));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> p[i][j];
        }
    }
    vector<int> r = rankSongs(p);
    for (int i = 0; i < m; i++) {
        cout << r[i] << endl;
    }
    cout << endl;
    return 0;
}

Songs Popularity Code
PayPal โœ