You can find referral code like this.

You won't find hacks like these anywhere

Company: HCL Tech
Role: Graduate Engineer Trainee
Expected CTC: NA
Batch Eligible: 2024
Website: https://forms.office.com/pages/responsepage.aspx?id=N-edGDrJWk-LaG9MqZQZErPoAgeZsXJKganDDSFGOYVUOExaNVM2WkI3UDhYTzhTOTRBNzQ4TDlTVi4u

Eagleview is hiring Platform Engineer Intern

For 2023, 2024, 2025 grads

https://careers-apac-eagleview.icims.com/jobs/2119/job


Surface Moto is hiring Fullstack Intern

For 2024, 2025, 2026 grads

https://surfacemoto.zohorecruit.in/jobs/Careers/57611000002015088/Full-Stack-Developer


Le Boat is hiring SDE

For 2024, 2023, 2022 grads

https://globalcareers.travelopia.com/job/545682

Yellow.ai is hiring for Software Engineering Interns in Bengaluru.

Batch : 2025/2026 passouts

Mail your CV/resume at niriksha.brar@yellow.ai

LimeChat is hiring Backend Engineer, Frontend Engineer, AI/ML Engineer, SDE Intern

For 2024, 2023, 2022, 2021 grads

https://www.linkedin.com/posts/nikhilgupta1997_hiring-engineering-ai-activity-7212310740114817024-lrDc

sploot is hiring MERN Stack Intern

For 2024, 2025 grads

Stipend - 10K pm

Startup founded by IIM A alumni!

Apply - https://www.linkedin.com/posts/garimakaushal_woof-were-looking-for-a-mern-stack-intern-activity-7212099818603626496-xHW5

import sys
sys.setrecursionlimit(10**6)

def countVerticalPaths(costs, edge_nodes, from_lst, to_lst, k):
    children = [[] for _ in range(edge_nodes)]

    for u, v in zip(from_lst, to_lst):
        u -= 1
        v -= 1
        children[u].append(v)
        children[v].append(u)

    prefixes = [0] * k
    prefixes[0] = 1

    def g(n, s, p, result):
        curr = (s + costs[n]) % k
        result[0] += prefixes[curr]
        prefixes[curr] += 1

        for c in children[n]:
            if c != p:
                g(c, curr, n, result)

        prefixes[curr] -= 1

    result = [0]
    g(0, 0, -1, result)

    return result[0]

DTCC HackTree ✅

#include <vector>
using namespace std;

long long countSetBits(int number) {
    long long bitMask = 1, setBitsCount = 0;
    for (int bitPosition = 0; bitPosition < 32; bitPosition++) {
        long long quotient = number / (bitMask << (bitPosition + 1));
        long long remainder = number % (bitMask << (bitPosition + 1)) - (bitMask << bitPosition);
        setBitsCount += quotient * (bitMask << bitPosition);
        if (remainder > 0) setBitsCount += remainder;
        if (1 & (number >> bitPosition)) setBitsCount++;
    }
    return setBitsCount;
}

int solve(int targetCount) {
    if (targetCount == 0) return 1;
    int low = 1, high = 1e9 + 1;
    while (low < high) {
        int mid = (low + high) / 2;
        long long currentCount = countSetBits(mid);
        if (currentCount >= targetCount + 1) {
            high = mid;
        } else {
            low = mid + 1;
        }
    }
    return low;
}

vector<int> getValueAtIndices(const vector<int>& queries) {
    vector<int> results;
    for (int query : queries) {
        int result = solve(query);
        results.push_back(result);
    }
    return results;
}

DTCC female pass credits ✅

MERN stack intern (backend focus: NodeJS) to join us for 3 months starting 15th July.

- prior experience building projects on NodeJS
- Work from office in Gurgaon
- Rs. 10K monthly stipend

If this is you, please reach out to me at garima@sploot.tech

Company Name : Innovacer
Batch : 2023/2022 passouts
Role : Data Analyst

Skillset : majorly good at SQL

Link : https://boards.greenhouse.io/innovaccer/jobs/7269176002

Company: edtechcube
Location: N/A
Role: Frontend Developer
For Graduates: 2023, 2024

https://www.linkedin.com/posts/mohit-kumar-mahato-2b7423269_hiring-techjobs-frontenddeveloper-activity-7212328435078111232-5Y3J?utm_source=share&utm_medium=member_desktop