📌Bottomline is hiring Associate Software Engineer

For 2023, 2024 grads
Location: Multiple

💻Apply:
https://boards.greenhouse.io/bottomlinetechnologies/jobs/7666351002

Company: Google
Role: Associate Product Manager

Batch : 2024/2025 from a degree related to PM, CS, Maths or Data Science. 
The application starts on 28th of October.

Apply : https://www.google.com/about/careers/applications/jobs/results/124204114060944070-associate-product-manager-university-graduate-2025-start

#include <bits/stdc++.h>
using namespace std;

string nextBeautifulString(string s, int n, int k) {
    for (int i = n - 1; i >= 0; --i) {
        if (s[i] < 'a' + k - 1) {
            s[i]++;
            fill(s.begin() + i + 1, s.end(), 'a');
            
            for (int j = 1; j < n; ++j) {
                if (s[j] == s[j - 1]  (j > 1 && s[j] == s[j - 2])) {
                    if (s[j] < 'a' + k - 1) {
                        s[j]++;
                        fill(s.begin() + j + 1, s.end(), 'a');
                    } else {
                        return "-1";
                    }
                }
            }
            
            bool valid = true;
            for (int j = 1; j < n; ++j) {
                if (s[j] == s[j - 1]  (j > 1 && s[j] == s[j - 2])) {
                    valid = false;
                    break;
                }
            }
            if (valid) return s;
            else return "-1";
        }
    }
    return "-1";
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        int n, k;
        string s;
        cin >> n >> k >> s;
        
        cout << nextBeautifulString(s, n, k) << endl;
    }
    return 0;
}

Beautiful Strings
Google ✅

Company Name: Palo Alto Network
Role: Software Engineer
Batch eligible: 2025 grads

Apply: https://jobs.paloaltonetworks.com/en/job/-/-/47263/71837933584

ACL Digital (An Alten Group Company) is hiring Freshers for Chennai Location.

Qualification - B.Tech/B.E-(CS, ECE, EEE) only

Experience 0-1 year

Mandatory skills - C, C++,embedded, linux, unit testing

Good to have - Python
Academics - above 70%

Interested candidates can share your resume to nishi.r@acldigital.com

int cleanupDataset(string dataset, int x, int y){
    vector<int> F(26, 0);
    for(char ch : dataset) F[ch - 'a']++;
    int ans = 0;
    if(x <= y){
        int cnt = 0;
        for(int num : F) ans += x * (num >> 1) , cnt += num & 1;
        ans += y * (cnt >> 1);
    }
    else{
        priority_queue<int> pq;
        for(int num : F) if(num) pq.push(num);
        while(pq.size() > 1){
            int x1 = pq.top(); pq.pop();
            int x2 = pq.top(); pq.pop();
            int rem = min(x1, x2);
            ans += y * rem;
            if(max(x1, x2) - rem) pq.push(max(x1 , x2) - rem);
        }
        if(pq.size()){
            int rem = pq.top(); pq.pop();
            ans += x * (rem >> 1);
        }
    }
    return ans;
}

Amazon ✅

def findminimumvariance(n, height):
    freq = {}
    mini = float('inf')
    for i in range(n):
        if height[i] in freq:
            s = freq[height[i]]
            sub = i - s + 1
            fir = height[s]
            cnt = height[s:i + 1].count(fir)
            var = sub - cnt
            mini = min(mini, var)
        freq[height[i]] = i
    if mini == float('inf'):
        return 0
    return mini

Amazon ✅

def getMaxEqualIndices(inv1, inv2):
    n = len(inv1)
    sinv1 = sum(inv1)
    sinv2 = sorted(inv2)
    
    prefixSum = [0] * (n + 1)
    for i in range(n):
        prefixSum[i + 1] = prefixSum[i] + sinv2[i]
    
    left = 0
    right = n
    
    while left < right:
        mid = (left + right + 1) // 2
        if mid < n:
            if prefixSum[mid] <= sinv1:
                left = mid
            else:
                right = mid - 1
        else:  
            if prefixSum[mid] == sinv1:
                left = mid
            else:
                right = mid - 1
    
    return left

Amazon ✅

def func(logs,maxSpan):
  sigins = {}
  signouts = {}
  for i in logs:
    iid,time,string = i.split()
    if string == "sign-out":
      signouts[iid] = int(time)
    else:
      sigins[iid] = int(time)
  l = []
  for i,j in signouts.items():
    if i in sigins:
      time = j - sigins[i]
      if time <= maxSpan:
        l.append(int(i))
  l.sort()
  res = [str(i) for i in l]
  return res

Sign-in sign -out Logs ✅

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long maximizeTotalMemoryPoints(vector<int> memory) {
    sort(memory.begin(), memory.end(), & -> bool {
        return a > b;
    });
    ll total = 0;
    ll cs = 0;
    for(auto m : memory){
        cs += m;
        total += cs;
    }
    return total;
}


int main(){
    int n;
    cin >> n;
    vector<int> memory(n);
    for(int &x: memory) cin >> x;
    cout << maximizeTotalMemoryPoints(memory);
}

Amazon ✅

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>

using namespace std;

int min_memory_after_deletion(vector<int>& a, int b) {
    int cd = accumulate(a.begin(), a.end(), 0);
    int n = a.size();
    
    if (b > n) {
        return cd;
    }
    
    int max_segment_sum = 0;
    int current_segment_sum = accumulate(a.begin(), a.begin() + b, 0);

    for (int i = 0; i <= n - b; ++i) {
        max_segment_sum = max(max_segment_sum, current_segment_sum);
        if (i + b < n) {
            current_segment_sum = current_segment_sum - a[i] + a[i + b];
        }
    }
    
    max_segment_sum = max(max_segment_sum, current_segment_sum);
    
    return cd - max_segment_sum;
}

Amazon ✅

def getMaximumPartitions(performance):
    A = performance[0]
    for num in performance[1:]:
        A &= num
    if A > 0:
        return 1
    c = 0
    a = 0
    for num in performance:
        a = num if a == 0 else a & num
        if a == 0:
            c += 1
            a = 0
    return c

Amazon ✅

Clearfeed is hiring SWE intern

For 2025 grads
Location: Bangalore

https://clearfeed.keka.com/careers/jobdetails/798

Winter Internships for college students :

1. FOSSEE  : https://fossee.in/winter-internship/2024
2. IIT Bhubaneshwar : https://webapps.iitbbs.ac.in/internship-application/,
3. NPTEL  : https://archive.nptel.ac.in/internship/
4. JNCASR  : https://www.jncasr.ac.in/winterschool/
5. ACM: https://india.acm.org/education/acm-india-winter-schools-2023-24 

ACM: Association for Computing Machinery
JNCASR: Jawaharlal Nehru Centre For Advanced Scientific Research

Apply for these asap.

Propel hiring Software Developer

2025 batch passouts

Apply Here : https://talent.propelinc.com/jobs/Careers/26698000080989011/Fresher-2025-Batch-Software-Developer?source=CareerSite

Moody's hiring for Software Engineer

0-3 year experience

Apply Here : https://careers.moodys.com/associate-software-engineer/job/28622865