๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.52K subscribers
5.56K photos
3 videos
95 files
9.72K 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
Cyber Security Internship Opportunity

Location: IIT Kanpur

Position Type: Virtual

Duration: 1 Month

Skills Knowledge: Cybersecurity + Python + GenAI

Learnings:
1. Research on Cybersecurity Threats and Trends
2. Building Projects on Cybersecurity and AI
3. Learning basics to advanced skills in Python

Kindly submit the form: https://lnkd.in/gaCcGTVM

NOTE: Few Interns will be selected at IIT Kanpur for full-time internship with Cyber3ra
int main() {
    int n, x;
    cin >> n >> x;
    vector<int> c(n);
    for(int i = 0; i < n; i++) {
        cin >> c[i];
    }

    int m = 0, s = 0, i = 0;
    for(int e = 0; e < n; e++) {
        s += c[e];
        while(s > x) {
            s -= c[i++];
        }
        m = max(m, e - i + 1);
    }

    cout << m << endl;
    return 0;
}

Mercedes โœ…
def maximize_profit(prices):
    if len(prices) < 2:
        return "Not Possible" 
    min_price = prices[0]
    max_profit = 0
    for price in prices[1:]:
        max_profit = max(max_profit, price - min_price)
        min_price = min(min_price, price)
    if max_profit > 0:
        return "Possible\n{}".format(max_profit)
    else:
        return "Not Possible"
n = int(input())
prices = list(map(int, input().split()))
print(maximize_profit(prices))

Maximize Profit โœ…
# include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main(){
    ll n; cin>>n;
    vector<ll>a(n);
    for(ll i=0;i<n;i++) cin>>a[i];
    ll x=0;
    for(ll i=0;i<n;i++) x^=a[i];
    ll ans=LONG_MAX;
    for(ll i=0;i<n;i++)  ans=min(ans,x^a[i]);
    cout<<ans<<endl;
    return 0;
}

Minimum Xor โœ…
int minimumMagic(int n, int m, vector<int> &p, vector<int> &mp) {
        vector<int> v(n);
        int sum_ = 0;
        for (int i = 0; i < n; ++i) {
            v[i] = p[i] - mp[i];
            sum_ += p[i];
        }
        sort(v.begin(), v.end(), greater<int>());
        if (sum_ <= m) {
            return 0;
        }
        for (int i = 0; i < n; ++i) {
            sum_ -= v[i];
            if (sum_ <= m) {
                return i + 1;
            }
        }
        return 0;
    }

Hiring Drive โœ…
Company โ€“ Unified Mentor Private Limited
Role โ€“ data analyst intern
Exp. โ€“ Fresher
Apply Here โ€“ https://www.linkedin.com/jobs/view/3907324906

Company โ€“ Acencore Technologies
Role โ€“ AI & ML Internship
Exp. โ€“ Fresher
Apply Here โ€“ https://internshala.com/internship/details/work-from-home-ai-ml-internship-at-acencore-technologies1713779302?utm_source=cp_link&referral=web_share

Company โ€“ INI8 Labs Private Limited
Role โ€“ Data Engineering Internship
Exp. โ€“ Fresher
Apply Here โ€“ https://internshala.com/internship/details/data-engineering-internship-in-bangalore-at-ini8-labs-private-limited1713853327?utm_source=cp_link&referral=web_share