❗️GLOBANT OffCampus Drive❗️

🎖 Batch - 2020 & 2021
💰 CTC - 4.8LPA
📝 Link - bit.ly/3OpsboY

MCQ KYT

1q)sass
Softwares as a service
A
2q)navigational
A
True
3q) drawback
D
Cost of computing
4q) cloud service are
B.
True.
5q)the paradgism
C
Progessive

SQL

1)in a sql primary
A
True
2)from player where
A
Whose 2nd letter
3)the agreegate function
A
True
4)name like v per t
Ends with t
B
5)order by age runs
A
Then on runs

Raw agent code python3

Replace s with given parameter name
Don't write 1st and last line

❗️ZOHO OffCampus Drive❗️

🎖 Batch - 2015 & 2022
📝 Link - bit.ly/3QRsP0k

Remove things that don't 𝐂𝐎𝐍𝐓𝐑𝐈𝐁𝐔𝐓𝐄 to your 𝐆𝐑𝐎𝐖𝐓𝐇😊❤️

# A motivational quote to start your day with 😊

Texas Instruments for 2022/2021/2020 passouts.

CTC : 32 Lakhs

Do send it to core ECE students! 😊

https://ti.wecreateproblems.com/

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;
}
}