Globant Hiring
Last Date : 24 June
Apply Link :

https://match.myanatomy.in/sc/62a8c395c31be6250713f33c/n

Career Opportunities for IT & CS Graduates at Sun Life across all India offices
https://docs.google.com/forms/d/e/1FAIpQLSePJFq3-PuUIH6SrOwaQUGICfYu3Y6DmKj87eYRFOf0EbOTNw/viewform

Clumio
Role: MTS Automation / MTS UI Engineer

Batch eligible: Only 2022 passouts ✅

Link:

https://lnkd.in/d-U5HSJP

IBM Kyndryl Off Campus Drive 2022

Post Name: Associate – Technical Engineer

Degree : B.E/B.Tech/M.E/M.Tech/B.Sc/M.Sc/BCA/MCA/Diploma

Experience : freshers

CTC : ₹4.5 LPA*

Location: Across India

Apply Link :


https://krb-sjobs.brassring.com/TGnewUI/Search/home/HomeWithPreLoad?partnerid=26059&siteid=5096&PageType=JobDetails&jobid=595844#jobDetails=595844_5096

bool issafe(int i, int j, vector<vector<int>> &a)
{
int rows = a.size();
int cols = a[0].size();
if (i < 0 or j < 0 or i >= rows or j >= cols or a[i][j] == 0)
{
return false;
}
return true;
}
int distanceTraversed(vector<vector<int>> a)
{
int rows = a.size();
int cols = a[0].size();
if (rows == 0)
{
return 0;
}
int finaldist = -1;
if (a[0][0] == 9)
{
return 0;
}
unordered_map<string, bool> visited;
queue<pair<int, pair<int, int>>> q;
int dist;
q.push({0, {0, 0}});
string s = to_string(0) + "@" + to_string(0);
visited[s] = true;
while (!q.empty())
{
pair<int, pair<int, int>> node = q.front();
q.pop();
if (a[node.second.first][node.second.second] == 9)
{
return node.first;
}
int i = node.second.first;
int j = node.second.second;
dist = node.first;

if (issafe(i - 1, j, a))
{
string str = to_string(i - 1) + "@" + to_string(j);
if (visited.find(str) == visited.end())
{
visited[str] = true;
q.push({dist + 1, {i - 1, j}});
}
}

if (issafe(i, j - 1, a))
{
string str = to_string(i) + "@" + to_string(j - 1);
if (visited.find(str) == visited.end())
{
visited[str] = true;
q.push({dist + 1, {i, j - 1}});
}
}

if (issafe(i, j + 1, a))
{
string str = to_string(i) + "@" + to_string(j + 1);
if (visited.find(str) == visited.end())
{
visited[str] = true;
q.push({dist + 1, {i, j + 1}});
}
}

if (issafe(i + 1, j, a))
{
string str = to_string(i + 1) + "@" + to_string(j);
if (visited.find(str) == visited.end())
{
visited[str] = true;
q.push({dist + 1, {i + 1, j}});
}
}
}
if (finaldist == -1)
{
return -1;
}
return dist;
}


Approach :


we are using BFS here and we know that even if we are traversing
a particular level, the distance will always be incremented by 1
only once, ultimately the distance would be minimum.
and if integer representing the minimum distance traversed to remove the
obstacle else return -1.
Time Complexity:- O(mn)
Space Complexity:- O(mn) // for queue

Amazon ✅

If interested then send your resume over to shreya.a@caratlane.com

Back to Basics ❤

❗️ColorTokens Off Campus Drive❗️

🎖 Batch - 2021 & 2022
💰 CTC - 7LPA

📝 Link - match.myanatomy.in/sc/627c05dc3a1eaf3b0b5daced/n

Extract user message from transcript
IBM✅
C++ language

GFG hiring part time mentors.

JD:

https://drive.google.com/file/d/1HVSGsm_dgLtT_6fMMMLbkm8dALiSKObN/view


Application form:

https://docs.google.com/forms/d/e/1FAIpQLSfCq-vlTGUS7FwL7tshFVkGs2OyOatlNcuAwIH6_JxnpNe_7w/viewform