int getMaxOccurrences(string components, int minLength, int maxLength, int maxUnique) {
    const int mod = 1e9 + 7;
    map<long, int> freq;
    vector<int> count(26, 0);
    int l = 0;
    int ans = 0;
    int noOfLetter = 0;
    long hash_curr = 0;
    long pow = 1;
   
    for (int i = 0; i < minLength - 1; i++) {
        pow = (pow * 53) % mod;
    }
   
    for (int r = 0; r < components.size(); r++) {
        count[components[r] - 'a']++;
        if (count[components[r] - 'a'] == 1) {
            noOfLetter++;
        }
        if ((r - l + 1) > minLength) {
            hash_curr = ((hash_curr - (components[l] - 'a' + 1) * pow) % mod + mod) % mod;
            count[components[l] - 'a']--;
            if (count[components[l] - 'a'] == 0) {
                noOfLetter--;
            }
            l++;
        }
        hash_curr = ((hash_curr * 53) % mod + (components[r] - 'a' + 1)) % mod;
        if ((noOfLetter <= maxUnique) && (r - l + 1) >= minLength && (r - l + 1) <= maxLength) {
            ans = max(ans, ++freq[hash_curr]);
        }
    }
    return ans;
}

Twillo ✅

Hiring Alerts for 3-6 months of Winter Internship Program'24!

Data & Business Analyst Intern
3-6 months internship with potential of PPO
Open positions: HR, Finance, Marketing, EA, BDA, Growth, Product, Interior Design, Product, SDE, Sales Analyst, Finance, BD, Graphic Design, Strategy, Sales and Growth.
Remote/Hybrid Work.
Immediate Joiner.
Competitive Compensation.

PS:CTC Starting from ₹4.6 LPA, We will start interview process by 15th of Oct'24

College/Institutions are most welcome for internship fair.

Note: Just comment, Intrested or Drop your CV at career@minimalix.in and one of the our HR team will get in touch with you soon (TAT: 3 Working Days) and don't share your contact number in comment section. Minimalix

For more details
+91 9500719621,
+91 9629311599

Email: dhanuja.g@applogiq.org

Software Engineer Internship 2025 (4 months) - India-based, Gurgaon office - Careers at Agoda
https://careersatagoda.com/job/6323041-software-engineer-internship-2025-4-months-india-based-gurgaon-office/

I am looking for a motivated Fresher to join in Bangalore. This role will involve providing HR support and managing coordination tasks within the HR department.

Role -  HR Apprentice 
Location -  Bangalore 
Start Date -  Immediate 
Qualification MBA in HR (Fresher) 
Preferred Candidate Female 
Essential Skills - Proficient in MS Excel, good communication, and coordination skills

Email resume - reetikaraj@fedfina.com

LinkedIn SDE Intern Opening that I shared a few weeks ago

Test 1 is already done, Have you given it ?


Test 2 is today, Have you got the link?

All the best ♥️

#include <bits/stdc++.h>

using namespace std;


/*
* Complete the 'countGoodSubsequences' function below.
*
* The function is expected to return an INTEGER.
* The function accepts STRING word as parameter.
*/
const int M = 1000000007;

    int add(int x, int y) {
        if ((x += y) >= M) {
            x -= M;
        }
        return x;
    }

    int mul(long long x, long long y) {
        return x * y % M;
    }

    int rev(int x) {
        int r = 1;
        for (int y = M - 2; y; y >>= 1) {
            if (y & 1) {
                r = mul(r, x);
            }
            x = mul(x, x);
        }
        return r;
    }

int countGoodSubsequences(string s) {
unordered_map<char, int> have;
        for (char c : s) {
            ++have[c];
        }
        const int n = s.length();
        vector<int> r(n + 1);
        for (int i = 1; i <= n; ++i) {
            r[i] = rev(i);
        }
        vector<int> dp(n + 1);
        int m = 0;
        for (const auto& p : have) {
            m = max(m, p.second);
            for (int i = 1, t = 1; i <= p.second; ++i) {
                t = mul(mul(t, p.second - i + 1), r[i]);
                dp[i] = add(mul(dp[i], t + 1), t);
            }
        }
        int ans = 0;
        for (int i = 1; i <= m; ++i) {
            ans = add(ans, dp[i]);
        }
        return ans;
}

LinkedIn ✅

#include <iostream>
#include <vector>
using namespace std;

const int MOD = 1e9 + 7;

long long comb3(long long n) {
    if (n < 3) return 0;
    return ((n * (n - 1) % MOD) * (n - 2) % MOD) / 6 % MOD;
}

int countEvenProductTriplets(const vector<int>& arr) {
    int n = arr.size();
    int odd_count = 0, even_count = 0;
    for (int num : arr) {
        if (num % 2 == 0) {
            even_count++;
        } else {
            odd_count++;
        }
    }

    long long total_triplets = comb3(n);
    long long odd_triplets = comb3(odd_count);

    long long result = (total_triplets - odd_triplets + MOD) % MOD;

    return (int)result;
}

LinkedIn ✅