allcoding1_official

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/

using System; using System.Collections.Generic; class Program { static void Main() { int N = int.Parse(Console.ReadLine()); var graph = new Dictionary>(); var indegrees = new Dictionary(); for (int i = 0; i < N; i++) { var edge = Console.ReadLine().Split(); string from = edge[0]; string to = edge[1]; if (!graph.ContainsKey(from)) graph[from] = new List(); graph[from].Add(to); if (!indegrees.ContainsKey(from)) indegrees[from] = 0; if (!indegrees.ContainsKey(to)) indegrees[to] = 0; indegrees[to]++; } var words = Console.ReadLine().Split(); var levels = new Dictionary(); var queue = new Queue(); foreach (var node in indegrees.Keys) { if (indegrees[node] == 0) { levels[node] = 1; // Root level is 1 queue.Enqueue(node); } } while (queue.Count > 0) { var current = queue.Dequeue(); int currentLevel = levels[current]; if (graph.ContainsKey(current)) { foreach (var neighbor in graph[current]) { if (!levels.ContainsKey(neighbor)) { levels[neighbor] = currentLevel + 1; queue.Enqueue(neighbor); } indegrees[neighbor]--; if (indegrees[neighbor] == 0 && !levels.ContainsKey(neighbor)) { queue.Enqueue(neighbor); } } } } int totalValue = 0; foreach (var word in words) { if (levels.ContainsKey(word)) { totalValue += levels[word]; } else { totalValue += -1; } } Console.Write(totalValue); } } String Puzzle C+

int main() { string s; cin >> s; int n = s.length(), res = 0; vector v(n); for (int i = 0; i < n; ++i) cin >> v[i]; int lw = s[0] - '0', lwv = v[0]; for (int i = 1; i < n; ++i) { if (s[i] - '0' == lw) { res += min(lwv, v[i]); lwv = max(lwv, v[i]); } else { lw = s[i] - '0'; lwv = v[i]; } } cout << res; return 0; } Form alternating string Change accordingly before submitting to avoid plagiarism

#include<stdio.h> int main() {     int n;     scanf("%d",&n);     int arr[n];     for(int i=0;i<n;i++)     {         scanf("%d",&arr[i]);     }     int count=0;     int num=arr[0];     for(int i=1;i<n;i++)     {        if(num!=arr[i])             count++;     }     printf("%d",count); } Count press

Tcs exam

int main() { string s; cin >> s; int n = s.length(), res = 0; vector v(n); for (int i = 0; i < n; ++i) cin >> v[i]; int lw = s[0] - '0', lwv = v[0]; for (int i = 1; i < n; ++i) { if (s[i] - '0' == lw) { res += min(lwv, v[i]); lwv = max(lwv, v[i]); } else { lw = s[i] - '0'; lwv = v[i]; } } cout << res; return 0; }

#include <iostream> #include <vector> #include <map> #include <set> #include <cmath> #include <algorithm> using namespace std; struct Line { int x1, y1, x2, y2; }; int countCells(Line line, pair<int, int> star, bool split) { if (line.x1 == line.x2) { if (split) { return min(abs(star.second - line.y1), abs(star.second - line.y2)) + 1; } else { return abs(line.y1 - line.y2) + 1; } } else { if (split) { return min(abs(star.first - line.x1), abs(star.first - line.x2)) + 1; } else { return abs(line.x1 - line.x2) + 1; } } } bool intersects(Line a, Line b, pair<int, int>& intersection) { if (a.x1 == a.x2 && b.y1 == b.y2) { if (b.x1 <= a.x1 && a.x1 <= b.x2 && a.y1 <= b.y1 && b.y1 <= a.y2) { intersection = {a.x1, b.y1}; return true; } } if (a.y1 == a.y2 && b.x1 == b.x2) { if (a.x1 <= b.x1 && b.x1 <= a.x2 && b.y1 <= a.y1 && a.y1 <= b.y2) { intersection = {b.x1, a.y1}; return true; } } return false; } int main() { int N, K; cin >> N; vector<Line> lines(N); for (int i = 0; i < N; ++i) { cin >> lines[i].x1 >> lines[i].y1 >> lines[i].x2 >> lines[i].y2; if (lines[i].x1 > lines[i].x2 || (lines[i].x1 == lines[i].x2 && lines[i].y1 > lines[i].y2)) { swap(lines[i].x1, lines[i].x2); swap(lines[i].y1, lines[i].y2); } } cin >> K; map<pair<int, int>, vector<Line>> stars; for (int i = 0; i < N; ++i) { for (int j = i + 1; j < N; ++j) { pair<int, int> intersection; if (intersects(lines[i], lines[j], intersection)) { stars[intersection].push_back(lines[i]); stars[intersection].push_back(lines[j]); } } } int asiylam = 0; for (auto& star : stars) { if (star.second.size() / 2 == K) { vector<int> intensities; for (auto& line : star.second) { intensities.push_back(countCells(line, star.first, true)); } asiylam += *min_element(intensities.begin(), intensities.end()); } } cout << asiylam << endl; return 0; } Magic Star Intensity Code C++ TCS Exam

int main() { int n, m, k, d = 1, rv = 0; cin >> n >> m; vector> f(n); for (int i = 0, u, v; i < m; ++i) { cin >> u >> v; f[u].insert(v); f[v].insert(u); } cin >> k; vector w(n, true); rv = n; while (rv < k) { vector nw(n, false); for (int i = 0; i < n; ++i) { int cnt = 0; for (int fr : f[i]) cnt += w[fr]; if (w[i] && cnt == 3) nw[i] = true; else if (!w[i] && cnt < 3) nw[i] = true; } w = nw; rv += count(w.begin(), w.end(), true); ++d; } cout << d; return 0; } Office Rostering C+ TCS exam

Industrial code

#include<stdio.h> int main() {     int n;     scanf("%d",&n);     int arr[n];     for(int i=0;i<n;i++)     {         scanf("%d",&arr[i]);     }     int count=0;     int num=arr[0];     for(int i=1;i<n;i++)     {        if(num!=arr[i])             count++;     }     printf("%d",count); } C Language TCS 1st Qsn --------------------------------------------------------- N=int(input()) K=int(input()) price=list(map(int,input().split())) vol=list(map(int,input().split())) maxvol=0 volu=0 maxvol=max(vol) for i in range(0,N):     if (maxvol==vol[i] and price[i]<=K):         K=K-price[i]         volu=maxvol for i in range(0,N):     for j in range(i+1,N+1):         if (price[i]<=K and price[i]==price[j]):             if (vol[i]>vol[j]):                 volu=volu+vol[i]                 K=K-price[i]             else:                 volu=volu+vol[j]                 K=K-price[j]         elif (price[i]<=K and price[i]!=price[j]):             K=K-price[i]             ------- include<stdio.h> int main() {     int n;     scanf("%d",&n);     int arr[n];     for(int i=0;i<n;i++)     {         scanf("%d",&arr[i]);     }     int count=0;     int num=arr[0];     for(int i=1;i<n;i++)     {        if(num!=arr[i])             count++;     }     printf("%d",count); } Array Code in C language

Capstoneco Hiring Summer Internship Batch: 2025/2026 Location: London, New York Duration: 10 Weeks Apply now:- https://www.itjobs.services/2024/11/capstoneco-hiring.html

Job and Internships: https://cuvette.tech/app/student/internship/6745c96f4f16f90195bcd183 https://cuvette.tech/app/student/job/6745d306dc08d34ef7e33d35 https://wellfound.com/jobs/3132271-product-engineer-2024-grads?utm_campaign=linkedin_syndication&utm_source=linkedin https://www.ycombinator.com/companies/swipe-2/jobs/vprs8lO-android-intern-onsite-hyderabad?utm_source=syn_li https://careers.gehealthcare.com/global/en/job/GEVGHLGLOBALR4012888EXTERNALENGLOBAL/Software-Intern?utm_source=linkedin&utm_medium=phenom-feeds https://womennovators.com/we/career/details/32 https://app.dover.com/apply/Deccan%20AI/e67320d5-5160-4f8c-abc5-3c6251bf103d?rs=42706078 https://job-boards.greenhouse.io/myntra/jobs/7727819002?gh_src=bb272d8c2 1+year https://krb-sjobs.brassring.com/TGnewUI/Search/home/HomeWithPreLoad?partnerid=26059&siteid=5016&PageType=JobDetails&jobid=767733 https://tnl2.jometer.com/v2/job?jz=5wqzs50b3b2c490247aecf949e0fc6edbc889CMALBBQAAADQ&iis=Job%20Board%20-%20Recruitment%20Marketing&iisn=LinkedIn https://app.greenhouse.io/embed/job_app?token=7204917002&gh_src=wd1vhf https://careers.abb/global/en/job/ABB1GLOBAL94273475EXTERNALENGLOBAL/Associate-Software-Engineer?utm_source=linkedin&utm_medium=phenom-feeds https://assaabloy.jobs2web.com/job/Chennai-Associate-Web-Developer-600-032/1144953201/ https://autodesk.wd1.myworkdayjobs.com/uni/job/Singapore-SGP/Software-Development-Engineer_24WD83728?src=JB-10065&source=LinkedIn https://usource.ripplehire.com/candidate/?token=8YxWjpwDhdL62DFYUIcQ&lang=en&source=USTLINKEDIN&ref=USTLINKEDIN#detail/job/28532 https://alphawave.wd10.myworkdayjobs.com/Alphawave_External/job/Bangalore/VLSI-Trained-Fresher_JR100605?source=LinkedIn referral required https://www.linkedin.com/posts/pramodmg_myntra-softwareengineer-hiring-activity-7267757354119495681-8aMk?utm_source=share&utm_medium=member_desktop https://careers.sasken.com/job/ENGINEER-SOFTWARE-TEST&RELEASE/30519544/ https://careers.ey.com/ey/job/CABA-Client-Technology-SAP-Infrastructure-24x5-Setup-SAP-Basis-Infrastructure-Engineer-EY-GDS-B-1001/1024675101/ https://docs.google.com/forms/d/e/1FAIpQLSdtj-fmGQxITulW_qAYRYkugjCWH--NAZW0U9YxfolocQb3ZQ/viewform

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

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

Kiwi Credit Card: Lifetime Free with Big Benefits 🔹 UPI Integration – Use your credit card for UPI payments. 🔹 Instant Virtual Card – Get and use your card instantly. 🔹 Cashback – 2% on scan-and-pay UPI, up to 5% yearly cashback. 🔹 Rewards – Earn points on every spend, redeemable for offers. 🔹 Travel Perks – Enjoy up to 3 free airport lounge visits per year. 🔹 Zero Annual Fees – No hidden charges, ever! 📌 Apply Now : https://bitli.in/F2d1b2e • Note : Minimum transaction of Rs 100 is required within 30 days Of Card Issuance to activate the card.

Kiwi Credit Card: Lifetime Free with Big Benefits 🔹 UPI Integration – Use your credit card for UPI payments. 🔹 Instant Virtual Card – Get and use your card instantly. 🔹 Cashback – 2% on scan-and-pay UPI, up to 5% yearly cashback. 🔹 Rewards – Earn points on every spend, redeemable for offers. 🔹 Travel Perks – Enjoy up to 3 free airport lounge visits per year. 🔹 Zero Annual Fees – No hidden charges, ever! 📌 Apply Now : https://bitli.in/F2d1b2e • Note : Minimum transaction of Rs 100 is required within 30 days Of Card Issuance to activate the card.

PVR : Watch Any Movie Any Show At Rs.99 Vaild For 29th November Shows. Book on any movie booking platform i.e Paytm, Bookmyshow

1. CAPGEMINI is hiring fresher candidates for the role of Off-campus. The details of the job, requirements and other information given below: https://www.capgemini.com/in-en/solutions/off-campus-drive-for-deal-centre-of-excellence-dcoe-2024-graduates/ 2. DELOITTE is hiring fresher candidates for the role of USI |ESC| Associate Analyst. The details of the job, requirements and other information given below: https://usijobs.deloitte.com/careersUSI/JobDetail/FY25-USI-Audit-Services-EH-ESC-Associate-Analyst/194295 3. TECH MAHINDRA is hiring fresher candidates for the role of Customer Support Executive. The details of the job, requirements and other information given below: https://www.naukri.com/job-listings-customer-support-executive-tech-mahindra-hyderabad-0-to-5-years-231124005738?src=jobsearchDesk&sid=1732363626886947_8&xp=2&px=2 4. AXIS BANK is hiring fresher candidates for the role of Mega walk in job drive. The details of the job, requirements and other information given below: https://www.naukri.com/job-listings-mega-walk-in-drive-on-27th-nov-for-male-for-a-bank-axis-bank-hyderabad-0-to-5-years-221124016145?src=cluster&sid=1732363626886947_3&xp=15&px=2

IBM is hiring Apply now:- http://www.itjobs.services

Adobe is hiring for Software Development Engineer Role *Role: Software Development Engineer *Location:Noida, IN *Category: Software Engineering Employment Type: Full-time Apply Now:- www.itjobs.services