Round 1 (DSA + Problem Solving): Given a binary grid with exactly two islands (groups of 1s), find the minimum number of 0s that must be flipped to 1s to connect the two islands. I have provided the code I wrote in the interview below ```cpp #include #include #include #include #include #include #include #include #include #include using namespace std; vector>direction={{-1,0},{0,-1},{0,1},{1,0}}; bool insideBoundary(int x,int y,int height,int width){ return (x>=0 and y>=0 and x>&grid){ queue> multiSourceBfs; vector>dist(height,vector(width,INT_MAX)); pairsource={-1,-1}; for(int row=0;row> bfs; bfs.push(source); while(!bfs.empty()){ pair node= bfs.front(); bfs.pop(); if(dist[node.first][node.second] node= multiSourceBfs.front(); multiSourceBfs.pop(); if(grid[node.first][node.second]==1 and dist[node.first][node.second]>0) return dist[node.first][node.second]-1; for(auto dir:direction){ int nx=node.first+dir.first,ny=node.second+dir.second; if(insideBoundary(nx,ny,height,width) and dist[nx][ny]>dist[node.first][node.second]+1){ dist[nx][ny]=dist[node.first][node.second]+1; multiSourceBfs.push({nx,ny}); } } } return -1; } int main() { int height, width; cin>>height>>width; vector>grid(height,vector(width,0)); for(int row=0;row>grid[row][col]; } } int ans=minDistance(height,width,grid); cout<<"Ans: "< #include #include #include #include #include #include using namespace std; struct order{ int order_id; int customer_id; string status; order(int order_id,int customer_id,string status): order_id(order_id),customer_id(customer_id),status(status){} }; class markCompletedOrder{ unordered_map statusToStatusCode={ {"cancelled",0}, {"placed",1}, {"processed",2}, {"shipped",3}, {"delivered",4} }; vectororders; unordered_map>orderStatusmap; // key=>order_id, value: set vectorcancelled,completed; void CountCompletedOrder(){ for(auto ord:orders){ if(statusToStatusCode.find(ord.status)==statusToStatusCode.end()){ cout<<"[Error] : invalid status code"<allStatus=val.second; if(*allStatus.begin()==0){ cancelled.push_back(val.first); continue; } if(allStatus.size()==statusToStatusCode.size()-1){ completed.push_back(val.first); } } } public: markCompletedOrder(vector&orders){ this->orders=orders; CountCompletedOrder(); } int getCompletedOrder(){ return completed.size(); } int getCancelledOrder(){ return cancelled.size(); } vectorcompletedOrder(){ return completed; } }; int main() { int countOrders; cin>>countOrders; vectororders; for(int i=0;i>order_id>>customer_id>>status; orders.push_back(order(order_id,customer_id,status)); } markCompletedOrder *completed= new markCompletedOrder(orders); cout<getCompletedOrder()<completedOrder()){ cout<