๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.58K subscribers
5.59K photos
3 videos
95 files
10.1K 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 <iostream>
#include <vector>

using namespace std;

long makePowerNondecreasing(vector<int>& power) {
    int n = power.size();
    long adjustments = 0;

    for (int i = 1; i < n; ++i) {
        if (power[i] < power[i - 1]) {
            adjustments += power[i - 1] - power[i];
        }
    }

    return adjustments;
}

Amazon โœ…
Hello Developers,
We are a startup from Kolkata, we are currently building a very innovative and exciting prototype in the gaming sector. Currently we need a developer with skills and knowledge in machine and deep learning and Artificial intelligence, like llm and nlp. The project is a paid project, and the developer MUST BE FROM KOLKATA, as we will need to guide and interact the person on site about the project.

The key roles will be -
. Understanding and building the required code and project.
. Being punctual and reporting any problems and following instructions.

If interested for this exciting opportunity please dm and send resume or you work to
+91 9330860396. You can also have a chance to work with us full time in future.

The project is contractual work and the pavkage is around โ‚น15k-20k
๐Ÿ‘2
#include <iostream>
#include <string>
#include <unordered_map>

using namespace std;

long getkRepValue(string user_history, long k) {
    long n = user_history.size();
    unordered_map<char, long> count;
    long left = 0, right = 0, ans = 0;

    while (right < n) {
        count[user_history[right]]++;
        while (count[user_history[right]] >= k && left <= right) {
            ans += n - right;
            count[user_history[left]]--;
            left++;
        }
        right++;
    }

    return ans;


Machine learning Amazon โœ…
int solve(vector<int> tc) {
    int n = tc.size();
    vector<int> p(n), s(n);

    p[0] = tc[0];
    for (int i = 1; i < n; ++i) {
        p[i] = p[i - 1] + tc[i];
    }

    s[n - 1] = tc[n - 1];
    for (int i = n - 2; i >= 0; --i) {
        s[i] = s[i + 1] + tc[i];
    }

    int m = max(p[0], s[0]);
    for (int i = 1; i < n; ++i) {
        m = max(m, max(p[i], s[i]));
    }

    return m;
}

Amazon โœ