import java.util.*;
public class Main {
    static int MOD = 1000000007;
    public static void countErrors(String s, int[] type1, int[] type2) {
        int n = s.length();
        int[] p = new int[n + 1];
        int[] p1 = new int[n + 1];
        for (int i = n - 1; i >= 0; i--) {
            if (s.charAt(i) == '0') {
                p[i] = p[i + 1] + 1;
                p1[i] = p1[i + 1];
            } else {
                p[i] = p[i + 1];
                p1[i] = p1[i + 1] + 1;
            }
        }
        for (int i = 0; i < n; i++) {
            if (s.charAt(i) == '0') {
                type1[0] += p1[i + 1];
            } else {
                type2[0] += p[i + 1];
            }
        }
    }
    public static int getMinErrors(String errorString, int x, int y) {
        StringBuilder s1 = new StringBuilder(errorString);
        StringBuilder s2 = new StringBuilder(errorString);
        for (int i = 0; i < errorString.length(); i++) {
            if (errorString.charAt(i) == '!') {
                s1.setCharAt(i, '0');
                s2.setCharAt(i, '1');
            }
        }
        int[] t = new int[1];
        int[] t2 = new int[1];
        countErrors(s1.toString(), t, t2);
        int tt = (int) (((long) t[0] * x % MOD + (long) t2[0] * y % MOD) % MOD);
        t[0] = 0;
        t2[0] = 0;
        countErrors(s2.toString(), t, t2);
        tt = Math.min(tt, (int) (((long) t[0] * x % MOD + (long) t2[0] * y % MOD) % MOD));

        return tt;
    }

Amazon ✅

def sortPermutation(p, moves):
    n = len(p)
    visited = [False] * n
    count = 0
    for i in range(n):
      if not visited[i]:
        cycle_length = 0
        x = i
        while not visited[x]:
          visited[x] = True
          x = p[x] - 1 
          cycle_length += 1
        if cycle_length > 1:
          count += (cycle_length - 1)
    res = [0] * len(moves)
    for idx, move in enumerate(moves):
      if move >= count and (move - count) % 2 == 0:
        res[idx] = 1
    rs = "".join(str(x) for x in res)
    return rs

Amazon ✅

#include <iostream>
#include <vector>
#include <climits> 
using namespace std;
int minMagicPoints(int H, int N, vector<int>& D, vector<int>& M) {
    vector<int> dp(H + 1, INT_MAX);
    dp[0] = 0;
    for (int h = 1; h <= H; ++h) {
        for (int i = 0; i < N; ++i) {
            int dmg = D[i];
            int cost = M[i];
            if (h - dmg >= 0) {
                dp[h] = min(dp[h], dp[h - dmg] + cost);
            } else {
                dp[h] = min(dp[h], cost);
            }
        }
    }
    return dp[H];
}

Commvault✅

Company Name: State Street
Role: Technology Internship Program (6 months)
Batch eligible: 2025 grads

Apply: https://statestreet.wd1.myworkdayjobs.com/Global/job/Bangalore-India/Technology-Internship-Program--6-Months-_R-758295

https://www.linkedin.com/posts/taskcraft-technologies_hiringfreshers-walkininterview-softwaredevelopment-activity-7243921368918986752-LlSp?utm_source=share&utm_medium=member_desktop

📢Exciting Opportunity for Fresh Graduates of 2023 and 2024 !!

Are you ready to kick-start your career in the IT industry? Join us at TaskCraft Technologies LLP - A CMMI Level 5 Company for a Walk-In Interview for the role of "Trainee Software Developer!" We are actively seeking passionate and talented individuals to be a part of our growing team.

📅 Date: October 4th, 2024 (Friday)
🕑 Time: 11:00 AM – 05:00 PM
📍 Location: First floor, Plot no. 100, Scheme no. 53, Landmark - Medanta Hospital, Vijay Nagar, Indore

🎯 Profile: Trainee Software Developer
🎓 Qualifications:
B.Tech
(CS/IT)
M.Tech
(CS)
MCA
BE (CS/IT)
👉Must have completed degrees
Passing Years: 2023, 2024

Take the first step towards an exciting career with us!

For more details, visit: https://taskcraft.in

Feel free to reach out to us at: +91-7880001859

IBM Hiring Research Interns
Batch: 2026/2027
BTech/MTech/Ph.D all are eligible.
https://ibm.ent.box.com/v/india-research-internship-2025

📌Suma Soft is Hiring for Java Developer (freshers)

Location: Pune

Experience: Freshers

Notice Period - Immediate joiner only

📩Share your resume: anamika.shukla@sumasoft.net

I know you are all trying very hard and applying to 10s if not 100s of jobs everyday with no response or rejections in most.

Trust me this is the scenario with everyone you're not alone, I have faced it and still face it when I try my luck for International jobs.

The only thing which can keep you going is inner motivation and your family.

Do it for your loved ones and nothing can distract you.
I'm here to help in the best possible way.

Kudos for keep trying...♥️🚀

Send your Resume at:
prabu@vembu.com