๐๐ฆ ๐๐น๐ด๐ผ ๐ป ๐ ใ๐๐ผ๐บ๐ฝ๐ฒ๐๐ถ๐๐ถ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ดใ
Photo
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define MAXN 100001
#define INF 1e18+1
int solve(int matrixsizes , vector&arr , int start , int end , int diceroll)
{
matrixsizes = matrixsizes*matrixsizes;
unordered_map<int , int>mp;
for(int i = 0 ; i < arr.size() ; i+=2)
{
mp[arr[i]] = arr[i+1];
}
vector<int>visited(matrixsizes+1 ,0);
queue<pair<int, int>>q;
q.push({start , 0});
while(!q.empty())
{
int step = q.front().second;
int pos = q.front().first;
q.pop();
if(pos == end) return step;
for(int k = 1 ; k<= diceroll ; k++)
{
int loc = pos+k;
if(loc>matrixsizes) break;
if(visited[loc] == 1)continue;
visited[loc] = 1;
if(mp.find(loc) != mp.end())
{
q.push({mp[loc] , step+1});
}
else q.push({loc , step+1});
}
}
return -1;
}
int main(){
#ifndef ONTLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int m, diceroll;
cin>>m>>diceroll;
int n ;
cin>>n;
vector<int>nums;
for(int i = 0 ; i < n ; i++)
{
int x , y;
cin>>x>>y;
nums.push_back(x);
nums.push_back(y);
}
int s ,e;
cin>>s>>e;;
cout<<solve(m , nums , s , e ,diceroll);
return 0;
}
Cisco โ
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define MAXN 100001
#define INF 1e18+1
int solve(int matrixsizes , vector&arr , int start , int end , int diceroll)
{
matrixsizes = matrixsizes*matrixsizes;
unordered_map<int , int>mp;
for(int i = 0 ; i < arr.size() ; i+=2)
{
mp[arr[i]] = arr[i+1];
}
vector<int>visited(matrixsizes+1 ,0);
queue<pair<int, int>>q;
q.push({start , 0});
while(!q.empty())
{
int step = q.front().second;
int pos = q.front().first;
q.pop();
if(pos == end) return step;
for(int k = 1 ; k<= diceroll ; k++)
{
int loc = pos+k;
if(loc>matrixsizes) break;
if(visited[loc] == 1)continue;
visited[loc] = 1;
if(mp.find(loc) != mp.end())
{
q.push({mp[loc] , step+1});
}
else q.push({loc , step+1});
}
}
return -1;
}
int main(){
#ifndef ONTLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int m, diceroll;
cin>>m>>diceroll;
int n ;
cin>>n;
vector<int>nums;
for(int i = 0 ; i < n ; i++)
{
int x , y;
cin>>x>>y;
nums.push_back(x);
nums.push_back(y);
}
int s ,e;
cin>>s>>e;;
cout<<solve(m , nums , s , e ,diceroll);
return 0;
}
Cisco โ
vector<vector<vector<int>>> memo;
int N;
int dp(int r1, int c1, int c2, vector<vector<int>> &grid)
{
int r2 = r1+c1-c2;
if(r1==Nr2==N c1==Nc2==N grid[r1][c1]==-1||grid[r2][c2]==-1)
return INT_MIN;
else if(r1==N-1 && c1==N-1)
return grid[r1][c1];
else if(memo[r1][c1][c2]!=INT_MIN)
return memo[r1][c1][c2];
else
{
int ans = grid[r1][c1];
if(r1!=r2 || c1!=c2)
ans+=grid[r2][c2];
ans+=max({dp(r1, c1+1, c2+1, grid), dp(r1+1, c1, c2+1, grid), dp(r1, c1+1, c2, grid), dp(r1+1, c1, c2, grid)});
memo[r1][c1][c2] = ans;
return ans;
}
}
int cherryPickup(vector<string>& grid1) {
N = grid1.size();
vector<vector<int>> grid2(N,vector<int>(N));
for(int i=0;i<N;i++){
string s = grid1[i];
for(int j=0;j<N;j++){
char c=s[j];
if(c=='*')grid2[i][j]=0;
if(c=='$')grid2[i][j]=1;
if(c=='X')grid2[i][j]=-1;
}
}
memo.resize(N, vector<vector<int>>(N, vector<int>(N, INT_MIN)));
return 2*max(0, dp(0, 0, 0, grid2));
}
Mango
Cisco โ
int N;
int dp(int r1, int c1, int c2, vector<vector<int>> &grid)
{
int r2 = r1+c1-c2;
if(r1==N
return INT_MIN;
else if(r1==N-1 && c1==N-1)
return grid[r1][c1];
else if(memo[r1][c1][c2]!=INT_MIN)
return memo[r1][c1][c2];
else
{
int ans = grid[r1][c1];
if(r1!=r2 || c1!=c2)
ans+=grid[r2][c2];
ans+=max({dp(r1, c1+1, c2+1, grid), dp(r1+1, c1, c2+1, grid), dp(r1, c1+1, c2, grid), dp(r1+1, c1, c2, grid)});
memo[r1][c1][c2] = ans;
return ans;
}
}
int cherryPickup(vector<string>& grid1) {
N = grid1.size();
vector<vector<int>> grid2(N,vector<int>(N));
for(int i=0;i<N;i++){
string s = grid1[i];
for(int j=0;j<N;j++){
char c=s[j];
if(c=='*')grid2[i][j]=0;
if(c=='$')grid2[i][j]=1;
if(c=='X')grid2[i][j]=-1;
}
}
memo.resize(N, vector<vector<int>>(N, vector<int>(N, INT_MIN)));
return 2*max(0, dp(0, 0, 0, grid2));
}
Mango
Cisco โ
Guys Linkedin Test mails received for Summer Intern?
12 September hackerrank
12 September hackerrank
using namespace std;
int maximumProfit(vector<int>& prices) {
int n = prices.size();
if (n <= 1) return 0;
int maxProfit = 0;
for (int i = 0; i < n - 1; ++i) {
if (prices[i] < prices[i+1]) {
int buy = prices[i];
int sell = prices[i+1];
for (int j = i + 2; j < n; ++j) {
if (prices[j] > sell) {
sell = prices[j];
}
}
maxProfit = max(maxProfit, sell - buy);
}
}
return maxProfit;
}
int maximumProfit(vector<int>& prices) {
int n = prices.size();
if (n <= 1) return 0;
int maxProfit = 0;
for (int i = 0; i < n - 1; ++i) {
if (prices[i] < prices[i+1]) {
int buy = prices[i];
int sell = prices[i+1];
for (int j = i + 2; j < n; ++j) {
if (prices[j] > sell) {
sell = prices[j];
}
}
maxProfit = max(maxProfit, sell - buy);
}
}
return maxProfit;
}
๐๐ฆ ๐๐น๐ด๐ผ ๐ป ๐ ใ๐๐ผ๐บ๐ฝ๐ฒ๐๐ถ๐๐ถ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ดใ
using namespace std; int maximumProfit(vector<int>& prices) { int n = prices.size(); if (n <= 1) return 0; int maxProfit = 0; for (int i = 0; i < n - 1; ++i) { if (prices[i] < prices[i+1]) { int buy = prices[i]; โฆ
Python 3โ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Recroot
Role: Software Engineer Trainee
Batch eligible: 2022 and 2023 grads
Apply: https://recroot.io/jobs/Software%20Engineer/Software%20Engineer%20Trainee/64f6d325b65f2dbd38ccb207
P.S: Only go if you donโt have any other offer in hand.
Role: Software Engineer Trainee
Batch eligible: 2022 and 2023 grads
Apply: https://recroot.io/jobs/Software%20Engineer/Software%20Engineer%20Trainee/64f6d325b65f2dbd38ccb207
P.S: Only go if you donโt have any other offer in hand.
recroot.io
Software Engineer | Recroot
Recroot is a Next Gen Jobs Platform Connecting Organisations with Remote Tech Professionals through Permanent, Contract and Freelancing Recruitment Solutions.
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Motherson Group is hiring for freshers
Interested candidates can apply at prannoy.kaushik@motherson.com
Interested candidates can apply at prannoy.kaushik@motherson.com
Python 3โ
Maximize OR Sum
Maximize OR Sum
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
ADP Hiring Associate Software Engineer
Location - Chennai
Link to apply ๐
https://jobs.adp.com/job/18985583/associate-software-engineer-chennai-in/#
Location - Chennai
Link to apply ๐
https://jobs.adp.com/job/18985583/associate-software-engineer-chennai-in/#
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
IDFC FIRST BANK is Hiring !!
Role: Data Engineer- Freshers
Experience: 0-3 year's
Expected CTC: 12-16 Lpa
Location: Mumbai
Apply here- https://ekjx.fa.em2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1/requisitions/preview/100726
Role: Data Engineer- Freshers
Experience: 0-3 year's
Expected CTC: 12-16 Lpa
Location: Mumbai
Apply here- https://ekjx.fa.em2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1/requisitions/preview/100726
IDFC FIRST Bank Careers
Data Engineer
Role/ Job Title: Data Engineer Business: New Age Function/ Department: Data & Analytics Place of Work: Mumbai Roles & Responsibilities: 'Minimum 0-3 years of Data Engineering experience Proven experience in in SQL, Spark, Hadoop ecosystem Have worked on multipleโฆ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
โElectronics Trainee Engineerโโฆ!!
Job Requirements:
โข Fresher BE/Diploma is required (Electronics).
โข Knowledge of MS-Office software (Windows, Word, Excel, PowerPoint and Outlook).
Required skills:
โข Knowledge of electronic components.
โข Knowledge of various electronic testing equipmentโs.
โข Basic understanding of Electronic hardware design.
โข Perform validation process for various auto electric parts.
โข Test system/ Test adaptor maintenance and fault analysis / troubleshooting.
โข Knowledge of PCB designing techniques.
โข Knowledge of vehicle electrical Architecture & standards is added advantage.
Interested Candidates kindly share updated resume on asavari.jadhav@hitachiastemo.com
Job Requirements:
โข Fresher BE/Diploma is required (Electronics).
โข Knowledge of MS-Office software (Windows, Word, Excel, PowerPoint and Outlook).
Required skills:
โข Knowledge of electronic components.
โข Knowledge of various electronic testing equipmentโs.
โข Basic understanding of Electronic hardware design.
โข Perform validation process for various auto electric parts.
โข Test system/ Test adaptor maintenance and fault analysis / troubleshooting.
โข Knowledge of PCB designing techniques.
โข Knowledge of vehicle electrical Architecture & standards is added advantage.
Interested Candidates kindly share updated resume on asavari.jadhav@hitachiastemo.com
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Jade Global
Role: Associate Analyst
Batch eligible: 2023 grads only
Location: Pune
Apply: https://bit.ly/3EKIERL
Role: Associate Analyst
Batch eligible: 2023 grads only
Location: Pune
Apply: https://bit.ly/3EKIERL
Jadeglobal
Jade Global
Jade Global Current Opening
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Yellow.ai is hiring for QA Intern role.
Batch eligible: 2023 grads only
If interested send your resume to ritika.anand@yellow.ai
Batch eligible: 2023 grads only
If interested send your resume to ritika.anand@yellow.ai
Python 3โ
Walmart
Walmart