CODING SOLUTIONS | IBM | AMAZON CODING SOLUTIONS

🤡Ghost digit guess Language : Java Telegram - Share✅✅ https://t.me/coding_solutions_all

🤡power Product Language : Java Telegram - Share✅✅ https://t.me/coding_solutions_all

🤡oddly balanced Telegram - Share✅✅ https://t.me/coding_solutions_all

🤡 subarray code Language : Java Telegram - Share✅✅ https://t.me/coding_solutions_all

🤡 decoding the alphabet code Language : Java Telegram - Share✅✅ https://t.me/coding_solutions_all

Product of integers in sub arrays code Telegram - Share✅✅ https://t.me/coding_solutions_all

Reverse the string

def countPalin(str): count = 0 # splitting each word as spaces as # delimiter and storing it into a list listOfWords = str.split(" ") # Iterating every element from list # and checking if it is a palindrome. for elements in listOfWords: if (checkPalin(elements)): # if the word is a palindrome # increment the count. count += 1 print (count) # Driver code countPalin("Madam Arora teaches malayalam") countPalin("Nitin speaks malayalam") Python Palindrome count Telegram - Share✅✅ https://t.me/coding_solutions_all

Python Missing Braces Telegram - @coding_solutions_all

Number sum code in c++

May cycle results are still #cooking with ample amount of #luck factor of an individual After all the round table discussion finally , the survey for the August cycle is out on knome. The last date to register is the 30th of this month All patriotic associates can register. A fully frustrated TCSer can ignore. Below are some of the #high_voltage_rules that can hinder your sleep.. 1. Only 2 tech tracks , you can choose this time. 2. Only 1 bizzskill 3. All the assessments will be in the office. 4. register only if u can attend or else HR action will be taken.

🤡TCS New Joiners🤡 💯TCS PRA Java/Python 🆓 Help✅ Those who have PRA on 21st July join for Free Answers 👇👇💯 https://t.me/TCS_PRA_ANSWERS https://t.me/TCS_PRA_ANSWERS https://t.me/TCS_PRA_ANSWERS https://t.me/TCS_PRA_ANSWERS

Join Discussion group to know more https://t.me/tcs_joining_letter https://t.me/tcs_joining_letter https://t.me/tcs_joining_letter

🤡TCS Waiting for joining letter Join to know updates... All will receive in this ______? Join Discussion group to know more https://t.me/tcs_joining_letter https://t.me/tcs_joining_letter https://t.me/tcs_joining_letter

🤡Join 415+ pdf, doc etc uploaded🤡 FRESCO PLAY DISCUSSION GROUP👇 https://t.me/TCS_fresco_play_answers FRESCO PLAY channel👇👇 https://t.me/TCS_FRESCO_PLAY

// jusPay 3rd code int solve(vector<int>& maze) { int n=maze.size(); int maxSum=-1; for(int i=0; i<n; i++) { int node=i; int sum=0; unordered_set<int> 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; } Telegram - Share✅✅ https://t.me/coding_solutions_all

// jusPay 2nd code int solution(vector<int> arr) { int ans = INT_MIN; int result = -1; vector<int> weight(arr.size(), 0); for (int i = 0; i < arr.size(); i++) { int source = i; int dest = arr[i]; if (dest != -1) { weight[dest] += source; if (ans <= weight[dest]) { ans = max(ans, weight[dest]); result = dest; } } } if (ans != INT_MIN) return result; return -1; } Telegram - Share✅✅ https://t.me/coding_solutions_all

// jusPay 1st code public static int Solution(int[] arr, int C1, int C2) { int[] dist = new int[arr.length]; int max = Integer.MAX_VALUE; Arrays.fill(dist, Integer.MAX_VALUE); Queue q = new ArrayDeque<>(); int dis = -1; q.offer(c1); q.offer(max); boolean[] visited = new boolean[arr.length]; while (q.size() > 1) { int vtx = q.poll(); if (vtx == max) { q.offer(vtx); dis++; continue; } visited[vtx] = true; dist[vtx] = Math.min(dis + 1, dist[vtx]); int neigh = arr[vtx]; if (visited[neigh] == false) { q.offer(neigh); } } Arrays.fill(visited, false); q.poll(); q.offer(C2); q.offer(max); int ans = -1; while (q.size() > 1) { int vtx = q.poll(); if (vtx == max) { q.offer(vtx); dis++; continue; } if (visited[vtx] == false && dist[vtx] != max) { ans = vtx; break; } visited[vtx] = true; int neigh = arr[vtx]; if (visited[neigh] == false) { q.offer(neigh); } } return ans; } Telegram - Share✅✅ https://t.me/coding_solutions_all