https://jobs.standardchartered.com/job/Bangalore-2025-Intern-Tech-PSG-Tech-GBS-India/803430002/?feedId=363857&utm_source=lilimitedlistings

SCB Hiring Intern - Tech PSG

Internships available
We have the following internships available in Bangalore and Chennai:

•    UI Developer
•    Java Developer
•    SQL Developer
•    Automation tester
•    Performance Engineer
•    Data Science
•    Machine Learning
•    Cloud

Responsibilities
•    Analyse complex business problems and help arrive at technically innovative solutions.
•    Design user interactions on web pages
•    Develop back-end website applications.
•    Develop front-end website architecture.
•    Automation of test suite using Selenium 
•    Identify performance gaps in applications and tuning code to achieve desired performance goals.
•    Collaborate with globally distributed agile teams.

Preferred Skills
•    Proven problem-solving ability.
•    Strong foundational knowledge of Algorithms, Data Structures, OOP concepts and frameworks.
•    Curious learner, willing to learn and adapt to new technologies and frameworks.
•    Empowered mindset with ability to ask questions and seek clarifications.
•    Excellent communication skills that enable seamless interactions with colleagues globally
•    Strong analytical skills and impeccable attention to detail
•    Excellent verbal and written communication skills
•    Highly enthusiastic individual and considered a go-getter.
•    Strong networking and inter-personal skills

Eligibility
We welcome students from Engineering degrees and encourage students from diverse backgrounds to apply.   

We’re looking for team players with excellent academic achievements and extracurricular activities, who are agile, flexible problem solvers with strong technical abilities and open to learning the latest tech stack.
A strong foundational knowledge of Algorithms, Data Structures, OOP concepts and frameworks is preferred.

You need to be a final year student, able to intern from January 2025 to June 2025 and start full-time employment in July 2025.

#include <iostream>
#define MOD 1000000007
using namespace std;
int ff(int a) {
    int s = 0;
    while (a > 0) {
        s += a % 10;
        a /= 10;
    }
    return sum;
}
int solve(int N, int X) {
    int c = 0;
    int num = 0;
        while (c < N) {
        num++;  
        if (ff(num) == X) {
            c++;  
        }
    }
        return num % MOD;
}

Brainstorming Series ✅

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

bool dfs(char current, char start, string &path, map<char, set<char>> &adj, set<char> &used, int target) { 
    if (path.size() == target) { 
        if (adj[current].count(start)) { 
            path.push_back(start); 
            return true; 
        } 
        return false; 
    } 

    for (char next : adj[current]) { 
        if (!used.count(next)) { 
            used.insert(next); 
            path.push_back(next); 
            if (dfs(next, start, path, adj, used, target)) return true; 
            path.pop_back(); 
            used.erase(next); 
        } 
    } 
    return false; 
} 

string gemWord(int input1, string input2) { 
    set<char> unique_chars(input2.begin(), input2.end()); 
    if (unique_chars.size() < input1) return "No"; 

    map<char, set<char>> adj; 
    int n = input2.size(); 
    for (int i = 0; i < n - 1; ++i) { 
        adj[input2[i]].insert(input2[i + 1]); 
        adj[input2[i + 1]].insert(input2[i]); 
    } 

    string result; 
    bool found = false; 
    for (char ch : unique_chars) { 
        string path = ""; 
        set<char> used = {ch}; 
        path.push_back(ch); 
        if (dfs(ch, ch, path, adj, used, input1)) { 
            if (!found || path < result) { 
                result = path.substr(0, path.size() - 1); 
                found = true; 
            } 
        } 
    } 

    return found ? result : "No"; 
}

gem word 9/10✅

import math

def destroyMonster(n, a):
    dp = [[0] * n for _ in range(n)]
    
    for length in range(2, n + 1, 2):
        for i in range(n - length + 1):
            j = i + length - 1
            if length == 2:
                dp[i][j] = math.gcd(a[i], a[j])
            else:
                dp[i][j] = float('inf')
                for k in range(i + 1, j, 2):
                    cost = math.gcd(a[i], a[k]) + dp[i+1][k-1] + dp[k+1][j]
                    dp[i][j] = min(dp[i][j], cost)
    
    return dp[0][n-1]

Destroy all monsters ✅

DoorDash is Hiring
Role : Software Engineering Intern
Batch : 2024,2025

Referral Link :  https://grnh.se/abd3c3701us

Adobe is hiring for SDET role

Batch : 2021, 2022 passouts
Location : Noida

Apply Here :
https://careers.adobe.com/us/en/job/ADOBUSR149707EXTERNALENUS/Software-Development-Engineer-in-Test-Java?utm_medium=phenom-feeds&source=LinkedIn&utm_source=linkedin

📌 Company: Snoodify

Looking for interns who are good with Search and Recommendation algorithms ML

✉️Mail your profiles to dheekshith@snoodify.com

Hiring immediately. Preferably college students.

Zomato hiring For Freshers and Experienced

Company Name: Branch International
Role: Software Engineer Intern
Batch eligible: 2025 grads only

Apply: https://branchinternational.applytojob.com/apply/eahXMYz8pY/Software-Engineer-Intern

RetainIQ is hiring Front-end  Engineer

For 2022, 2023, 2024 grads
Location: Bangalore

https://www.linkedin.com/jobs/view/4026030299

if((1LL*n*n)%10==(n%10))
return "Yes";
return "No";

Fidelity ✅

ll solver(vll &grid,int n,int m, int row,int col){
    ll cnt=1;
    ll x1=1;
    while(true){
        if(row-x1>=0 and col-x1>=0 and row+x1<n and col+x1<m and grid[row-x1][col-x1]==1 and grid[row-x1][col+x1]==1 and grid[row+x1][col+x1] and grid[row+x1][col-x1]==1){
            x1++;
            cnt++;
        }
        else{
            break;
        }
    }
    return cnt;
}
int help(vll grid,int n,int m){
    ll ans=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(grid[i][j]==1)
            ans+=solver(grid,n,m,i,j);
        }
    }
    return ans;
}

Coinbase ✅

How many people got this mail

pair<string, int> pL(const string& l) {
    size_t sp = l.find(' ');
    string n = l.substr(0, sp);
    int t = stoi(l.substr(sp + 1));
    return {n, t};
}

vector<string> sol(vector<vector<string>>& laps) {
    unordered_map<string, int> bt;
    vector<string> d; 
    vector<string> eo;


    for (const string& l : laps[0]) {
        auto [n, t] = pL(l);
        bt[n] = t;
        d.push_back(n);
    }


    for (const auto& lap : laps) {

        for (const string& dl : lap) {
            auto [n, t] = pL(dl);
            bt[n] = min(bt[n], t);
        }


        int sT = 0;
        for (const string& n : d) {
            sT = max(sT, bt[n]);
        }

        vector<string> eD;
        for (auto it = d.begin(); it != d.end();) {
            if (bt[*it] == sT) {
                eD.push_back(*it);
                it = d.erase(it);
            } else {
                ++it;
            }
        }

        sort(eD.begin(), eD.end());
        eo.insert(eo.end(), eD.begin(), eD.end());
    }

    return eo;
}

Coinbase ✅