allcoding1

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT 📌Linux 📌Networking 📌Design patterns 📌Donet 📌Docker 📌Entity framework 📌Node.js 📌ASP. Net 📌Aps. Net cro 📌java 📌JavaScript 📌full stack developer Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources  English , 🇫🇷 𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋  𝐂𝐎𝐔𝐑𝐒𝐄 ⚡️ Reconnaissance and Footprinting ⚡️ Network Scanning ⚡️ Enumeration ⚡️ Firewalls HIDs Honeypot ⚡️ Malware and Threats ⚡️ Mobile Platform ⚡️ Pentesting ⚡️ Sql Injection ⚡️ System Hacking ⚡️ Web Application ⚡️ Wireless Network ⚡️ Cloud Computing ⚡️ Web Server ⚡️ Social Engineering ⚡️ Session Hijacking ⚡️ Sniffing ⚡️ BufferOverflow ⚡️ Cryptography ⚡️ Denial Of Service All courses (60 rupees) Lifetime access Contact:- @meterials_available

Company Name - AnyDesk Job Role - Technical Support Associate Location - Bengaluru Batch - 2023/2024 Package - INR 5 - 8 LPA Apply Here - https://job-boards.eu.greenhouse.io/anydesk/jobs/4473601101?gh_src=4913a0b2teu

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT 📌Linux 📌Networking 📌Design patterns 📌Donet 📌Docker 📌Entity framework 📌Node.js 📌ASP. Net 📌Aps. Net cro 📌java 📌JavaScript 📌full stack developer Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources  English , 🇫🇷 𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋  𝐂𝐎𝐔𝐑𝐒𝐄 ⚡️ Reconnaissance and Footprinting ⚡️ Network Scanning ⚡️ Enumeration ⚡️ Firewalls HIDs Honeypot ⚡️ Malware and Threats ⚡️ Mobile Platform ⚡️ Pentesting ⚡️ Sql Injection ⚡️ System Hacking ⚡️ Web Application ⚡️ Wireless Network ⚡️ Cloud Computing ⚡️ Web Server ⚡️ Social Engineering ⚡️ Session Hijacking ⚡️ Sniffing ⚡️ BufferOverflow ⚡️ Cryptography ⚡️ Denial Of Service All courses (50 rupees) Lifetime access Contact:- @meterials_available

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT 📌Linux 📌Networking 📌Design patterns 📌Donet 📌Docker 📌Entity framework 📌Node.js 📌ASP. Net 📌Aps. Net cro 📌java 📌JavaScript 📌full stack developer Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources  English , 🇫🇷 𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋  𝐂𝐎𝐔𝐑𝐒𝐄 ⚡️ Reconnaissance and Footprinting ⚡️ Network Scanning ⚡️ Enumeration ⚡️ Firewalls HIDs Honeypot ⚡️ Malware and Threats ⚡️ Mobile Platform ⚡️ Pentesting ⚡️ Sql Injection ⚡️ System Hacking ⚡️ Web Application ⚡️ Wireless Network ⚡️ Cloud Computing ⚡️ Web Server ⚡️ Social Engineering ⚡️ Session Hijacking ⚡️ Sniffing ⚡️ BufferOverflow ⚡️ Cryptography ⚡️ Denial Of Service All courses (50 rupees) Lifetime access Contact:- @meterials_available

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT 📌Linux 📌Networking 📌Design patterns 📌Donet 📌Docker 📌Entity framework 📌Node.js 📌ASP. Net 📌Aps. Net cro 📌java 📌JavaScript 📌full stack developer Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources  English , 🇫🇷 𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋  𝐂𝐎𝐔𝐑𝐒𝐄 ⚡️ Reconnaissance and Footprinting ⚡️ Network Scanning ⚡️ Enumeration ⚡️ Firewalls HIDs Honeypot ⚡️ Malware and Threats ⚡️ Mobile Platform ⚡️ Pentesting ⚡️ Sql Injection ⚡️ System Hacking ⚡️ Web Application ⚡️ Wireless Network ⚡️ Cloud Computing ⚡️ Web Server ⚡️ Social Engineering ⚡️ Session Hijacking ⚡️ Sniffing ⚡️ BufferOverflow ⚡️ Cryptography ⚡️ Denial Of Service All courses (150 rupees) Lifetime access Contact:- @meterials_available

MIUM RESOURCES ➙Data science ➙Python ➙Artificial Intelligence . ➙AWS Certified . ➙Cloud ➙BIG DATA ➙Data Analytics ➙BI ➙Google Cloud Platform ➙IT Training ➙MBA ➙Machine Learning ➙Deep Learning ➙Ethical Hacking ➙SPSS ➙Statistics ➙Data Base ➙Learning language resources ( English , French , German ) All courses at 30 rupees Contact:- @meterials_available

Wipro Eligibility criteria 10th Standard: Pass 12th Standard: Pass Graduation – 60% or 6.0 CGPA and above as applicable by the University guidelines Year of Passing 2023, 2024 Qualification Bachelor of Computer Application - BCA Bachelor of Science- B.Sc. Eligible Streams-Computer Science, Information Technology, Mathematics, Statistics, Electronics, and Physics Apply now:- https://app.joinsuperset.com/join/#/signup/student/jobprofiles/c10ac320-3871-4fb2-9053-d8a58b52ea18

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT 📌Linux 📌Networking 📌Design patterns 📌Donet 📌Docker 📌Entity framework 📌Node.js 📌ASP. Net 📌Aps. Net cro 📌java 📌JavaScript 📌full stack developer Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources  English , 🇫🇷 𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋  𝐂𝐎𝐔𝐑𝐒𝐄 ⚡️ Reconnaissance and Footprinting ⚡️ Network Scanning ⚡️ Enumeration ⚡️ Firewalls HIDs Honeypot ⚡️ Malware and Threats ⚡️ Mobile Platform ⚡️ Pentesting ⚡️ Sql Injection ⚡️ System Hacking ⚡️ Web Application ⚡️ Wireless Network ⚡️ Cloud Computing ⚡️ Web Server ⚡️ Social Engineering ⚡️ Session Hijacking ⚡️ Sniffing ⚡️ BufferOverflow ⚡️ Cryptography ⚡️ Denial Of Service All courses (150 rupees) Lifetime access Contact:- @meterials_available

*Trellix* is hiring for Software Engineer Role *Roles:* Software Engineer (6+ years) *Location:* Bangalore, IN *Category:* Software Engineering *Employment Type:* Full-time *Link to Apply* https://careers.trellix.com/jobs/software-engineer-java/

Roadmap for Front-End Development 🚀 Day 1-5: UI/UX basics (Figma). Day 6-14: Master HTML & CSS. Day 15-21: Dive into JavaScript. Day 21-25: Design-to-code. Day 26-30: Build projects. Free Frontend UI/UX Masterclass with Certification, Limited seats available! Register now👇 @itjobsservices

📌IT learning courses 📌All programing courses 📌Abdul bari courses 📌Ashok IT 📌Linux 📌Networking 📌Design patterns 📌Donet 📌Docker 📌Entity framework 📌Node.js 📌ASP. Net 📌Aps. Net cro 📌java 📌JavaScript 📌full stack developer Tutorials + Books + Courses + Trainings + Workshops + Educational Resources 🔹Data science 🔹Python 🔹Artificial Intelligence 🔹AWS Certified 🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources  English , 🇫🇷 𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋  𝐂𝐎𝐔𝐑𝐒𝐄 ⚡️ Reconnaissance and Footprinting ⚡️ Network Scanning ⚡️ Enumeration ⚡️ Firewalls HIDs Honeypot ⚡️ Malware and Threats ⚡️ Mobile Platform ⚡️ Pentesting ⚡️ Sql Injection ⚡️ System Hacking ⚡️ Web Application ⚡️ Wireless Network ⚡️ Cloud Computing ⚡️ Web Server ⚡️ Social Engineering ⚡️ Session Hijacking ⚡️ Sniffing ⚡️ BufferOverflow ⚡️ Cryptography ⚡️ Denial Of Service All courses (150 rupees) Lifetime access Contact:- @meterials_available

) ** 2 start_section = end_section = None for idx, section in enumerate(sections): for row in section: if 'S' in row: start_section = idx if 'D' in row: end_section = idx other_sections = [i for i in range(total_sections) if i not in {start_section, end_section}] min_path = float('inf') for perm in itertools.permutations(other_sections): order = [start_section] + list(perm) + [end_section] rebuilt_grid = rebuild_grid(order, sections, size, block_size) min_path = min(min_path, shortest_path(rebuilt_grid, size)) return min_path if name == "main": print(main()) ALTERNATING STRING import java.util.Scanner; public class AlternatingStringProcessor { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); String binaryString = scanner.nextLine(); int length = binaryString.length(); int[] values = new int[length]; for (int i = 0; i < length; i++) { values[i] = scanner.nextInt(); } int result = 0; int currentDigit = binaryString.charAt(0) - '0'; int lastValue = values[0]; for (int i = 1; i < length; i++) { int nextDigit = binaryString.charAt(i) - '0'; if (nextDigit == currentDigit) { result += Math.min(lastValue, values[i]); lastValue = Math.max(lastValue, values[i]); } else { currentDigit = nextDigit; lastValue = values[i]; } } System.out.println(result); } } TCS CodeVita @itjobsservices

target_idx += 1 sub_idx += 1 total_deletions = len(sub_str) - match_length return match_length, total_deletions def process_input(): inp = sys.stdin.read().splitlines() pos = 0 num_strings = int(inp[pos].strip()) pos += 1 Office rostering code #include <iostream> #include <vector> #include <set> #include <algorithm> using namespace std; int main() { int n, m, k, days = 1, activeCount = 0; cin >> n >> m; vector<set<int>> connections(n); for (int i = 0, u, v; i < m; ++i) { cin >> u >> v; connections[u].insert(v); connections[v].insert(u); } cin >> k; vector<bool> active(n, true); activeCount = n; while (activeCount < k) { vector<bool> nextState(n, false); for (int i = 0; i < n; ++i) { int neighborCount = 0; for (int neighbor : connections[i]) { neighborCount += active[neighbor]; } if (active[i] && neighborCount == 3) { nextState[i] = true; } else if (!active[i] && neighborCount < 3) { nextState[i] = true; } } active = nextState; activeCount += count(active.begin(), active.end(), true); ++days; } cout << days; return 0; } BUZZ DAY SALE #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n; cin >> n; vector<int> ids(n), costs(n); for (int i = 0; i < n; i++) cin >> ids[i]; for (int i = 0; i < n; i++) cin >> costs[i]; int budget; cin >> budget; int maxItems = 0, minCost = 0; for (int i = 0; i < n; i++) { int itemCost = costs[i]; int quantity = budget / itemCost; if (quantity > 0) { int currentItems = 0, currentCost = 0; for (int j = 0; j < n; j++) { if (i != j && ids[i] % ids[j] == 0) { currentItems += quantity; currentCost += costs[j] * quantity; } } if (currentItems > maxItems || (currentItems == maxItems && currentCost > minCost)) { maxItems = currentItems; minCost = currentCost; } } } cout << maxItems << " " << minCost << endl; return 0; } Arrange map code from collections import deque import itertools def shortest_path(grid, n): start, end = None, None for i in range(n): for j in range(n): if grid[i][j] == 'S': start = (i, j) elif grid[i][j] == 'D': end = (i, j) queue = deque([(start, 0)]) visited = {start} while queue: (x, y), distance = queue.popleft() if (x, y) == end: return distance for nx, ny in [(x+1, y), (x-1, y), (x, y+1), (x, y-1)]: if 0 <= nx < n and 0 <= ny < n and (nx, ny) not in visited and grid[nx][ny] != 'T': visited.add((nx, ny)) queue.append(((nx, ny), distance + 1)) return float('inf') def split_grid(grid, size, block): sections = [] for i in range(0, size, block): for j in range(0, size, block): block_section = [grid[x][j:j+block] for x in range(i, i+block)] sections.append(block_section) return sections def rebuild_grid(order, sections, size, block): full_grid = [["" for _ in range(size)] for _ in range(size)] num_blocks = size // block for index, section_index in enumerate(order): section = sections[section_index] row_offset = (index // num_blocks) * block col_offset = (index % num_blocks) * block for i in range(block): for j in range(block): full_grid[row_offset + i][col_offset + j] = section[i][j] return full_grid def main(): size, block_size = map(int, input().split()) original_grid = [list(input().strip()) for _ in range(size)] sections = split_grid(original_grid, size, block_size) total_sections = (size // block_size

"10001", "10001", "00100", "10001", "10001", "10000", "10001", "10001", "10001", "10000", "10001", "10010", "00001", "00100", "10001", "01010", "10101", "00000", "00001", "00000"}, {"10001", "11111", "11111", "11111", "11111", "10000", "11111", "10001", "11111", "11111", "10001", "11111", "10001", "10001", "01110", "10000", "11111", "10001", "11111", "00100", "11111", "00100", "11111", "10001", "11111", "11111"} }; vector code(26, ""); for (int row = 0; row < 9; row++) { for (int col = 0; col < 26; col++) { code[col] += A[row][col]; } } map mp; for (char ch = 'A'; ch <= 'Z'; ch++) { mp[code[ch - 'A']] = ch; } vector B; for (string s; cin >> s; B.push_back(s)); for (int L = 0, R = 0; R < (int)B[0].size(); R++) { int zeros = 0; for (int row = 0; row < 9; row++) { zeros += B[row][R] == '0'; } if (zeros == 9) { L = R + 1; } else if (R - L + 1 == 5) { string pl; for (int row = 0; row < 9; row++) { pl += B[row].substr(L, 5); } if (mp.count(pl)) { cout << mp[pl]; } L = R + 1; } } return 0; } Matrix rotation def rotate_layer(layer, pos, direction, odd_layer): n = len(layer) rotated_layer = [None] * n if direction == "clockwise": for i in range(n): rotated_layer[(i + pos) % n] = layer[i] else: for i in range(n): rotated_layer[(i - pos) % n] = layer[i] for i in range(n): if odd_layer: rotated_layer[i] = chr(((ord(rotated_layer[i]) - ord('A') - 1) % 26) + ord('A')) else: rotated_layer[i] = chr(((ord(rotated_layer[i]) - ord('A') + 1) % 26) + ord('A')) return rotated_layer def adjust_query(plan, row, col, size): layers = [] for layer in range(size // 2): current_layer = [] for j in range(col + layer, col + size - layer): current_layer.append(plan[row + layer][j]) for i in range(row + layer + 1, row + size - layer - 1): current_layer.append(plan[i][col + size - layer - 1]) for j in range(col + size - layer - 1, col + layer - 1, -1): current_layer.append(plan[row + size - layer - 1][j]) for i in range(row + size - layer - 2, row + layer, -1): current_layer.append(plan[i][col + layer]) layers.append(current_layer) for lidx, layer in enumerate(layers): odd_layer = (lidx + 1) % 2 == 1 direction = "counterclockwise" if odd_layer else "clockwise" pos = lidx + 1 rotated_layer = rotate_layer(layer, pos, direction, odd_layer) idx = 0 for j in range(col + lidx, col + size - lidx): plan[row + lidx][j] = rotated_layer[idx] idx += 1 for i in range(row + lidx + 1, row + size - lidx - 1): plan[i][col + size - lidx - 1] = rotated_layer[idx] idx += 1 for j in range(col + size - lidx - 1, col + lidx - 1, -1): plan[row + size - lidx - 1][j] = rotated_layer[idx] idx += 1 for i in range(row + size - lidx - 2, row + lidx, -1): plan[i][col + lidx] = rotated_layer[idx] idx += 1 def perform_rotation(n, plan, queries): for row, col, size in queries: adjust_query(plan, row, col, size) return ''.join(''.join(row) for row in plan) n = int(input()) plan = [list(input().strip()) for _ in range(n)] q = int(input()) queries = [tuple(map(int, input().split())) for _ in range(q)] result = perform_rotation(n, plan, queries) print(result, end="") HELP RITIKA import sys import math def get_max_prefix_length_and_deletions(sub_str, target_str, start_idx): sub_idx, target_idx, match_length = 0, start_idx, 0 while sub_idx < len(sub_str) and target_idx < len(target_str): if sub_str[sub_idx] == target_str[target_idx]: match_length += 1

Count press #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 maxRemoval = 0; for (auto& x : v) { size_t pos = s.find(x); if (pos != string::npos) { string new_string = s.substr(0, pos) + s.substr(pos + x.size()); maxRemoval = max(maxRemoval, 1 + dp(new_string, v, memo)); } } return memo[s] = maxRemoval; } int main() { int n; cin >> n; vector<string> substrings(n); for (int i = 0; i < n; ++i) { cin >> substrings[i]; } string mainString; cin >> mainString; unordered_map<string, int> memo; cout << dp(mainString, substrings, memo); return 0; } FOLDER AREA #include <iostream> #include <cmath> #include <set> #include <iomanip> #include <vector> #include <utility> using namespace std; pair<double, double> reflectPoint(double px, double py, double x1, double y1, double x2, double y2) { double A = y2 - y1; double B = x1 - x2; double C = x2 * y1 - x1 * y2; double distance = (A * px + B * py + C) / sqrt(A * A + B * B); double reflectedX = px - 2 * distance * (A / sqrt(A * A + B * B)); double reflectedY = py - 2 * distance * (B / sqrt(A * A + B * B)); return {reflectedX, reflectedY}; } int main() { double area; cout << "Enter area of the square: "; cin >> area; double x1, y1, x2, y2; cout << "Enter the coordinates of the line (x1 y1 x2 y2): "; cin >> x1 >> y1 >> x2 >> y2; double side = sqrt(area); vector<pair<double, double>> corners = { {0, 0}, {0, side}, {side, side}, {side, 0} }; set<pair<double, double>> uniquePoints(corners.begin(), corners.end()); for (const auto& corner : corners) { auto [rx, ry] = reflectPoint(corner.first, corner.second, x1, y1, x2, y2); uniquePoints.insert({rx, ry}); } for (const auto& point : uniquePoints) { cout << fixed << setprecision(2) << point.first << " " << point.second << endl; } return 0; } Segment display #include <bits/stdc++.h> using namespace std; int main() { vector<vector<string>> A = { {"11111", "11111", "11111", "11111", "11111", "11111", "11111", "10001", "11111", "11111", "10001", "10000", "11111", "10001", "01110", "11111", "11111", "11111", "11111", "11111", "10001", "10001", "10001", "10001", "10001", "11111"}, {"10001", "10001", "10000", "10001", "10000", "10000", "10000", "10001", "00100", "00001", "10010", "10000", "10101", "11001", "10001", "10001", "10001", "10001", "10000", "00100", "10001", "10001", "10001", "00000", "10001", "00000"}, {"10001", "10001", "10000", "10001", "10000", "10000", "10000", "10001", "00100", "00001", "10100", "10000", "10101", "10101", "10001", "10001", "10001", "10001", "10000", "00100", "10001", "10001", "10001", "01010", "10001", "00010"}, {"10001", "10001", "10000", "10001", "10000", "10000", "10000", "10001", "00100", "00001", "11000", "10000", "10101", "10011", "10001", "10001", "10001", "10001", "10000", "00100", "10001", "10001", "10001", "00000", "10001", "00000"}, {"11111", "11111", "10000", "10001", "11111", "11111", "10111", "11111", "00100", "10001", "11111", "10000", "10101", "10001", "10001", "11111", "10101", "11111", "11111", "00100", "10001", "10001", "10101", "00100", "11111", "00100"}, {"10001", "10001", "10000", "10001", "10000", "10000", "10001", "10001", "00100", "10001", "10001", "10000", "10001", "10001", "10001", "10000", "10001", "11000", "00001", "00100", "10001", "10001", "10101", "00000", "00001", "00000"}, {"10001", "10001", "10000", "10001", "10000", "10000", "10001", "10001", "00100", "10001", "10001", "10000", "10001", "10001", "10001", "10000", "10011", "10100", "00001", "00100", "10001", "10001", "10101", "01010", "00001", "01000"}, {"10001", "10001", "10000", "10001", "10000", "10000",

TCS Exam coding Ans 👇👇👇👇👇👇👇👇👇 https://whatsapp.com/channel/0029VamVeZSLdQeWpFUzOC3F

Count press #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 maxRemoval = 0; for (auto& x : v) { size_t pos = s.find(x); if (pos != string::npos) { string new_string = s.substr(0, pos) + s.substr(pos + x.size()); maxRemoval = max(maxRemoval, 1 + dp(new_string, v, memo)); } } return memo[s] = maxRemoval; } int main() { int n; cin >> n; vector<string> substrings(n); for (int i = 0; i < n; ++i) { cin >> substrings[i]; } string mainString; cin >> mainString; unordered_map<string, int> memo; cout << dp(mainString, substrings, memo); return 0; } FOLDER AREA #include <iostream> #include <cmath> #include <set> #include <iomanip> #include <vector> #include <utility> using namespace std; pair<double, double> reflectPoint(double px, double py, double x1, double y1, double x2, double y2) { double A = y2 - y1; double B = x1 - x2; double C = x2 * y1 - x1 * y2; double distance = (A * px + B * py + C) / sqrt(A * A + B * B); double reflectedX = px - 2 * distance * (A / sqrt(A * A + B * B)); double reflectedY = py - 2 * distance * (B / sqrt(A * A + B * B)); return {reflectedX, reflectedY}; } int main() { double area; cout << "Enter area of the square: "; cin >> area; double x1, y1, x2, y2; cout << "Enter the coordinates of the line (x1 y1 x2 y2): "; cin >> x1 >> y1 >> x2 >> y2; double side = sqrt(area); vector<pair<double, double>> corners = { {0, 0}, {0, side}, {side, side}, {side, 0} }; set<pair<double, double>> uniquePoints(corners.begin(), corners.end()); for (const auto& corner : corners) { auto [rx, ry] = reflectPoint(corner.first, corner.second, x1, y1, x2, y2); uniquePoints.insert({rx, ry}); } for (const auto& point : uniquePoints) { cout << fixed << setprecision(2) << point.first << " " << point.second << endl; } return 0; } Segment display #include <bits/stdc++.h> using namespace std; int main() { vector<vector<string>> A = { {"11111", "11111", "11111", "11111", "11111", "11111", "11111", "10001", "11111", "11111", "10001", "10000", "11111", "10001", "01110", "11111", "11111", "11111", "11111", "11111", "10001", "10001", "10001", "10001", "10001", "11111"}, {"10001", "10001", "10000", "10001", "10000", "10000", "10000", "10001", "00100", "00001", "10010", "10000", "10101", "11001", "10001", "10001", "10001", "10001", "10000", "00100", "10001", "10001", "10001", "00000", "10001", "00000"}, {"10001", "10001", "10000", "10001", "10000", "10000", "10000", "10001", "00100", "00001", "10100", "10000", "10101", "10101", "10001", "10001", "10001", "10001", "10000", "00100", "10001", "10001", "10001", "01010", "10001", "00010"}, {"10001", "10001", "10000", "10001", "10000", "10000", "10000", "10001", "00100", "00001", "11000", "10000", "10101", "10011", "10001", "10001", "10001", "10001", "10000", "00100", "10001", "10001", "10001", "00000", "10001", "00000"}, {"11111", "11111", "10000", "10001", "11111", "11111", "10111", "11111", "00100", "10001", "11111", "10000", "10101", "10001", "10001", "11111", "10101", "11111", "11111", "00100", "10001", "10001", "10101", "00100", "11111", "00100"}, {"10001", "10001", "10000", "10001", "10000", "10000", "10001", "10001", "00100", "10001", "10001", "10000", "10001", "10001", "10001", "10000", "10001", "11000", "00001", "00100", "10001", "10001", "10101", "00000", "00001", "00000"}, {"10001", "10001", "10000", "10001", "10000", "10000", "10001", "10001", "00100", "10001", "10001", "10000", "10001", "10001", "10001", "10000", "10011", "10100", "00001", "00100", "10001", "10001", "10101", "01010", "00001", "01000"}, {"10001", "10001", "10000", "10001", "10000", "10000",

) ** 2     start_section = end_section = None     for idx, section in enumerate(sections):         for row in section:             if 'S' in row:                 start_section = idx             if 'D' in row:                 end_section = idx     other_sections = [i for i in range(total_sections) if i not in {start_section, end_section}]     min_path = float('inf')     for perm in itertools.permutations(other_sections):         order = [start_section] + list(perm) + [end_section]         rebuilt_grid = rebuild_grid(order, sections, size, block_size)         min_path = min(min_path, shortest_path(rebuilt_grid, size))     return min_path if name == "main":     print(main()) ALTERNATING STRING import java.util.Scanner; public class AlternatingStringProcessor {     public static void main(String[] args) {         Scanner scanner = new Scanner(System.in);                 String binaryString = scanner.nextLine();         int length = binaryString.length();         int[] values = new int[length];         for (int i = 0; i < length; i++) {             values[i] = scanner.nextInt();         }         int result = 0;         int currentDigit = binaryString.charAt(0) - '0';         int lastValue = values[0];         for (int i = 1; i < length; i++) {             int nextDigit = binaryString.charAt(i) - '0';             if (nextDigit == currentDigit) {                 result += Math.min(lastValue, values[i]);                 lastValue = Math.max(lastValue, values[i]);             } else {                 currentDigit = nextDigit;                 lastValue = values[i];             }         }         System.out.println(result);     } } TCS CodeVita @itjobsservices

TCS Exam coding Ans 👇👇👇👇👇👇👇👇👇 https://whatsapp.com/channel/0029VamVeZSLdQeWpFUzOC3F

Company : NTT Role : Intern Qualification :Bachelor’s / Master’s Batch : 2025 & 2026 Salary : Up to ₹ 6LPA Experience : Fresher’s Location : Bengaluru Apply link : https://careers.services.global.ntt/global/en/job/NTT1GLOBALR121946EXTERNALENGLOBAL/Intern?utm_source=indeed&utm_medium=phenom-feeds Company : Capgemini Role : Deal Centre of Excellence Qualification : Graduate/B Com/BAF Batch : 2024 without any Active Backlogs Salary : Up to ₹ 5 LPA Experience : Fresher’s Location : Mumbai Apply link : https://www.capgemini.com/in-en/solutions/off-campus-drive-for-deal-centre-of-excellence-dcoe-2024-graduates/