#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int getMinimumTime(vector<int>& processSize, vector<int>& capacity) {
    sort(processSize.rbegin(), processSize.rend());
    sort(capacity.rbegin(), capacity.rend());
   
    int ptr = 0;
    int time = 1;
   
    for (int process : processSize) {
        if (ptr == capacity.size()) {
            time++;
            ptr = 0;
        }
        if (process > capacity[ptr]) {
        
            if (process > capacity[0]) {
                return -1;
            }
            time++;
            ptr = 1;
        } else {
            ptr++;
        }
    }
    return 2*time-1;
}

Process Allocation ✅

def min_total_marks(num_questions, marks):
    marks.sort()
   
    total_marks = marks[0]
   
    for i in range(1, num_questions):
        if marks[i] <= marks[i - 1]:
            marks[i] = marks[i - 1] + 1
        total_marks += marks[i]
   
    return total_marks

Mr. Myers and the Exam ✅

Placement season Begins
Gartner ✅

import java.util.Arrays;

public class Main {

    static int findNumOfPairs(int[] a, int[] b) {
        Arrays.sort(a);
        Arrays.sort(b);

        int i = a.length -1 ;
        int j = b.length - 1;
        int pairs = 0;

        while (i >= 0 && j >= 0) {
            if (a[i] > b[j]) {
                pairs++;
                i--;
                j--;
            } else {
                j--;
            }
        }

        return pairs;
    }

Pairs ✅

def count_vowels(string):
    count = 0
    vowels = set('aeiou')
    for char in string:
        if char.lower() in vowels:
            count += 1
    return count

def determine_winner(strings):
    winners = []
    for string in strings:
        if count_vowels(string) % 2 == 0:
            winners.append("Chris")
        else:
            winners.append("Alex")
    return winners

System and Strings ✅

EY hiring voice process Analyst

https://forms.office.com/pages/responsepage.aspx?id=mT-XW99360uyfaoMcLhILOpi94FpHY5HvRlOlqDoYkNUQUlHMTJFRU1LNVFJRkxWUjBWNEgxNlVKOS4u&origin=lprLink

Company Name: Harness

🛄 Job Title: Software Engineer (Backend)

✍🏻 YOE: 0-1 years


➡️ Apply: https://www.instahyre.com/job-310707-software-engineer-at-harness-bangalore

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

int reachNumber(int target) {
    const int newTarget = abs(target);
    int ans = 0;
    int pos = 0;

    while (pos < newTarget)
      pos += ++ans;
    while ((pos - newTarget) & 1)
      pos += ++ans;

    return pos;
}

pos return karo instead of ans

Cross Number Puzzle ✅

Company Name: Qualcomm

🛄 Job Title: Software Engineer Intern (2024 grads) and Hardware Engineer Intern (2025 grads)

✍🏻 YOE: 2024 and 2025 grads



➡️ Apply: https://careers.qualcomm.com/careers/job/446697880255?hl=en-US&domain=qualcomm.com&source=APPLICANT_SOURCE-6-2&source=APPLICANT_SOURCE-6-2

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

def min_remaining_length(seq):
    stack = []
    for char in seq:
        if char == "A" or char == "B":
            if stack and stack[-1] == "A" and char == "B":
                stack.pop()
            elif stack and stack[-1] == "B" and char == "B":
                stack.pop()
            else:
                stack.append(char)
        else:
            stack.append(char)
   
    return len(stack)

Substring Removal ✅
JPMC code for good

import java.util.*;

public class Main {
    public static String getLargestNumber(String num) {
        StringBuilder ans = new StringBuilder();
        StringBuilder s = new StringBuilder();
       
        for (int i = 0; i < num.length() - 1; i++) {
            if ((num.charAt(i) - '0') % 2 == (num.charAt(i + 1) - '0') % 2) {
                s.append(num.charAt(i));
            } else {
                s.append(num.charAt(i));
                char[] chars = s.toString().toCharArray();
                Arrays.sort(chars);
                ans.append(new StringBuilder(new String(chars)).reverse());
                s.setLength(0);
            }
        }
       
        s.append(num.charAt(num.length() - 1));
        char[] chars = s.toString().toCharArray();
        Arrays.sort(chars);
        ans.append(new StringBuilder(new String(chars)).reverse());
       
        return ans.toString();
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String s = scanner.next();
        scanner.close();
        System.out.println(getLargestNumber(s));
    }
}

Swap Parity ✅
JPMC code for good