https://jobs.smartrecruiters.com/Eurofins/744000011450595-associate-software-engineer-sharepoint

Eurofins Hiring ASE - Sharepoint

B.E./ B. Tech (CS, IS, EC, EEE) / MCA/ MS /BSc (CS, IT)
0-12 months of IT Industry experience
60% aggregate in highest qualification (no backlogs)

https://www.amazon.jobs/jobs/2776777/it-support-associate-?cmpid=SPLICX0248M&utm_source=linkedin.com&utm_campaign=cxro&utm_medium=social_media&utm_content=job_posting&ss=paid

Amazon Hiring IT Support Associate

• Bachelor’s degree/Diploma
• 0 months to 18 months of work experience.
• Good communication skills

PREFERRED QUALIFICATIONS
• Basic Understanding of ITIL-Based Ticketing Tools and Monitoring Tools
• Basic Understanding and troubleshooting skills on Network

Company Name : NXP Semiconductors
Batch : 2027 passout females
Role : Mentorship Program + Internship at NXP

Link to register : https://wit.nxp.com/
Last Date : September 20,2024

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

Voya India Hiring Trainee

1. Responsible to process participants/Plan level transactions

2. Will have to work closely with supervisors to ensure all transactions are processed accurately

3. Strict adherence non-disclosure of client information by preserving client confidentiality

4. Completing assigned responsibilities within the defined SLAs

Skills & Required profile

1. Should be a Graduate and not an Engineering/MCA graduate

2. Should have good communication and analytical skills

3. Should be a self-starter, proactive and target oriented

4. Good knowledge of MS Office applications

5. Should be flexible to work in night shifts and must extend when business required Employment type: Full time

https://wellfound.com/l/2ABQBX
Datazip Hiring Full Stack Developer Intern

https://antino.freshteam.com/jobs/AsddmUszHk7Q/java-developer-intern

Antino Hiring Java Developer Intern

def solution(fish, baits):
    fish.sort(reverse=True) 
    baits.sort(reverse=True)  
    cf = 0
    bu = [0] * len(baits)

    for f in fish:
        for i, bait in enumerate(baits):
            if bait < f and bu[i] < 3:
                cf += 1
                bu[i] += 1
                break

    return cf

Visa ✅

vector<string> solve(vector<vector<string>> p, vector<string> a, int w) {
    vector<string> r;
    r.push_back(string(w + 2, '*'));
    for(int i = 0; i < p.size(); i++) {
        string l = "";
        for(string wd : p[i]) {
            if(l.size() + wd.size() + (l.empty() ? 0 : 1) > w) {
                if(a[i] == "LEFT") {
                    l += string(w - l.size(), ' ');
                } else if(a[i] == "RIGHT") {
                    l = string(w - l.size(), ' ') + l;
                }
                r.push_back("*" + l + "*");
                l = "";
            }
            if(!l.empty()) {
                l += " ";
            }
            l += wd;
        }
        if(!l.empty()) {
            if(a[i] == "LEFT") {
                l += string(w - l.size(), ' ');
            } else if(a[i] == "RIGHT") {
                l = string(w - l.size(), ' ') + l;
            }
            r.push_back("*" + l + "*");
        }
    }
    r.push_back(string(w + 2, '*'));
    return r;
}

Visa ✅

class UserMainCode(object):
    @classmethod
    def totalCount(cls, input1, input2, input3):
        N = input1 
        X = input2 
        A = input3  
        count = 0
        end = 0
        for start in range(N):
            while end < N and A[start] + A[end] <= X:
                end += 1
            count += (end - start)
        return count

Cognizant ✅

import java.util.*;
public class MagicalLibrary {
    public static int countMagicalRows(int[][] matrix) {
        int magicalRowCount = 0;
        
        for (int[] row : matrix) {
            int oddSum = 0;
            boolean hasOdd = false; 
            
            for (int value : row) {
                if (value % 2 != 0) { 
                    oddSum += value;
                    hasOdd = true; 
                }
            }
            if (hasOdd && oddSum % 2 == 0) {
                magicalRowCount++;
            }
        }
        
        return magicalRowCount;
    }

magical library✅
Cognizant

public class HouseVisitCounter {
    public static int countHouses(int N, int[] A) {
        int houseCount = 1;
        int i = 1; 
        while (i <= N) {
            int jump = A[i - 1]; 
            i = i + jump;
            if (i <= N) { 
                houseCount++;
            } else {
                break;
            }
        }

        return houseCount;
    }

 House visit✅
Cognizant

import java.util.Arrays;
import java.util.Collections;
public class MinimumSum {
    public static int findMinimumSum(int N, int[] A, int[] B) {
        Arrays.sort(A);
        Integer[] B_desc = new Integer[N];
        for (int i = 0; i < N; i++) {
            B_desc[i] = B[i];
        }
        Arrays.sort(B_desc, Collections.reverseOrder());
        int minSum = 0;
        for (int i = 0; i < N; i++) {
            minSum += A[i] * B_desc[i];
        }

        return minSum;
    }

Minimum Sum ✅