vector<vector<int>> solution(vector<vector<int>> image, int radius) {
    int rows = image.size();
    int cols = image[0].size();
    vector<vector<int>> blurred_image(rows, vector<int>(cols, 0));

    for (int i = 0; i < rows; ++i) {
        for (int j = 0; j < cols; ++j) {
            vector<int> neighbors;

            for (int r = max(0, i - radius); r < min(rows, i + radius + 1); ++r) {
                for (int c = max(0, j - radius); c < min(cols, j + radius + 1); ++c) {
                    if (r != i || c != j) {
                        neighbors.push_back(image[r][c]);
                    }
                }
            }

            if (!neighbors.empty()) {
                int mean_neighbors = accumulate(neighbors.begin(), neighbors.end(), 0) / neighbors.size();
                blurred_image[i][j] = (image[i][j] + mean_neighbors) / 2;
            } else {
                blurred_image[i][j] = image[i][j];
            }
        }
    }

    return blurred_image;
}

Autodesk ✅

def solution(board):
    board = list(map(list, zip(*board)))
    obstacles_to_remove = 0
    lowest_figure = len(board[0]) - 1
    for col in range(len(board)):
        if '*' in board[col]:
            lowest_part = board[col].index('*')
            lowest_figure = min(lowest_figure, lowest_part)
            obstacles_to_remove += board[col][:lowest_part].count('#')
    return obstacles_to_remove

Autodesk ✅

Meta is hiring Software Engineers for its London Office

Referral Form :
https://docs.google.com/forms/d/1Hx_CAEqQyzSxRnYZxq_Sa9KE2Jn7HWgAs6xXCMSIRj4

TCS BSc Ignite and Smart Hiring 2024:

Graduation Year: 2023 / 2024

Eligibility: BCA, B.Sc (IT, Computer Science, Mathematics, Data Science, Statistics, Physics, Chemistry, Electronics, Cyber Security, Biochemistry), B.Voc in CS/IT

CTC for Ignite - 2.8 LPA
CTC for Smart - 1.9 LPA

Register Now: https://www.tcs.com/careers/india/tcs-smart-hiring-2024

Last Date to Regsiter: 24th June

Company Name: Tata1mg

🛄 Job Title: SDE 1 (Frontend)
✍🏻 YOE: 0-2 years

➡️ Apply: https://1mg.darwinbox.in/ms/candidate/careers/a66321e35c853c

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

🚨Job Opening Updates🚨

Company – Oracuz Infotech Pvt Ltd
Role – Data Science Intern
Exp. – Fresher
Apply Here – https://www.simplyhired.co.in/job/U44tuZ0b1xFLAqMw2dNuNWGetG7pNdEKVbIf7HbUqEq0hcb0X9ww6Q

Company – Conscript HR Advisors Private Limited
Role – Business Analytics Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/details/work-from-home-part-time-business-analytics-internship-at-conscript-hr-advisors-private-limited1717387959?utm_source=cp_link&referral=web_share

Company – EMERGEiQ
Role – Data Scientist
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3938463825

Degreed is hiring Junior Software Engineer

For 2024, 2023, 2022 grads

Location - Bangalore

Apply - https://boards.greenhouse.io/degreed/jobs/5193583004?gh_src=f16e0ebe4us

ceil((double)(n)/c)

Ship Rounds ✅
Cognizant

return input1|input2

Logical OR ✅
Cognizant

Exp more than 4 year✅
Cognizant

SELECT
    contact_id,
    user_id
FROM
    contacts
WHERE
    job_title = 'Lawyer';

Cognizant ✅

public static int minimumWinningMargin(int input1, int input2, int input3, int[] input4) {
        int requiredTotalMargin = input1 * input3;
        int currentTotalMargin = 0;
        for (int i = 0; i < input4.length; i++) {
            currentTotalMargin += input4[i];
        }
        int neededMargin = requiredTotalMargin - currentTotalMargin;
        if (neededMargin <= input2) {
            return Math.max(0, neededMargin);
        } else {
            return -1;
        }
    }

Qualifying Chances ✅
Cognizant

select ca.first_name, od.status from customer_order co
join customer_address ca on ca.customer_id = co.customer_id
join order_delivery od on od.order_id = co.order_id
where first_name like 'C%';

Cognizant ✅

int solve(int n, vector<int>& A, int M) {
    sort(A.begin(), A.end());
    int candies = 0;
    for (int i = 0; i < n; i++) {
        if (A[i] % 5 == 0 || A[i] <= M) {
            candies++;
            M -= A[i] % 5 == 0 ? 0 : A[i];
        }
        if (M == 0) {
            break;
        }
    }
    return candies;
}


Halloween candies✅