Google

Role: Software Engineer Intern

Batch eligible: Only 2023 passouts

Link: https://bit.ly/3dxVqst


𝐏.𝐒. 𝐆𝐨 𝐰𝐢𝐭𝐡 𝐫𝐞𝐟𝐞𝐫𝐫𝐚𝐥, 𝐢𝐟 𝐩𝐨𝐬𝐬𝐢𝐛𝐥𝐞

If interested, have a look.

def jogging_ways(n: int) -> int:
    a, b = 1, 1
    for i in range(n):
        a, b = b, a+b
    return a %100000007


Run Walk and Run
Python 3✅

Happy independence day guys🇮🇳

‼️ I know SOTI hiring aaya hai, but link dekh kr mujhe lga ki oncampus hai...so I contacted recruiter pr unne koi reply nhi kra, that's why I not shared till now....
Phir bhi bahut koi puche toh I am sharing (Abhi bhi hm sure nhi hai oncampus hai ya offcampus)

SOTI hiring for 2023 grad.

https://soti.wd3.myworkdayjobs.com/SOTI_Campus_Recruitment_India/job/Kochi-India/Campus-Recruitment--SOTI-India-_R05620

int getMaximumLength(string lotterryID, string winnerID, int k)
{
    int ans = 0;
    int i = 0;
    while (i < min(lotterryID.size(), winnerID.size()))
    {
        if (lotterryID[i] == winnerID[i])
        {
            ans++;
            i++;
        }
        else if (((lotterryID[i] - 96) % 26) + 1 == winnerID[i] - 96)
        {
            ans++;
            i++;
        }
        else if (((lotterryID[i] - 96) % 26) - 1 == winnerID[i] - 96)
        {
            ans++;
            i++;
        }
        else
        {
            i++;
        }
    }
    return ans;
}

Lottery Winner ✅(C++)

def longestCommonSubsequence(self, text1: str, text2: str)
        #Tabulation Approach
        if len(text1)==0 or len(text2)==0:
            return 0
        rows,columns=(len(text2)+1,len(text1)+1)
        dp = [[0 for j in range(columns)] for i in range(rows)]
        for col in range(1,columns):
            for row in range(1,rows):
                if text1[col-1]==text2[row-1]:
                    dp[row][col]=1+dp[row-1][col-1]
                else:
                    dp[row][col]=max(dp[row-1][col],dp[row][col-1])
        return dp[rows-1][columns-1]

Lottery Winner ✅(Python 3)

Propel is hiring

Role: Trainee-QA

Batch eligible: 2023 passouts only

CTC, not sure but it will be less than 5 LPA.

Link: https://talent.propelinc.com/jobs/Careers/26698000043917373/Fresher-2023-QA?source=CareerSite

P.S. I am jst sharing coz I have to share all opportunities, but acc to me ignore this because role is QA and bond is also there

Bosscoder Academy is hiring for Software Engineer + Content Manager role.

Batch eligible: 2022 or before

CTC: 6-8 LPA

Skillset: Problem solving, frontend, backend.

Link:https://bit.ly/3PwD2xc

Crio.Do is hiring for project engineer Role

Batch eligible: 2022 and earlier

CTC: 4.5 - 5.5 LPA

Link: https://bit.ly/3JXcvYV

Python 3✅
Findmaximumsum(Amazon)

10x Academy, just gone through their curriculum.

Highly recommended to take demo sessions to 2023 batch or one who is looking for the job currently

U guys can also go directly: https://bit.ly/3C8taqx

int minimumKeypadClickCount(string input)
{
    char right[9][3] = {
        {'a', 'j', 's'},
        {'b', 'o', 't'},
        {'c', 'p', 'u'},
        {'d', 'k', 'v'},
        {'h', 'm', 'z'},
        {'g', 'l', '@'},
        {'e', 'n', 'w'},
        {'f', 'q', 'x'},
        {'i', 'r', 'y'}};
    int n, c = 0, ans = 0;
    n = input.length();
    for (int i = 0; i < n; i++)
    {
        int d = input[i] - 97;
        d = d % 3;
        c += (d + 1);
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < 9; j++)
        {
            for (int k = 0; k < 3; k++)
            {
                if (right[j][k] == input[i])
                    ans += (k + 1);
            }
        }
    }
    return ans;
}

Amazon ✅

Cipher with key