MTHREE exam help ! Infosys exam help ! Cognizant exam help ! Amazon exam answer

Share this screenshot big group for next answer

LOOP MASTER CODE DONE (FULLY ACCEPTED) ✅✅✅✅ FOLLOW & SHARE OUR CHANNEL WE WILL UPLOAD MORE CODES ✅ @codeing_are

NEED more TCS CODEVITA ANSWERS ? Give heart to this post ❤️ Fully passed code 👍

Next very soon upload ing But everyone share my group 😔 https://t.me/codeing_are

From alternating string

Fast

If you want then share the. My group https://t.me/codeing_are

Proof of desert queen

https://t.me/codeing_are Share the channel everyone ✅ Fast guys 👍👍

NEED more TCS CODEVITA ANSWERS ? Give heart to this post ❤️ Fully passed code 👍

#include <iostream> #include <vector> #include <numeric> using namespace std; class WorkSchedule { public: WorkSchedule(int employees, int pairs, vector<pair<int, int>>& relations, int threshold) { this->employees = employees; this->pairs = pairs; this->relations = relations; this->threshold = threshold; this->attendance = vector<int>(employees, 1); this->totalAttendance = 0; this->days = 0; this->friends.resize(employees); createGraph(); } void createGraph() { for (auto& relation : relations) { friends[relation.first - 1].push_back(relation.second - 1); friends[relation.second - 1].push_back(relation.first - 1); } } int runSimulation() { while (totalAttendance < threshold) { days++; int dailyAttendance = accumulate(attendance.begin(), attendance.end(), 0); totalAttendance += dailyAttendance; vector<int> nextAttendance(employees, 0); for (int i = 0; i < employees; ++i) { int numFriendsWFO = 0; for (int friendIdx : friends[i]) { if (attendance[friendIdx] == 1) { numFriendsWFO++; } } if (attendance[i] == 1) { if (numFriendsWFO == 3) { nextAttendance[i] = 1; } else { nextAttendance[i] = 0; } } else { if (numFriendsWFO < 3) { nextAttendance[i] = 1; } else { nextAttendance[i] = 0; } } } attendance = nextAttendance; } return days; } private: int employees, pairs, threshold, totalAttendance, days; vector<int> attendance; vector<vector<int>> friends; vector<pair<int, int>> relations; }; int main() { int employees, pairs; cin >> employees >> pairs; vector<pair<int, int>> relations(pairs); for (int i = 0; i < pairs; ++i) { cin >> relations[i].first >> relations[i].second; } int threshold; cin >> threshold; WorkSchedule schedule(employees, pairs, relations, threshold); cout << schedule.runSimulation() << endl; return 0; }

Now share group Everyone's please 🥺🥺🥺🥺 https://t.me/codeing_are Show share group everyone ✅✅✅✅✅✅

Next answer uploaded

NEED more TCS CODEVITA ANSWERS ? Give heart to this post ❤️

import java.util.*; public class ShapeMatcher { public static List<Integer> coordinateShift(List<int[]> shape) { int minX = shape.stream().mapToInt(p -> p[0]).min().orElse(0); int minY = shape.stream().mapToInt(p -> p[1]).min().orElse(0); List<int[]> shifted = new ArrayList<>(); for (int[] point : shape) { shifted.add(new int[]{point[0] - minX, point[1] - minY}); } return convertToSortable(shifted); } public static List<int[]> rotateShape(List<int[]> shape) { List<int[]> rotated = new ArrayList<>(); for (int[] point : shape) { rotated.add(new int[]{-point[1], point[0]}); } return rotated; } public static List<Integer> convertToSortable(List<int[]> shape) { List<Integer> sortable = new ArrayList<>(); for (int[] point : shape) { sortable.add(point[0]); sortable.add(point[1]); } Collections.sort(sortable); return sortable; } public static boolean compareShapes(List<int[]> shape1, List<int[]> shape2) { if (shape1.size() != shape2.size()) return false; List<Integer> base1 = coordinateShift(shape1); List<Integer> base2 = coordinateShift(shape2); for (int i = 0; i < 4; i++) { if (base1.equals(base2)) return true; shape2 = rotateShape(shape2); base2 = coordinateShift(shape2); } return false; } public static void findMatchingShapes(List<List<int[]>> shapes) { int n = shapes.size(); for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (compareShapes(shapes.get(i), shapes.get(j))) { System.out.print((i + 1) + " " + (j + 1)); return; } } } } public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int shapeCount = scanner.nextInt(); List<List<int[]>> shapes = new ArrayList<>(); for (int i = 0; i < shapeCount; i++) { int vertexCount = scanner.nextInt(); List<int[]> shape = new ArrayList<>(); for (int j = 0; j < vertexCount; j++) { int x = scanner.nextInt(); int y = scanner.nextInt(); shape.add(new int[]{x, y}); } shapes.add(shape); } findMatchingShapes(shapes); scanner.close(); } } Find pair( java)

NEED more TCS CODEVITA ANSWERS ? Give heart to this post ❤️

#include <iostream> #include <string> #include <vector> #include <unordered_map> using namespace std; int dp(string& s, vector<string>& v, unordered_map<string, int>& memo) { if (memo.count(s)) return memo[s]; int m = 0; for (auto& x : v) { size_t p = s.find(x); if (p != string::npos) { string t = s.substr(0, p) + s.substr(p + x.size()); m = max(m, 1 + dp(t, v, memo)); } } return memo[s] = m; } int main() { int n; cin >> n; vector<string> v(n); for (int i = 0; i < n; ++i) { cin >> v[i]; } string s; cin >> s; unordered_map<string, int> memo; cout << dp(s, v, memo) ; return 0; } Guys change variable ✅✅✅✅✅✅