Deloitte | COGNIZANT | IBM | CAPGEMINI

def transform_to_smallest_prime( input1, input2): from collections import deque N, K = str(input1), input2 n = len(N) def is_prime(x): if x < 2: return False if x % 2 == 0 and x != 2: return False d = 3 while d * d <= x: if x % d == 0: return False d += 2 return True q = deque([(N, 0)]) seen = {N: 0} best_prime = None while q: cur, steps = q.popleft() if steps <= K: val = int(cur) if cur[0] != '0' and is_prime(val): if best_prime is None or val < best_prime: best_prime = val if steps < K: for i in range(n): d = int(cur[i]) for nd in [d - 1, d + 1]: if 0 <= nd <= 9: nxt = cur[:i] + str(nd) + cur[i+1:] if nxt not in seen or seen[nxt] > steps + 1: seen[nxt] = steps + 1 q.append((nxt, steps + 1)) return best_prime if best_prime is not None else -1 //prime transformation✅✅ VIRTUSA✅

def longest_decay_path(input1, input2, input3, input4, input5): N, M = input1, input2 grid = input3 start_x, start_y = input4, input5 directions = [(-1, 0), (1, 0), (0, -1), (0, 1)] dp = [[-1] * M for _ in range(N)] def dfs(x, y): if dp[x][y] != -1: return dp[x][y] max_len = 1 for dx, dy in directions: nx, ny = x + dx, y + dy if 0 <= nx < N and 0 <= ny < M and grid[nx][ny] < grid[x][y]: max_len = max(max_len, 1 + dfs(nx, ny)) dp[x][y] = max_len return dp[x][y] return dfs(start_x, start_y) //Decay Trail Optimization✅ VIRTUSA✅✅

def find_equal_biomass_cut(input1, input2, input3): n = input1 biomass = input2 edges = input3 graph = [[] for _ in range(n)] for u, v in edges: graph[u].append(v) graph[v].append(u) total = sum(biomass) if total % 2 != 0: return [-1, -1] target = total // 2 valid_cuts = [] visited = [False] * n def dfs(node): visited[node] = True subtotal = biomass[node] for nei in graph[node]: if not visited[nei]: sub = dfs(nei) subtotal += sub if sub == target: valid_cuts.append(sorted([node, nei])) return subtotal dfs(0) if not valid_cuts: return [-1, -1] valid_cuts.sort() return valid_cuts[0] //Equal Biomass Partition✅✅

def uniqueArrangements( input1, input2, input3): n = input1 k = input2 arr = input3 unique_patterns = set() for i in range(n - k + 1): new_pattern = tuple(arr[:i] + arr[i + k:]) unique_patterns.add(new_pattern) return len(unique_patterns) //The Robot Transmission Filter✅

CPAGEMINI 1-PM OA HELP AVAILABLE✅✅ contact : @MLCODER2

class SolutionClass { public static void main(String[] args) { Scanner sc=new Scanner(System.in); String s = sc.nextLine().trim(); int k= 0; for (int i = 0; i < s.length(); i++) { char c = s.charAt(i); if (c >= '0' && c <= '9') k += (c - '0'); } System.out.println(s + solve(k)); } private static int solve(int n) { if (n <= 1) return n; int a = 0, b = 1; while (b < n) { int c = a + b; a = b; b = c; } return b; } } //kingdom communication✅ CAPGEMINI✅

import java.util.*; class SolutionClass { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int K = sc.nextInt(); String s = sc.next(); Set<Integer>set= new HashSet<>(); for (int i = 0; i < K; i++) set.add(sc.nextInt()); StringBuilder sb = new StringBuilder(); int i = 0; while (i < n) { int j = i + 1; while (j < n && s.charAt(j) == s.charAt(i)) j++; int len = j - i; if (!set.contains(len)) { sb.append(s, i, j); } i = j; } System.out.println(sb.length() == 0 ? "ERROR" : sb.toString()); } } //consecutive characters✅ CAPGEMINI✅