Code With Virus

JUSPAY Job Role:- Software Developer Experiened Required:- 1 to 5 years Eligibility:- AnyOne Can apply Salary Range:- 8 - 30 LPA (Depend upon interview )

Company Name : Sony Batch : 2022 passouts Role : Software Engineers https://sonyglobal.wd1.myworkdayjobs.com/SonyGlobalCareers/job/Bangalore/Off-Campus-Hiring--Software-Engineer_JR-111124

IBM Research India Summer 2023 Internship Program - Applications invited Last date to receive the application is November 14, 2022. https://researcher.draco.res.ibm.com/researcher/view_group_subpage.php?id=8101

// import java.util.Scanner; class Main { static boolean iskaprekar(int n) { if (n == 1) return true; int s = n * n; int c = 0; while (s != 0) { c++; s /= 10; } s = n * n; for (int i = 1; i < c; i++) { int e = (int) Math.pow(10, i); if (e == n) continue; int sum = s / e + s % e; if (sum == n) return true; } return false; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); if (n <= 0) System.out.println("-1"); else if (iskaprekar(n)) System.out.println("TRUE"); else System.out.println("FALSE"); } }

Goldman Sachs Internship Drive 2022 | New Analyst Program | Fresher Job | Graduate Job 2022 & 2023 Job Role : New Analyst Program Qualification: Bachelor's Or Master's Degree Batch:2022, 2023 Experience: Fresher Job Location : Bangalore Apply Link: https://bit.ly/3BVgaE4

HCl https://forms.office.com/pages/responsepage.aspx?id=N-edGDrJWk-LaG9MqZQZEsBJpOylLepKrB0D5DY-0v1UNDdYQjczVlNGSlBLWTc3WThHQ0YyRDZUSS4u

// 207. Course Schedule class Solution { public: bool DFS(int s, vector<bool> &visted, vector<bool> &cuttVisteed, vector<int> adj[]) { visted[s] = true; cuttVisteed[s] = true; vector<int> data = adj[s]; for (auto x : data) { if (!visted[x]) { if (DFS(x, visted, cuttVisteed, adj)) { return true; } } else if (visted[x] && cuttVisteed[x]) { return true; } } cuttVisteed[s] = false; return false; } bool canFinish(int numCourses, vector<vector<int>> &prerequisites) { vector<bool> visted(numCourses, false), cuttVisteed(numCourses, false); vector<int> adj[numCourses]; for (auto x : prerequisites) { vector<int> data = x; int a = data[0]; int b = data[1]; adj[a].push_back(b); } for (int i = 0; i < numCourses; i++) { if (!visted[i]) { if (DFS(i, visted, cuttVisteed, adj)) { return false; } } } return true; } }; //C++ topological sort DFS || Easy Solution