Alter Domus Hiring

Role: Quality Engineer

Location: Hyderabad

Batch: 2022/2023 Pass outs

Experience: Freshers

Qualification: BE/B.Tech (CSE/IT)

https://careers.alterdomus.com/en/job/-/-/1298/4058526528

𝐂𝐨𝐦𝐩𝐚𝐧𝐲 𝐍𝐚𝐦𝐞: Byte Brilliance

𝐑𝐨𝐥𝐞: Backend Developer

𝐁𝐚𝐭𝐜𝐡 𝐞𝐥𝐢𝐠𝐢𝐛𝐥𝐞: 2023 and 2024 grads.

𝐀𝐩𝐩𝐥𝐲: https://cuvette.tech/app/public/internship/6493bd4b326c0c1e328dd028?referralCode=Z21QGT

𝐂𝐨𝐦𝐩𝐚𝐧𝐲 𝐍𝐚𝐦𝐞: Innofield

𝐑𝐨𝐥𝐞: Software Engineer

𝐁𝐚𝐭𝐜𝐡 𝐞𝐥𝐢𝐠𝐢𝐛𝐥𝐞: 2022 and 2023 grads

https://innofied.zohorecruit.in/jobs/Careers/31467000056712017/Freshers-Hiring---Software-Engineer?source=CareerSite

Company Name: PureSoftware

Role: Intern

Batch eligible: 2023 and 2024 grads.

Apply: https://www.linkedin.com/jobs/view/3641714485

CQLsys Technologies is providing training for freshers for the following profiles:-

1) 𝐌𝐚𝐧𝐮𝐚𝐥 𝐓𝐞𝐬𝐭𝐞𝐫 (𝐐𝐀)

2) 𝐈𝐎𝐒 𝐃𝐞𝐯𝐞𝐥𝐨𝐩𝐦𝐞𝐧𝐭

𝐐𝐮𝐚𝐥𝐢𝐟𝐢𝐜𝐚𝐭𝐢𝐨𝐧 𝐑𝐞𝐪𝐮𝐢𝐫𝐞𝐝:- BCA / MCA/ BE/ B.Tech (CS)

𝐂𝐨𝐦𝐩𝐚𝐧𝐲: CQLsys Technologies (IT)

𝐖𝐨𝐫𝐤𝐢𝐧𝐠 𝐝𝐚𝐲𝐬: 5 days

𝐇𝐨𝐮𝐫𝐬 𝐨𝐟 𝐰𝐨𝐫𝐤: 8 hours (Work from office)

𝐋𝐨𝐜𝐚𝐭𝐢𝐨𝐧: F-267, Mohali Phase 8B, Sector 74 Interested candidates can share their cv at- recruiter@cqlsys.co.uk

Company Name: CloudSEK

Role: SDE 1 / 2

Batch eligible: 2022 and previous grads.

Apply: https://boards.greenhouse.io/cloudsek/jobs/4873360004?gh_src=36aa409c4us

Internship Hiring

Round - 1 : General intro and skill set discussion

-Round - 2 : Real time problem and delivering a solution (assignment)

-Round - 3 : Review (selection)

https://docs.google.com/forms/d/1-oCqvlpCPt9TTKmwL08rs7-z-LQDHEG6yBPV-FKYcQU/viewform?pli=1&pli=1&edit_requested=true

Company Name: Salesforce

Role: Software Engineer Intern

Batch eligible: 2025 grads only

Apply: https://salesforce.wd12.myworkdayjobs.com/External_Career_Site/job/India---Hyderabad/Intern_JR203122-2?source=LinkedIn_Jobs

P.S: May be it’s on campus opportunity, I am not sure.

Company Name: Monk Tech Labs

Role: SDE Intern

Batch eligible: 2023 grads only

Apply: https://www.linkedin.com/jobs/view/3639455800

Looking for Java React FullStack Developers who can join immediately.
Experience - 5+ years
Location - PAN India

Please share your resume to payal.nagpal@in.ey.com

#SharewithSeniors

Company Name: Samsung

Role: SDE

Batch eligible: 2023 grads only

Apply: https://docs.google.com/forms/d/e/1FAIpQLSeUmEnrqA8eko_GHSfFNrqgG4UQrnuJG6D4gyMDbPQkuuUZog/viewform?usp=send_form

Note: Walk in interview hoga Chennai :)

Company Name: Enalo

Role: Frontend Developer Internship.

Batch eligible: 2022, 2023 and 2024 grads.

Stipend: 20k

Apply: https://bit.ly/3NsoYFQ

Guys anyone give Salesforce exam send question here will be share solution soon

int generate_D(long long A)
{
    int mod = 1000000007;
    int count = 0;
    vector<int> factors;
    for (int i = 2; i <= sqrt(A); i++)
    {
        while (A % i == 0)
        {
            factors.push_back(i);
            A /= i;
        }
    }
    if (A > 1)
    {
        factors.push_back(A);
    }

    int B = 1;
    vector<int> vec;
    for (int factor : factors)
    {
        if (find(vec.begin(), vec.end(), factor) == vec.end())
        {
            vec.push_back(factor);
            B *= factor;
        }
    }

    int C = 1;
    for (int i = 1; i <= sqrt(B); i++)
    {
        if (B % i == 0)
        {
            C *= i;
            if (i != B / i)
                C *= B / i;
        }
    }

    for (int i = 1; i <= sqrt(C); i++)
    {
        if (C % i == 0)
            count += (i != sqrt(C)) ? 2 : 1;
    }

    int D = count % mod;
    return D;
}

Converting numbers
Google Girl (Hackathon)
C++✅

int ans = INT_MIN;
    int index = 0;
    for (int i = 0; i < lenght; i++)
    {
        if (arr[i] > ans)
        {
            ans = arr[i];
            index = i;
        }
    }
    cout << ans << endl;
    cout << index;


C++
Accenture ✅

int sumOfDigits(int num) {
    int sum = 0;
    while (num > 0) {
        sum += num % 10;
        num /= 10;
    }
    return sum;
}

int DifferenceSumOfDigits(int arr[], int n) {
    int f1 = 0;
    int f2 = 0;

    for (int i = 0; i < n; i++) {
        f1 += sumOfDigits(arr[i]);
        f2 += arr[i];
    }

    f1 *= 10;
    f1 -= f2;
    f1 %= 10;

    return f1;
}

C++
Accenture ✅

Node* AddAlternateNodes(Node* head) {
    if (head == nullptr) {
        return nullptr;
    }

    Node* current = head;
    while (current != nullptr && current->next != nullptr && current->next->next != nullptr) {
        current->next->data += current->data;
        current = current->next->next;
    }

    return head;
}

int EvaluateExpression(char* expr) {
    std::stack<int> numbers;
    std::stack<char> operators;

    int i = 0;
    while (expr[i] != '\0') {
        if (expr[i] == ' ') {
            i++;
            continue;
        }
        if (expr[i] >= '0' && expr[i] <= '9') {
            int num = 0;
            while (expr[i] >= '0' && expr[i] <= '9') {
                num = num * 10 + (expr[i] - '0');
                i++;
            }
            numbers.push(num);
        } else if (expr[i] == '+' expr[i] == '/') {
            while (!operators.empty() && (operators.top() == '/' operators.top() == '+')) {
                int num2 = numbers.top();
                numbers.pop();
                int num1 = numbers.top();
                numbers.pop();
                char op = operators.top();
                operators.pop();
                if (op == '/') {
                    numbers.push(num1 / num2);
                } else if (op == '+') {
                    numbers.push(num1 + num2);
                }
            }
            operators.push(expr[i]);
            i++;
        }
    }

    while (!operators.empty()) {
        int num2 = numbers.top();
        numbers.pop();
        int num1 = numbers.top();
        numbers.pop();
        char op = operators.top();
        operators.pop();
        if (op == '/') {
            numbers.push(num1 / num2);
        } else if (op == '+') {
            numbers.push(num1 + num2);
        }
    }

    return numbers.top();
}


C++✅
Accenture