📌 Cactus Labs is Hiring !!
Batch: 2024,2025, 2026

Role: Intern, Frontend Engineer: https://jobs.cactusglobal.com/jobs/1465/job

Role: Intern, Backend Python Engineer: https://jobs.cactusglobal.com/jobs/1463/job

Role: Intern, Full Stack development: https://jobs.cactusglobal.com/jobs/1462/job

PESTO is hiring

Role: SDE Backend

Location: Remote

📌 Apply here:

https://apps.pesto.tech/sign-up/?source=golang_devs_linkedin

class Solution {
public:
     void bfs(vector<vector<int>>&vis,vector<vector<char>>&grid,int i,int j,int n,int m)
    {
        vis[i][j]=1;
        queue<pair<int,int>>q;
        q.push({i,j});
        while(!q.empty())
        {
            int row=q.front().first;
            int col=q.front().second;
            q.pop();
            int delrow[4]={1,0,-1,0};
            int delcol[4]={0,1,0,-1};
                   for(int k=0;k<=3;k++){
                    int nrow=row+delrow[k];
                    int ncol=col+delcol[k];
                    if(nrow>=0 and nrow<n and ncol>=0 and ncol<m and grid[nrow][ncol]=='1' and !vis[nrow][ncol])
                    {
                        vis[nrow][ncol]=1;
                        q.push({nrow,ncol});
                    }
                }
            }
        }
    int numIslands(vector<vector<char>>& grid) {
    int n=grid.size();
        int m=grid[0].size();
        vector<vector<int>>vis(n,vector<int>(m,0));
        int cnt=0;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                if(!vis[i][j] and grid[i][j]=='1')
                {
                    cnt++;
                    bfs(vis,grid,i,j,n,m);
                }
            }
        }
        return cnt;
    }
};

Zeta ✅

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

vector<int> solution(vector<int> a, int n, int k) {
    vector<int> v;
    deque<int> dq;

    for (int i = 0; i < n; i++) {
        while (!dq.empty() && dq.front() <= i - k)
            dq.pop_front();

        while (!dq.empty() && a[dq.back()] <= a[i])
            dq.pop_back();

        dq.push_back(i);

        if (i >= k - 1)
            v.push_back(a[dq.front()]);
    }

    return v;
}

int main() {
    int n, k;
    cin >> n >> k;

    vector<int> a(n);
    for (int i = 0; i < n; i++)
        cin >> a[i];

    vector<int> result = solution(a, n, k);

    for (int i = 0; i < result.size(); i++)
        cout << result[i] << " ";

    return 0;
}. 

//cricket match ✅
Zeta

string make_string_S_to_T(string S) {
    string T=“programming”;
    bool possible = false;
    int M = T.length();
    int N = S.length();
    for (int i = 0; i <= M; i++) {
        int prefix_length = i;
        int suffix_length = M - i;
        string prefix = S.substr(0, prefix_length);
        string suffix = S.substr(N - suffix_length, suffix_length);
        if (prefix + suffix == T) {
            possible = true;
            break;
        }
    }
    if (possible)
        return "YES";
    else
        return "NO";
}

Deleting substring ✅
Zeta

Company Name: Paypal

Role: Software Engineer 1

Batch eligible: 2024 passouts only

Apply: https://paypal.eightfold.ai/careers/job/274895394546

Company Name: Beepkart

Role: Frontend Intern

Batch eligible: 2024 and 2025 passouts

Apply: https://docs.google.com/forms/d/e/1FAIpQLSeCsoRzgIG7YTMVIU3DOcx4V0t-M-u5yqsZhEc7QTcIJHQcEA/viewform?usp=send_form

Company Name : Rubrik

Role : SDE Internship - Winter

Stipend : 1.5 Lakh/month

Link to apply : https://www.proelevate.in/job/software-engineering-winter-intern

Anyone got this mail

Only 2024 Batch

https://docs.google.com/forms/d/e/1FAIpQLScina5CPWyUWETfo7sMtR7gtKEwlEvF6j1sNOkMp-qSe_SDzQ/viewform

Apply, if you're interested!!

package Graph;

import java.util.*;

public class Largest_Sum_Cycle
{

public static int solution(int arr[])
{
  ArrayList<Integer>sum=new ArrayList<>();
 
  for(int i=0;i<arr.length;i++)
  {
  
   ArrayList<Integer>path=new ArrayList<>();
  
   int j=i;
  
   int t=0;
  
  while(arr[j]<arr.length&&arr[j]!=i&&arr[j]!=-1&&!path.contains(j))
  {
   path.add(j);
   t+=j;
   j=arr[j];
   if(arr[j]==i)
   {
    t+=j;
    break;
   }
  }
  if(j<arr.length&&i==arr[j])
   sum.add(t);
  }
  if(sum.isEmpty())
   return -1;
 
  return Collections.max(sum);
 
}

public static void main(String[] args)
{
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
int testcases=sc.nextInt();
for(int loop=0;loop<testcases;loop++)
{
int numofBlocks=sc.nextInt();
int arr[]=new int[numofBlocks];
int src,dest;
for(int i=0;i<numofBlocks;i++)
{
arr[i]=sc.nextInt();
}
System.out.println(solution(arr));
}
}
}

Juspay ✅

import java.util.Scanner;
import java.util.*;

public class metting
{

    public static void helperFunction()
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] edges = new int[n];
       
        for (int i = 0; i < n; i++)
        {
            edges[i] = sc.nextInt();
        }
       
        int C1 = sc.nextInt();
        int C2 = sc.nextInt();
        // int ans=minimumWeight(n,edges,C1,C2);
        // System.out.println(ans);


  //  public static int minimumWeight(int n, int[] edges, int C1, int C2) {
        List<List<Integer>> list = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            list.add(new ArrayList<Integer>());
        }
        for (int i = 0; i < n; i++) {
            if (edges[i] != -1) {
                list.get(i).add(edges[i]);
            }
        }

        long[] array1 = new long[n];
        long[] array2 = new long[n];
        Arrays.fill(array1, Long.MAX_VALUE);
        Arrays.fill(array2, Long.MAX_VALUE);

        juspay(C1, list, array1);
        juspay(C2, list, array2);

        int node = 0;
        long dist = Long.MAX_VALUE;
        for (int i = 0; i < n; i++) {
            if (array1[i] == Long.MAX_VALUE || array2[i] == Long.MAX_VALUE)
                continue;

            if (dist > array1[i] + array2[i]) {
                dist = array1[i] + array2[i];
                node = i;
            }
        }
        if (dist == Long.MAX_VALUE)
        System.out.print(-1);
            //return -1;
       // return node;
         System.out.print(node);
    }
    private static void juspay(int start, List<List<Integer>> graph, long[] distances)
    {
        PriorityQueue<Integer> pq = new PriorityQueue<>();
        pq.offer(start);
        distances[start] = 0;
        while (!pq.isEmpty())
        {
            int curr = pq.poll();
            for (int neighbor : graph.get(curr))
            {
                long distance = distances[curr] + 1;
                if (distance < distances[neighbor])
                {
                    distances[neighbor] = distance;
                    pq.offer(neighbor);
                }
            }
        }
    }
    public static void main(String[] args) {
     metting m = new metting();
        metting.helperFunction();
    }
}

Nearest meeting Cell
Juspay ✅

QA Intern at HappyFox

Internship Details:

Full-time Paid Internship
Internship duration: 6 months
Mode of work: Work from office (Guindy, Chennai)
Full time opportunity will be available to interns with good performance

APPLY - https://happyfox.hire.trakstar.com/jobs/fk0xy99