Pool Hiring Drive for 10 Companies

Expected CTC: upto 25 lakhs
Batch: 2024, 2023, 2022, 2021

Interview Process:
AI Interview
In-person Interviews
Offer

Apply here: https://next-level.onelink.me/g1SJ/v2t0abqx

Google hiring SWE

Many are reaching out to me for #referrals.

Due to the high volume, manually checking messages and downloading resumes is challenging.

Please use the link below to fill out the referral

https://docs.google.com/forms/d/e/1FAIpQLScM2vFlxe3DtxOZlUB82wMSRJi6gn0xXlD2JZcdpHXw1IlExg/viewform

This will allow me to view everything in a dashboard and refer you efficiently!

Company: Sanofi!
Position: Trainee Data Analyst
Experience: Freshers (0 - 1 Years)
Location: Hyderabad, India

https://sanofi.wd3.myworkdayjobs.com/SanofiCareers/job/Hyderabad/Trainee-Data-Analyst_R2748187

Amazon ML Summer School
Batch 2025 and 2026
https://xathon.mettl.com/event/amazonmlsummerschool

🚀 Hiring Alert at TDPVista! 🚀
We are excited to announce that TDPVista is hiring for the following roles:
- VueJS Developer
- MERN Stack Developer
- Flutter Developer

Job Details:

Internship Duration: 3 months
Post Placement Offer (PPO): Up to 6 LPA
Location: Indore & Bhopal
📧 Email your resume to: ea@tdpvista.com

Park+ is hiring SDE Intern (Frontend) role.

Intern: Atleast one internship experience.
Apply: https://docs.google.com/forms/d/e/1FAIpQLScNioMF5SydDkvb9O8esZc117TXg2_DDVljxkXewdyaEEnUbA/viewform

What an idea 😂
#systemDesign

CGI is hiring Freshers!
Position: Cyber Security
Qualifications: Bachelor’s/ Master’s Degree
Salary: 5 - 7 LPA (Expected)
Experience: Fresher
Location: Bangalore, India

📌Apply Now: https://cgi.njoyn.com/corp/xweb/xweb.asp?clid=21001&page=jobdetails&jobid=J0624-0119&BRID=1135170&SBDID=943

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll minimum_digit(ll n,ll sum)
{
    if(sum==0) return -1;
    if(n==1) return -1;
    if(sum>9*n) return -1;
    string ans;
    sum--;
    n--;
    for(ll i=n-1;i>0;i--)
    {
        if(sum>9) sum-=9,ans+=('9');
        else ans+=('0'+sum),sum=0;
    }
    ans+=('0'+sum+1);
    reverse(ans.begin(),ans.end());
    //cout<<ans<<endl;
    char c=ans[0];
    string tt="";
    tt+=c;
    tt+='0';
    tt+=ans.substr(1);
     return stoll(tt);   
}
signed main()
{
    ll n,sum; cin>>n>>sum;
    cout<<minimum_digit(n,sum);
}

Digit sum zero ✅

def minimum_digit(numDigits, sumDigits):
    # Write your code here
    if numDigits == 1 and sumDigits == 0:
        return -1
   
    # Start generating numbers from the smallest numDigits number
    for num in range(10(numDigits - 1), 10numDigits):
        digits = list(map(int, str(num)))
        digit_sum = sum(digits)
        digit_product = 1
       
        for digit in digits:
            digit_product *= digit
       
        if digit_sum == sumDigits and digit_product == 0:
            return num
   
    # If no number satisfies the conditions
    return -1

Digit sum zero ✅

#include <iostream>
#include <vector>
#include <map>
using namespace std;
void findPerm(vector<int>& nums) {
    int N = nums.size();
    map<int, int> hashmap;

    for (int num : nums) {
        if (num >= 1 && num <= N) {
            hashmap[num]++;
        } else {
            hashmap[num] = 1e9;
        }
    }

    vector<int> missing;
    for (int num = N; num >= 1; num--) {
        if (!hashmap.count(num)) {
            missing.push_back(num);
        }
    }

    for (int& num : nums) {
        if(missing.size()==0) break;
        if (--hashmap[num] > 0) {
            num = missing.back();
            missing.pop_back();
        }
        hashmap[num]--;
    }
}

DE Shaw ✅

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int minimizeMismatchScore(string& s1, string& s2, int x, int y) {
    int m = s1.size();
    int n = s2.size();
    vector<vector<int>> dp(m + 1, vector<int>(n + 1, 0));
   
    for (int i = 1; i <= m; ++i) {
        dp[i][0] = i * x;
    }
    for (int j = 1; j <= n; ++j) {
        dp[0][j] = j * x;
    }
   
    for (int i = 1; i <= m; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (s1[i - 1] == s2[j - 1]) {
                dp[i][j] = dp[i - 1][j - 1];
            } else {
                dp[i][j] = min({ dp[i - 1][j] + x, dp[i][j - 1] + x, dp[i - 1][j - 1] + y });
            }
        }
    }
   
    return dp[m][n];
}

  DE Shaw ✅

public static int minsteps(List<Integer> cityMap, int rows, int cols, int maxsteps) {
        int[][] grid = new int[rows][cols];
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                grid[i][j] = cityMap.get(i * cols + j);
            }
        }
        int[][] dp = new int[rows][cols];
        for (int[] row : dp) {
            Arrays.fill(row, Integer.MAX_VALUE);
        }
        dp[0][0] = 0;

        int[] dx = {-1, 1, 0, 0};
        int[] dy = {0, 0, -1, 1};

        for (int steps = 0; steps <= maxsteps; steps++) {
            for (int i = 0; i < rows; i++) {
                for (int j = 0; j < cols; j++) {
                    if (dp[i][j] == Integer.MAX_VALUE) continue;

                    for (int k = 0; k < 4; k++) {
                        int ni = i + dx[k];
                        int nj = j + dy[k];
                        if (ni >= 0 && ni < rows && nj >= 0 && nj < cols && grid[ni][nj] == 0) {
                            dp[ni][nj] = Math.min(dp[ni][nj], dp[i][j] + 1);
                        }
                    }
                }
            }
        }

        if (dp[rows - 1][cols - 1] == Integer.MAX_VALUE) {
            return -1;
        } else {
            return dp[rows - 1][cols - 1];
        }
    }

Urban Navigator ✅