INFOSYS EXAM SOLUTIONS

I will send Cisco code here https://t.me/coding_are Share your frd this group

Flipkart assistant manager round 2 interview help successfully completed by remote access 👍👍👍♿♿ All answers provided on time with 💯 correct answer ✅ Contact for placement exam @srksvk

Mitel Communications Private interview successfully completed by remote access 👍👍👍 All answers provided on time with 💯% correct answer ✅✅ Contact for placement exam @srksvk

Amazon sde exam successfully completed by remote access 👍👍👍♿♿♿ 2/2 code passed with all tests caes passed ✅✅ Contact for placement exam @srksvk

Flipkart assistant manager first round interview CLEARED 🎉🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳 Helped proof 👇👇👇👇 https Contact for placement exam @srksvk

Uber Cisco, Amazon Any off campus or on campus exam  help available Contact fast and book your slots Contact @srksvk 200% suree clearance grauntee 🔥   Remote access available All company interview help available with sure clearance gaurntee

2pm Wipro interview help successfully completed by remote access 👍👍👍👍👍 All answers provided on time with 💯% correct answer ✅✅ Contact for placement exam @srksvk 200% suree clearance gaurntee ✅

Flipkart assistant manager exam successfully completed by remote access 👍👍👍👍 All answers provided on time with 💯% correct answer ✅ Contact for placement exam @srksvk

Apple Cisco, Amazon

Any off campus or on campus exam  help available

Contact fast and book your slots Contact @srksvk

200% suree clearance grauntee

🔥   Remote access available All company interview help available with sure clearance gaurntee

Amazon wow exam successfully completed by remote access 👍👍👍👍👍 All MCQ done with 💯% correct answer ✅✅.. 1/1 code done with all tests caes passed ✅ Contact for placement exam @srksvk

Apple Cisco COGNIZANT, Amazon Wipro Principal global services Capgemini Microsoft Any off campus or on campus exam  help available Contact fast and book your slots Contact @srksvk 200% suree clearance grauntee 🔥   Remote access available All company interview help available with sure clearance gaurntee

LinkedIn exam CLEARED 🎉🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳🥳 Got Next round mail 🎉🎉🎉🎉🎉💯💯💯💯💯 Congratulations bro🎉🎉 Helped proof 👇👇👇👇 Contact for placement exam @srksvk

Tiger anylist exam successfully completed by remote access 👍👍👍👍👍👍 2/2 code and 1 sql done with all tests case's passed ✅🔥 Contact for placement exam @srksvk

LinkedIn slot 2 successfully completed by via pic ✅✅ 2/2 codes with all tests cases passed ✅ Contact for placement exam @srksvk

2nd linkdin code✅

public static List getMinSum(List arr, List query, int k) { List result = new ArrayList<>(); int n = arr.size(); for (int z : query) { int minSum = Integer.MAX_VALUE; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { int x = arr.get(i); int y = arr.get(j); if (x == 0 && y == 0) continue; if (x != 0 && z % x == 0) { int a = z / x, b = 0; if (a >= 0) minSum = Math.min(minSum, a + b); } if (y != 0 && z % y == 0) { int a = 0, b = z / y; if (b >= 0) minSum = Math.min(minSum, a + b); } if (x != 0) { for (int a = 0; a <= k; a++) { int rem = z - a * x; if (rem < 0) break; if (y != 0 && rem % y == 0) { int b = rem / y; if (b >= 0 && a + b <= k) { minSum = Math.min(minSum, a + b); } } } } } } result.add(minSum <= k ? minSum : -1); } return result; }

Linkdin first' code✅

import java.util.*; class Result { public static int findMinOperations(List<Integer> arr) { int n = arr.size(); int operations = 0; int rootCount = 0; for (int x : arr) { if (x == -1) rootCount++; } if (rootCount == 0) { arr.set(0, -1); operations++; } else if (rootCount > 1) { boolean found = false; for (int i = 0; i < n; i++) { if (arr.get(i) == -1) { if (!found) { found = true; } else { arr.set(i, 1); operations++; } } } } for (int i = 0; i < n; i++) { int parent = arr.get(i); if (parent != -1 && (parent < 1 || parent > n)) { arr.set(i, 1); operations++; } } boolean[] visited = new boolean[n]; boolean[] inStack = new boolean[n]; for (int i = 0; i < n; i++) { if (!visited[i]) { operations += dfsFixCycle(arr, visited, inStack, i); } } return operations; } private static int dfsFixCycle(List<Integer> arr, boolean[] visited, boolean[] inStack, int node) { int operations = 0; while (node != -1 && !visited[node]) { visited[node] = true; inStack[node] = true; int parent = arr.get(node) == -1 ? -1 : arr.get(node) - 1; if (parent != -1) { if (!visited[parent]) { node = parent; } else if (inStack[parent]) { arr.set(node, -1); operations++; break; } else { break; } } else { break; } } Arrays.fill(inStack, false); return operations; } } public class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); List<Integer> arr = new ArrayList<>(); for (int i = 0; i < n; i++) { arr.add(sc.nextInt()); } System.out.println(Result.findMinOperations(arr)); } }