#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int INF = 99;
const int MAXN = 20;
int dist[MAXN][MAXN];
int next_node[MAXN][MAXN];
int path_count[MAXN][MAXN][MAXN];

void solve(int n) {
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i != j && dist[i][j] != INF) {
                for (int k = 0; k < n; k++) {
                    if (dist[i][k] + dist[k][j] == dist[i][j]) {
                        path_count[i][j][k]++;
                    }
                }
            }
        }
    }

    vector<int> v;
    for (int k = 0; k < n; k++) {
        int count = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (i != j && i != k && j != k) {
                    count += path_count[i][j][k];
                }
            }
        }
        if (count > 0) {
            v.push_back(k);
        }
    }

    sort(v.begin(), v.end());
    for (int node : v) {
        cout << node << endl;
    }
}

int main() {
    int n;
    cin >> n >> n;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> dist[i][j];
            if (dist[i][j] == INF) {
                next_node[i][j] = -1;
            } else {
                next_node[i][j] = j;
            }
        }
    }

    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (dist[i][k] + dist[k][j] < dist[i][j]) {
                    dist[i][j] = dist[i][k] + dist[k][j];
                    next_node[i][j] = next_node[i][k];
                }
            }
        }
    }

    solve(n);

    return 0;
}

int solve(int n, vector<int>& arr) {
    while (arr.size() > 1) {
        int len = INT_MAX;
        int idx = -1;
        for (int i = 0; i < arr.size() - 1; ++i) {
            int d = arr[i + 1];
            if (d == 0 || arr[i] == 0) {
                continue;
            }
            int r = min(arr[i] % d, d % arr[i]);
            if (r < len) {
                len = r;
                idx = i;
            }
        }
        if (idx == -1) {
            break;
        }
        int d = arr[idx + 1];
        if (d != 0) {
            arr[idx] = min(arr[idx] % d, d % arr[idx]);
        }
        arr.erase(arr.begin() + idx + 1);
    }
    return arr.size();
}

Women Day Mathematics Challenge ✅

#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);

UPDATE:
Read the Job Description and Apply only if eligible.

Since it's a remote startup, It's okay if you have less work experience but amazing portfolio.
https://forms.gle/7WyVfmNptZoY8Vhv9

int digitSum(int n) {
    int s = 0;

    while (n > 0) {
        s += n % 10;
        n = n / 10;
    }

    return s;
}

Company Name: Mercedes-Benz

Role: Intern

Batch eligible: 2024 and 2025 passouts

Apply: https://jobs.mercedes-benz.com/en/intern-2023-51169-MER0002CBX

Company Name: Shadowfax

Role: Data Analytics Intern

Batch eligible: 2022, 2023 and 2024 passouts

Apply: https://docs.google.com/forms/d/e/1FAIpQLSem-oto0r0I4mATq2s1mpjsvSaqOD0IS5VZrM2nVVFe8V4COA/viewform

Company Name: Guidewire

Role: Software Engineer

Batch eligible: 2024 and 2025 passouts

Apply: https://jobs.lever.co/guidewire/e3d3df57-f9fb-4e5d-8aea-3692f5a72028

Did you get the test link for Google Apprenticeships?

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

Company Name: Meesho

Role: SDE Intern

Batch eligible: 2023 and 2024 passouts

Apply: https://www.meesho.io/jobs/open-recruitment

🚨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 ✅