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

int solve(vector<vector<int>>&v, vector<vector<int>>&vis, int x, int y, int sum,int dx, int dy){
   if(vis[x][y]) return sum;
   if((x==0 and y==0) (x==0 and y==v[0].size()-1) (x==v.size()-1 and y==0) (x==v.size()-1 and y==v[0].size()-1)){
      sum+=v[x][y];
       return sum;
   }
   sum+=v[x][y];
   vis[x][y]=1;
   if(x+dx==v.size() x+dx<0){
       if(dx==1) dx=-1;
       else dx=1;
   }
   if(y+1==v[0].size() || y+dy<0){
       if(dy==1) dy=-1;
       else dy=1;
   }
   return solve(v,vis,x+dx,y+dy,sum,dx,dy);
}

int solution(vector<vector<int>>&v, int x, int y){
    int n=v.size();
    int m=v[0].size();
    vector<vector<int>>vis(n,vector<int>(m,0));
    return solve(v,vis,x,y,0,1,1);
}
signed main(){
    int n,m,x,y;
    cin>>n>>m>>x>>y;
    vector<vector<int>>v(n,vector<int>(m,0));
    for(int i=0; i<n; i++)
    for(int j=0; j<m; j++) cin>>v[i][j];
    cout<<solution(v,x,y)<<endl;
    return 0;
}

Visa ROBOT Traversal✅

Flexi Analyst is Hiring !!

Role: Software Engineer Intern

Batch: 2024, 2025

Apply: https://www.linkedin.com/jobs/view/3692344146

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

vector<int> Solve(int N, int K) {
    vector<int> slots(K, 0);

    int bagCount = 1;
    while (N > 0) {
        for (int i = 0; i < K && N > 0; ++i) {
            if (bagCount <= N) {
                slots[i] += bagCount;
                N -= bagCount;
                bagCount++;
            } else {
                slots[i] += N;
                N = 0;
            }
        }
    }

    return slots;
}

int main() {
    int N, K;
    cin >> N >> K;
    vector<int> result = Solve(N, K);
    for (int bags : result) {
        cout << bags << " ";
    }
    cout << endl;
    return 0;
}

Bag Distribution Algorithm C++✅

Company Name: Zerodha

Role: Frontend Intern

Batch eligible: 2024 grads only

Apply: https://careers.zerodhafundhouse.com/jobs/ybkmnewaO6cf/frontend-intern

Company Name: RD&X Network

Role: Software Development Intern

Batch eligible: 2022 and 2023 grads (2024 also if there cllg will allow onsite internship)

Apply: https://bit.ly/3ssuP7h

Finastra is hiring SDE Interns

For 2022/2023/2024 Grads

https://careers.finastra.com/jobs/8241

Maximum binary sum
Bny Mellon ✅

Swiggy is hiring for 6 months full time intern role (2023 and 2024 grads eligible)

Apply: https://docs.google.com/forms/d/e/1FAIpQLSf-S4Kqkz5TcmpE9vyDcVjODEoHaVNJ-EjqiPSWCebcrhG_Ew/viewform

Seagate is hiring 2023/2024 Grads


https://seagatecareers.com/job/Pune-Intern-Seagate-Research-Group/1007615300/

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int f = 0;
    int s = 1;
    int ans = 0;
    if (n == 0)
    {
        cout << 0;
    }
    if (n == 1)
    {
        cout << 1;
    }
    for (int i = 2; i <= n; i++)
    {
        ans = f + s;
        f = s;
        s = ans;
    }
    cout << ans;
}

#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n)
{
    for (int i = 2; i <= sqrt(n); i++)
        if (n % i == 0)
            return false;
    return true;
}
int main()
{
    int n, m;
    cin >> n >> m;
    int a = 0;
    int b = 0;
    while (n < m)
    {
        if (isPrime(n))
        {
            a = n;
            break;
        }
        n++;
    }
    while (n < m)
    {
        if (isPrime(m))
        {
            b = m;
            break;
        }
        m--;
    }
    cout << a + b;
    return 0;
}

public static void main(String[] args) {
        String[] arr =new String[]{"aa", "aab", "b", "bbd", "d"};
        String tar = "aabbd";
        int len = tar.length();
        int[] dp = new int[len+1];
        Arrays.fill(dp, 9999);
        dp[0] = 0;
        for(int i = 1; i <= len; i++) {
            int cal = 0;
            for(int j = 1; j <= i; j++) {
                String sub = tar.substring(j-1,i);
                boolean found = false;
                for(int k = 0; k < arr.length; k++) {
                    if(arr[k].startsWith(sub)){
                        found = true;break;
                    }
                }
                if(found)dp[i] = Math.min(dp[i], 1 + dp[j-1]);
                System.out.print(i + " " + dp[i] + "    ");
            }
            // dp[i] = cal;
        }
        System.out.println(dp[len]);
    }

equal string trilogy ✅

def solve(arr, target):
   
    ans = -1
    s = 0
   
    for i in range(len(arr)):
        s += arr[i]
        if s>=target:
            ans = i
            break
   
    return ans

Company Name: CloudSEK

Role: SDE - Backend Intern

Batch eligible: 2022 and 2023 grads

Apply: https://www.linkedin.com/jobs/view/3699008130

Company Name: LinkedIn

Role: SDE Intern

Batch eligible: 2025 grads only

Apply: https://www.linkedin.com/jobs/view/3694138424

Company Name: Router.gg

Role: SDE Intern - iOS

Batch eligible: 2024 grads only

Location: Delhi

Duration: 6-9 months.

Apply: https://www.linkedin.com/jobs/view/3702890647

P.S: Only go if your cllg allow you to do on-site internship.

Micron Hiring !!!

Role - Data Engineer

CTC - 20 lpa

Batch - 2023,22,21,20

https://careers.micron.com/careers/job/17504660