https://www.linkedin.com/posts/priyanshu-panwar_samsung-srib-job-activity-6947446398439014400-FfGC?utm_source=linkedin_share&utm_medium=android_app

If want they go and ask for referral

Publicis Sapient Hackathon

Batch eligible: 2023 and 2024 passouts

Round 1: Online Quiz Round 2: Online Coding Challenge Round 3: Jumpstart

Apply Link:

https://lnkd.in/dc6PDYwH

Note : Last day of Registration is Ist July, 2022

Only for those who had given TCS NQT in the past.

Hitachi Vantara
Role: Associate
Batch eligible: 2022 passouts only
CTC: 5LPA (including 5% variable pay)

Link: https://learning.tcsionhub.in/jobs/HITACHI-VANTARA-INDIA-PRIVATE-LIMITED/Associate-2434/

L&T Technology Services
Batch eligible: 2021 and 2022 passouts
(Only Aerospace and Mechanical passouts)

Apply Link: https://docs.google.com/forms/d/e/1FAIpQLSdSohdaRyZdm6iVIfLzjqaknRpSe09XJB192oKtp4MBb9k6QA/viewform

Share this opportunity among your friends who are from Aerospace and Mechanical branch.

#HelpEveryone

As placement for 2023 batch is coming, so what u guys want from me....

Like resume review, mock interview, interview experience or any other thing which you guys want, feel free to tell in comment, I will try to help till what I can 😊✅

https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1

✅✅✅✅✅✅✅✅✅✅✅
javascript sol using recursion

Code
_------------------------------------
let solve =(m,n,c,res,i,j)=>{
//base case

if (i==n-1 && j==n-1){
res.push(c);
return ;
}
let val = m[i][j]
m[i][j]=-1

// right
if (j+1<n && m[i][j+1]==1){
solve(m,n,c+"R",res,i,j+1);
}

// down
if (i+1<n && m[i+1][j]==1){
solve(m,n,c+"D",res,i+1,j);
}

// up
if (i-1>=0 && m[i-1][j]==1){
solve(m,n,c+"U",res,i-1,j);
}

//left

if (j-1>=0 && m[i][j-1]==1){
solve(m,n,c+"L",res,i,j-1);
}
m[i][j]=val;
}

class Solution {
findPath(m,n){
//code here
let c="";
let res=[];
let i=0,j=0;
if (m[0][0]==0){
return res;
}
solve(m,n,c,res,i,j);
res.sort();
return res;
}
}

Amdocs is hiring (Only female candidates)
CTC: 5LPA + 20k (relocation bonus)
Batch eligible: 2022 passouts only

https://jobs.amdocs.com/job/Bhurai-In-Off-Campus-2022_Women-Drive-MH/902362900/

Eagleview hiring
Role: Software Engineer 1 backend
Batch eligible: 2022 passouts

Apply Link: https://recruit.hirebridge.com/v3/careercenter/v2/details.aspx?jid=579190&cid=7600&locvalue=1093

P.S. Apply through referral for increase your chance😊✅

Evalground is hiring
Batch eligible: 2022, 2023 and 2024 passouts

Stipend: 15K to 18K per month.

P.S. Highly recommend for 2023 and 2024 batch for intern 😊✅

Test Link: https://evalground.com/code4/#/publicview/test/candidate/token/anyamtwc

Apply Link: https://www.linkedin.com/jobs/view/3141037144

D Cube Analytics is hiring for 2022 grad.

https://docs.google.com/forms/d/e/1FAIpQLSdd3Z_LsxAQpDx6lhgcVPtimqiZicNXr84tWgVLkm-lKWx6uQ/viewform

long long solve(int N, vector<int> A)
{
vector<long long> vec1, vec2(N);
int max_so_far = 0, max_ending_here = 0;
vec1.push_back(0);
vec2.push_back(0);
for (int i = 0; i < A.size(); i++)
{
max_so_far += A[i];
if (max_so_far > max_ending_here)
max_ending_here = max_so_far;
if (max_so_far < 0)
max_so_far = 0;
vec1.push_back(max_ending_here);
}
max_so_far = 0;
max_ending_here = 0;
for (int i = A.size() - 1; i >= 0; i--)
{
max_so_far += A[i];
if (max_so_far > max_ending_here)
{
max_ending_here = max_so_far;
}
if (max_so_far < 0)
max_so_far = 0;
vec2[i] = max_ending_here;
}
long long ans = 0;
for (int i = 0; i <= N; i++)
{
ans = max(ans, vec1[i] + vec2[i]);
}
return ans;
}
Source - unknown


Phonepe: Two Subarray (C++)✅

Lowe's India hackathon + chance of interview

Eligible batch: Only 2023 passouts
Selection process:
1) MCQ Challenge
2) Coding Challenge
3) Profile Verification
4) Interview round

Link: https://unstop.com/o/wF3IP1g?lb=Mgx4BsU

//Given Array A having N integers and divisor K
int morethanNbyK(vector<int> arr, int n, int k)
{
int x = n / k;
int ans = 0;
unordered_map<int, int> freq;
for (auto i : arr)
freq[i]++;
for (auto i : freq)
{
if (i.second > x)
{
ans += i.first;
}
}
return ans;
}

Infosys ✅