ACCENTURE | COGNIZANT | IBM | CAPGEMINI

Lti mind tree Exam cleared🥳😍🥳😍 90/100 marks 100% clearance for any exam Contact :@mlcoder2

Nearest meeting cell Language: python 3 #juspay

Maximum weight node Language : python 3 #juspay

largest cycle sum Language python 3

Maximum weight Node #c++ #juspay

#include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; unordered_map<int,int> mp; vector<int> nums(n); for(int i=0; i<n; i++){ cin>>nums[i]; if(nums[i]!=-1) mp[nums[i]]+=i; } int maxi = INT_MIN; int res = 0; for(auto i: mp){ if(maxi<i.second){ maxi=i.second; res = i.first; } } cout<<res; }

Maximum weight Node, #python #Juspay

import collections v=int(input()) l=list(map(int,input().split())) d=collections.defaultdict(int) for k,v in enumerate(l): if v!=-1: d[v]+=k req=max(d.values()) for k,v in d.items(): if v==req: print(k) break

Maximum weight node

int solution(vectorarr){ int ans=INT_MIN; int result=-1; vectorweight(arr.size(),0); for(int i=0;i

largest sum cycle

int solve(vector& maze,int n) { int maxSum=-1; for(int i=0; i visited; while(node < n && node >= 0 && i!=maze[node] && visited.count(node)==0) { visited.insert(node); sum+=node; node=maze[node]; } if(node>=0 && node < n && i == maze[node]) { maxSum=max(maxSum,sum); } } return maxSum; }

Nearest meeting cell

int minimumWeight(int n, vector>& edges, int C1, int C2) { vector A(n,LLONG_MAX), B(n,LLONG_MAX); Dijkstra(C1,graph,A); Dijkstra(C2,graph,B); int node=0 , dist=LLONG_MAX; for(int i=0;i<=n-1;i++){ if(A[i]==LLONG_MAX || B[i]==LLONG_MAX) continue; if(dist>A[i]+B[i]){ dist= A[i]+B[i]; node=i; } } return node; }

Juspay solutions group : https://t.me/cod_solutions

TCS 6PM SOLUTIONS GROUP : https://t.me/cod_solutions

T5 Hands on Successfully done ✅.

That's it from the T5 Hands-on

9:30Am T1-T7 hands on Solutions group : https://t.me/Tcs_wings