def retrievePasscodes(strips):
    sorted_strips = sorted([s.strip() for s in strips], key=lambda x: int(x[0], 36))
    characters = [s[1:] for s in sorted_strips]
    result = [''.join(row) for row in zip(*characters)]
    for line in result:
        print(line)

IBM ✅

#include <iostream>
#include <cmath>
#include <algorithm>

int solution(int M, int N) {
    int total_area = 4 * N + M;

    int x = static_cast<int>(:sqrt(total_area));

    while (x > 0) {
        int needed_tiles = x * x;

        int max_2x2_tiles = (x / 2) * (x / 2);

        if (needed_tiles <= 4 * min(N, max_2x2_tiles) + M) {
            return x;
        }

        --x;
    }

    return 0;
}

Microsoft ✅
Task 1

#include <iostream>
#include <vector>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void addEdge(unordered_map<int, vector<pair<int, bool>>>& adj, int u, int v, bool direction) {
    adj[u].emplace_back(v, direction);
    adj[v].emplace_back(u, !direction);
}

int dfs(int node, unordered_map<int, vector<pair<int, bool>>>& adj, unordered_set<int>& visited) {
    visited.insert(node);
    int reorientCount = 0;

    for (const auto& [neighbor, direction] : adj[node]) {
        if (visited.find(neighbor) == visited.end()) {
            if (direction) {
                reorientCount++;
            }
            reorientCount += dfs(neighbor, adj, visited);
        }
    }

    return reorientCount;
}

int solution(vector<int>& A, vector<int>& B, int N) {
    unordered_map<int, vector<pair<int, bool>>> adj;
    unordered_set<int> visited;

    for (int i = 0; i < N; ++i) {
        addEdge(adj, A[i], B[i], true);
    }

    return dfs(0, adj, visited);
}

Microsoft ✅
Task 2

def minMoves(k1, k2, k3, eT, aT, mT):
    n = k1 + k2 + k3
    de = set(range(1, k1 + 1))
    da = set(range(k1 + 1, k1 + k2 + 1))
    dm = set(range(k1 + k2 + 1, n + 1))
    
    eW = [0] * (n + 1)
    aW = [0] * (n + 1)
    mW = [0] * (n + 1)
    
    for t in eT:
        if t not in de:
            eW[t] = 1
            
    for t in aT:
        if t not in da:
            aW[t] = 1
            
    for t in mT:
        if t not in dm:
            mW[t] = 1
            
    pE = [0] * (n + 1)
    pA = [0] * (n + 1)
    pM = [0] * (n + 1)
    
    for i in range(1, n + 1):
        pE[i] = pE[i - 1] + eW[i]
        pA[i] = pA[i - 1] + aW[i]
        pM[i] = pM[i - 1] + mW[i]
    
    minM = float('inf')
    
    for i in range(n + 1):
        movesEA = pE[i]
        movesAM = pA[n] - pA[i]
        movesME = pM[n]
        
        totalM = movesEA + movesAM
        minM = min(minM, totalM)
    
    return minM

Titan (FTE) ✅

def foodItems(i1, i2, i3, i4):
    a = sorted(i4)
    if a[-1] - a[0] > i1 - 1:
        return -1
    m, c = 1, a[0]
    for x in a[1:]:
        if x - c > i1 - 1:
            m += 1
            c = x
    return m

Shell (FTE) ✅

📌Amantya Technologies

Currently seeking a fresher C/C++ Developer to join our team in Gurgaon.

Hiring Process:
Candidates will need to complete a technical test and a technical interview at our Gurgaon office.

Please send your CV to pooja.jassy@amantyatech.com

Send your resume
dowellhr@dowelltech.com

https://xogene.recruitee.com/o/jr-front-end-developer-pune-based-2/

masters Required Only

Company Name : UKG
Batch : 2025 female students
Role : SDE Internship - 6 months
Stipend : 50,000 INR/month

Form link : https://docs.google.com/forms/d/e/1FAIpQLSdnhRqbFCCEzdAMrR-1uRVOat0Rr67ncYiiJ8N4w89XEaMixQ/viewform?pli=1

Last date to fill the form is October 21.

Check out this job at Axis Bank: https://www.linkedin.com/jobs/view/4049028200

Company Name: Meesho
Role: Android Developer
YOE: 2 months - 2 years in android development

If interested send your resume to: sheifali.singh@meesho.com

Company Name: Cornerstone
Role: Associate Software Engineer
YOE: 2023 and 2024 grads

Apply: https://cornerstone.csod.com/ux/ats/careersite/2/home/requisition/9717?c=cornerstone

Lightcast is hiring Software Engineer

For 2021, 2022, 2023 grads
Location: Chennai

https://jobs.lever.co/economicmodeling/4016e3d8-8a90-42de-ab79-94ef16be0b1d/

Company Name : Nestle
Nestinternship 2024

Batch : All college going students - core branches

Link : https://www.nestle.in/jobs/students-graduates/nesternship-internship-program

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int mod = 1e9 + 7;

int countWaysToCreateWave(vector<int> nums,int m){
    int n = nums.size();
    vector<ll> PrefixDP1(m+1,0) , PrefixDP2(m+1,0);

    for(int i = n - 1 ; i >= 0 ; i--){
        vector<ll> newDP1(m+1,0) , newDP2(m+1,0);
        if(nums[i] == -1){
            for(int ending = 1 ; ending <= m ; ending++){
                (newDP1[ending] += i == n-1 ? ending != m : PrefixDP2[m] - PrefixDP2[ending] + mod) %= mod;
                (newDP2[ending] += i == n-1 ? ending != 1 : PrefixDP1[ending-1] - PrefixDP1[0] + mod) %= mod;
            }
        }
        else{
            (newDP1[nums[i]] = i == n-1 ? nums[i] != m : PrefixDP2[m] - PrefixDP2[nums[i]] + mod) %= mod;
            (newDP2[nums[i]] = i == n-1 ? nums[i] != 1 : PrefixDP1[nums[i]-1] - PrefixDP1[0] + mod) %= mod;
        }
        for(int ending = 1 ; ending <= m ; ending++){
            PrefixDP1[ending] = (PrefixDP1[ending-1] + newDP1[ending]) % mod;
            PrefixDP2[ending] = (PrefixDP2[ending-1] + newDP2[ending]) % mod;
        }
    }
    return (PrefixDP1[m] + PrefixDP2[m]) % mod;
}

Movelnsync Application latency wave ✅

def maxMeetings(effectiveness):
    effectiveness.sort(reverse=True)
    ce = 0
    count = 0
    
    for eff in effectiveness:
        ce += eff
        if ce > 0:
            count += 1
        else:
            break
    
    return count

Effective Manager ✅