Company Name : Amazon
Challenge Name : Amazon Sambhav Hackathon

Eligibility : First Year to Final Year + Working Professionals

Trip to Amazon Seattle Office + Prize Money worth 10 Lakh rupees.

Link to register : https://bit.ly/AmazonSambhavHack244

Company Name: HPE
Role: Graduate Software Engineer
Batch eligible: 2024 grads

Apply: https://careers.hpe.com/us/en/job/1180176/Graduate-Software-Engineer

Company Name: Qualcomm
Role: Software Engineer - Associate
Batch eligible: 2023 and 2024 grads

Apply: https://careers.qualcomm.com/careers/job/446702219353

void solve() {
ll n,k;cin>>n>>k;
v ans(n,0),temp;
v a(n+1,1);
ll maxi=n+1,mini=0;
fr(0,n-k,i){
    if(ans[i])continue;
    if(i&1){
      ans[i]=--maxi,a[maxi]=0;
      ans[i+k]=--maxi,a[maxi]=0;
    }
    else {
      ans[i]=++mini,a[mini]=0;
      ans[i+k]=++mini,a[mini]=0;
    }
}
fr(1,n+1,i)if(a[i])temp.push_back(i);
ll sz=temp.size(),j=0;
fr(0,n,i){
    if(!ans[i])ans[i]=temp[j++];
}
fr(0,n,i)dbg(ans[i]);


}

Rotate or Reverse ✅

Hi Guys,

Use this ChatGPT prompt and apply in the suggested openings specifically, Could be a game changer.

Context: You are a job-seeker looking for a [ROLE] in the [INDUSTRY]. You are focusing on roles where you meet at least 80% of the listed qualifications in India.

Task: Based on the attached resume (PDF), provide a list of job roles and companies that align with my qualifications. For each recommendation, include the estimated percentage chance of securing an interview based on how closely my experience matches the job requirements.

📌LG Soft India (R&D) Hiring Java/Android Developer

Freshers - 0-1 Year Experience

Education : BE/B.Tech /MTech- CS/IT/ECE/EEE

How to Apply:
Send your resume to vijayalaxmi.halkarni@lgepartner.com

Email: govehr@gove.co

Contact: 91 7092003838

Email: jobs@zluck.com

Contact: 9726250544

SUBMIT YOUR RESUME TO
hr@atts.in

7826816006

import sys
from collections import deque
mod = 998244353
def main():
    n, k = map(int, sys.stdin.readline().split())
    g = [[] for _ in range(n + 1)]
    
    for _ in range(n - 1):
        u, v = map(int, sys.stdin.readline().split())
        g[u].append(v)
        g[v].append(u)
    
    ans = 0
    
    for c in range(1, n + 1):
        q = deque()
        q.append(c)
        d = [-1] * (n + 1)
        d[c] = 0
        parent = [-1] * (n + 1)
        
        while q:
            u = q.popleft()
            for v in g[u]:
                if d[v] == -1:
                    d[v] = d[u] + 1
                    parent[v] = u
                    q.append(v)
        
        children = {}
        for u in range(1, n + 1):
            if u == c or d[u] == -1:
                continue
            p = u
            while parent[p] != c and parent[p] != -1:
                p = parent[p]
            if parent[p] == c:
                children.setdefault(p, []).append(u)
        
        max_d = max(d)
        
        for l in range(1, max_d + 1):
            cnt = []
            for child, nodes in children.items():
                cnt_i = 0
                for u in nodes:
                    if d[u] == l:
                        cnt_i += 1
                if cnt_i > 0:
                    cnt.append(cnt_i)
            m = len(cnt)
            if m < k:
                continue
            
            dp = [0] * (k + 1)
            dp[0] = 1
            
            for c_i in cnt:
                for x in range(min(k, len(cnt)), 0, -1):
                    dp[x] = (dp[x] + dp[x - 1] * c_i) % mod
            
            ans = (ans + dp[k]) % mod
    
    print(ans)

if __name__ == "__main__":
    main()

Newtree
Rubrik ✅

import sys
MOD=998244353

def mult(a, b, K):
    res = [0] * K
    for i in range(K):
        ai = a[i]
        if ai:
            for j in range(K):
                res[(i + j) % K] = (res[(i + j) % K] + ai * b[j]) % MOD
    return res

def power(a, e, K):
    res = [0] * K
    res[0] = 1
    while e:
        if e & 1:
            res = mult(res, a, K)
        a = mult(a, a, K)
        e >>= 1
    return res

def main():
    input = sys.stdin.read
    data = list(map(int, input().split()))
    
    ptr = 0
    N = data[ptr]
    P = data[ptr + 1]
    K = data[ptr + 2]
    ptr += 3
    
    M = data[ptr]
    ptr += 1
    
    L = data[ptr:ptr + M]
    ptr += M
    
    C = [P // K + (1 if j > 0 and j <= P % K else 0) for j in range(K)]
    LC = [0] * K
    
    for x in L:
        LC[x % K] += 1
    
    Cn = [(C[j] - LC[j]) % MOD for j in range(K)]
    
    T = power(C, N, K)[0]
    B = power(Cn, N, K)[0]
    
    print((T - B) % MOD)

main()

Lucky Charm
Rubrik ✅

Company Name: McAfee
Batch eligible: 2025 and 2026 grads

1) Software Engineering Intern
Apply: https://careers.mcafee.com/global/en/job/MCAFGLOBALJR0031354ENGLOBALEXTERNAL/Software-Engineering-Intern

2) Graduate Technical Intern
Apply: https://careers.mcafee.com/global/en/job/JR0031351/Graduate-Technical-Intern

3) Graduate Technical Intern
Apply: https://careers.mcafee.com/global/en/job/JR0031352/Graduate-Technical-Intern

Drona Pay is hiring for Data Engineering - Intern  (Remote)

Experience : 0 - 1 year's
Expected Stipend : 5-6 LPA

Apply here : https://wellfound.com/jobs/3129311-data-engineering-intern

Meesho is hiring Senior Business Associate

MBA grads ( Tier l )
2023/2024 passouts

Apply Here : https://forms.gle/X6XwQ7sUq8eKeeCL8

Mokkup.ai is hiring Product Manager

For 2022, 2023, 2024 grads
Location: Remote
https://www.linkedin.com/jobs/view/4036407648

MindTickle is hiring Front-end Engineer

For 2021, 2022, 2023 grads
Location: Bangalore

https://jobs.lever.co/mindtickle/011afcfc-09da-48f6-8acc-d49a13791327/apply?source=LinkedIn