Ericsson hiring intern

Batch: 2024, 2025

Link- https://jobs.ericsson.com/careers/job/563121756333725

You must have heard news or seen that people are using AI to create nude images of womens.
Please read this post if anything goes wrong in future with you or with someone you know. 

Share with your friends for awareness.
Link : https://www.linkedin.com/feed/update/urn:li:activity:7094119643962880000

P.S : This is not job post but people must be aware like what’s going on over internet and how to tackle if anything wrong happens to you or your loved ones.

Rupeek is hiring Program Management Interns who can join IMMEDIATELY for their Category - Business team.

Eligibility: - Graduating from BTech/BE, MBA 2023/2024 or CAs

- Available to start-off the internship immediately

- Willing to relocate and work from office (Based out of Bangalore)

Apply Link :

https://docs.google.com/forms/d/e/1FAIpQLSf_5J6u_CCKyIIoW7D9mVvHyB9usvGAliYwymqKgbEPnDHU6A/viewform


- Available for 6month full-time internship

Job Description:
https://docs.google.com/document/u/0/d/1UX-RpJshYbQBaRYmzpeywrRXhm9XloMJgUvzeudNBOs/mobilebasic

Company Name: Rocket

Role: Software Engineer 1

Batch eligible: 2022 and 2023 grads

Apply: https://rocket.wd5.myworkdayjobs.com/rocket_careers/job/Pune-India/Software-Engineer-I_R2023-3704?source=LinkedIn_Corporate_page

Company Name: IBM

Role: Associate Software Engineer

Batch eligible: 2022 and 2023 grads

Apply: https://careers.ibm.com/job/18844416/associate-systems-engineer-remote/

#include <bits/stdc++.h>
using namespace std;

int main ()
{
  int n; cin >> n;
  vector<int> b(n), a;
  for (auto & x : b) cin >> x;

  int X; cin >> X;
  for (int i = 0; i < X; i++) {
    vector<int> newb(n);
    for (int i = 0; i < n; i++) {
      newb[i] = abs(b[i] - b[(i+1)%n]);
    }
    a = b;
    b = newb;   
  }
  cout << "A: ";
  for (auto x : a) cout << x << " ";
  cout << endl;
  cout << "B: ";
  for (auto x : b) cout << x << " ";
  cout << endl;
}

Micron ✅

Some Internship Opportunities!!

1) Rushan Corporation is hiring for Backend Developer Intern (2024 grads eligible)

Apply: https://bit.ly/45gassg

2) Reunion is hiring for FullStack Developer Internship (2024 grads eligible)

Apply: https://bit.ly/45lwFVI

3) Secure Blink is hiring for Backend Developer Internship (2024 and 2025 grads)

Apply: https://bit.ly/47g87iK

AMD Hiring Intern !!

Batch: 2024

Stipend: 50k

Apply here-
https://globalcampus-amd.icims.com/jobs/33466/co-op--intern/job?mode=view&mobile=true&width=300&height=500&bga=true&needsRedirect=false&jan1offset=330&jun1offset=330

GitHub Education
https://education.github.com/campus_experts/

Company Name: LinkedIn

Role: SDE Intern

Batch eligible: 2025 grads only
Apply:
https://www.linkedin.com/jobs/view/3684489143

SinglyLinkedListNode* findLongestList(SinglyLinkedListNode* head) {
    if (!head) return nullptr;

    SinglyLinkedListNode* curr = head;
    SinglyLinkedListNode* start = head;
    SinglyLinkedListNode* bestStart = head;

    int length = 1;
    int bestLength = 1;

    while (curr->next) {
        if (curr->data >= curr->next->data) {
            length++;
        } else {
            if (length > bestLength) {
                bestLength = length;
                bestStart = start;
            }
            length = 1;
            start = curr->next;
        }
        curr = curr->next;
    }
    if (length > bestLength) {
        bestLength = length;
        bestStart = start;
    }
    SinglyLinkedListNode* temp = bestStart;
    for (int i = 1; i < bestLength && temp; i++) {
        temp = temp->next;
    }
    if (temp) {
        temp->next = nullptr;
    }

    return bestStart;
}

Amazon OA| AWS Databased
C++✅

long findTotalExecutionTime(vector<int>& execution) {
    int n = execution.size();
    vector<int> original = execution;
    long totalTime = 0;
    unordered_map<int, list<int>> origIndicesMap;

    for (int i = 0; i < n; i++) {
        origIndicesMap[original[i]].push_back(i);
    }

    for (int i = 0; i < n; i++) {
        totalTime += execution[i];

        if (origIndicesMap[original[i]].size() > 1) {
            int reducedValue = ceil((double)execution[i] / 2);
            for (int idx : origIndicesMap[original[i]]) {
                if (idx != i) {
                    execution[idx] = reducedValue;
                }
            }
        }
    }

    return totalTime;
}

Amazon
C++ ✅

iSteer Hiring!

Role - Data Scientist

Exp - Fresher

https://www.linkedin.com/jobs/view/3684915489