long long minimumHealth(vector<int>& damage, int armor) {
        long long s = 0;
        int mx = damage[0];
        for (int& v : damage) {
            s += v;
            mx = max(mx, v);
        }
        return s - min(mx, armor) + 1;
    }

Amazon ✅

#include <vector>
#include <iostream>
using namespace std;
int longestDiagonalSegment(vector<vector<int>>& matrix) {
    int rows = matrix.size();
    int cols = matrix[0].size();
    int longest = 0;
    int dR[] = {-1, 1, -1, 1}; 
    int dC[] = {1, 1, -1, -1};  
    for (int r = 0; r < rows; ++r) {
    for (int c = 0; c < cols; ++c) {
    for (int dir = 0; dir < 4; ++dir) {
    int len = 0;
    int rPos = r, cPos = c;
    int pattern[] = {1, 2, 0, 2, 0, 2, 0};
    int pIdx = 0;
    while (rPos >= 0 && rPos < rows && cPos >= 0 && cPos < cols) {
    if (matrix[rPos][cPos] == pattern[pIdx]) {
        ++len;
        pIdx = (pIdx + 1) % 7; 
        } else {
        break;
        }
        rPos += dR[dir];
        cPos += dC[dir];
        }
                
        longest = max(longest, len);
            }
        }
    }

    return longest;
}

Visa ✅

def getRank(coffee, chocolate, query):
    n = len(coffee)
    drinks = [(coffee[i], chocolate[i], i+1) for i in range(n)]
    drinks.sort(key=lambda x: (-x[0], -x[1], x[2]))
    result = [drinks[q-1][2] for q in query]
    return result

DE Shaw ✅

def canonical_form(s):
    mapping = {}
    form = []
    next_index = 0

    for char in s:
        if char not in mapping:
            mapping[char] = next_index
            next_index += 1
        form.append(mapping[char])

    return tuple(form)

def solve(N, Q, S, K):
    canonical_map = {}

    for string in S:
        form = canonical_form(string)
        if form not in canonical_map:
            canonical_map[form] = 0
        canonical_map[form] += 1

    result = []
    for query in K:
        query_form = canonical_form(query)
        result.append(canonical_map.get(query_form, 0))

    return result

Google ✅

#include <vector>
using namespace std;

vector<int> solution(vector<int> forest, int bird) {
    vector<int> pos;
    int total_length = 0;
    int direction = 1;
    int n = forest.size();
    while (total_length < 100) {
        if (direction == 1) {
            for (int i = bird + 1; i < n; i++) {
                if (forest[i] > 0) {
                    pos.push_back(i);
                    total_length += forest[i];
                    forest[i] = 0;
                    break;
                }
            }
        } else {
            for (int i = bird - 1; i >= 0; i--) {
                if (forest[i] > 0) {
                    pos.push_back(i);
                    total_length += forest[i];
                    forest[i] = 0;
                    break;
                }
            }
        }
        direction *= -1;
    }
    return pos;
}

Visa ✅

BharatPe is hiring SDE

For 2020, 2021, 2022, 2023 grads

https://www.linkedin.com/posts/bharatpe_join-bharatpe-activity-7265335537765363712-EXs7

Expected CTC -> 30-50LPA

📌Wipro is hiring Freshers!
Position: Associate

Salary: 3.5 - 5.7 LPA (Expected)
Experience: Freshers (0 - 2 Years)
Location: PAN India

💻Apply Now: https://careers.wipro.com/careers-home/jobs?keywords=Associate&stretchUnits=MILES&stretch=10&location=India&lat=22&lng=79&woe=12

📌CGI is Hiring
Role: Testing / QA

Experience: Freshers (0 - 1 Years)

💻Apply Link:
https://cgi.njoyn.com/corp/xweb/xweb.asp?clid=21001&page=jobdetails&jobid=J0924-1690&BRID=1163211&SBDID=943

Email: pradeep@intellisofttech.com

Hyderabad Candidates

Cognizant hiring Engineer Trainee

0-1 year experience
4 LPA CTC

Apply Here : https://app.joinsuperset.com/join/#/signup/student/jobprofiles/b643e525-c83b-4505-9a10-a666be44f249

📌Barclays Hiring
Role: Technology Developer Graduate Program

Batch: 2025

💻Apply Link: https://search.jobs.barclays/job/-/-/13015/73381614864

Company Name : PayU
Batch : 2025/2026 passouts
Role : Data Internship

Skillset required : Python and SQL

Link : https://jobs.eu.lever.co/payu/9da4be41-d780-4375-a55b-2543f81e3b51

Company Name : Urban Company
Role : Associate Product Manager
Batch : 2024/2023/2022 passouts

Job Description : https://docs.google.com/document/d/1ye8zupR_elfzncGV1IdbvU-0uFo_YT_8ZiS6K9y3Ua4/mobilebasic

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