Accenture
Python 3โ
Python 3โ
๐ฅ2
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Fampay hiring Product Operations Intern
Batch : 2024 / 2025
Apply : https://www.linkedin.com/jobs/view/3638858493
Batch : 2024 / 2025
Apply : https://www.linkedin.com/jobs/view/3638858493
Linkedin
Fam hiring Product Operations Intern in Bengaluru, Karnataka, India | LinkedIn
Posted 8:08:46 PM. About FamPayFamPay is building Indiaโs first neo-bank exclusively teens. FamPay helps teens makeโฆSee this and similar jobs on LinkedIn.
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: CRED
Role: Frontend Developer
Batch eligible: 2022 and early grads. (Require 1 year of experience)
Apply: https://www.linkedin.com/jobs/view/3671863056
P.S: If you have 1 year of experience and you are looking for a switch, just go for it.
Role: Frontend Developer
Batch eligible: 2022 and early grads. (Require 1 year of experience)
Apply: https://www.linkedin.com/jobs/view/3671863056
P.S: If you have 1 year of experience and you are looking for a switch, just go for it.
Linkedin
CRED hiring Frontend Developer (Web) in Bangalore Urban, Karnataka, India | LinkedIn
Posted 5:03:54 AM. what is CRED?
CRED is an exclusive community for Indiaโs most trustworthy and creditworthyโฆSee this and similar jobs on LinkedIn.
CRED is an exclusive community for Indiaโs most trustworthy and creditworthyโฆSee this and similar jobs on LinkedIn.
Siemens is hiring Data Analyst/ Data Engineer!
Qualifications: Bachelorโs/ Masterโs Degree
Salary: 7 - 11 LPA (Expected)
Experience: Freshers & Experienced
Location: Bangalore/ Remote
๐Apply Link: https://jobs.siemens.com/careers/job/563156115688264
https://jobs.siemens.com/careers/job/563156115565135
Qualifications: Bachelorโs/ Masterโs Degree
Salary: 7 - 11 LPA (Expected)
Experience: Freshers & Experienced
Location: Bangalore/ Remote
๐Apply Link: https://jobs.siemens.com/careers/job/563156115688264
https://jobs.siemens.com/careers/job/563156115565135
#include <bits/stdc++.h>
using namespace std;
bool prime(int num)
{
if (num <= 1)
return false;
for (int i = 2; i * i <= num; ++i)
{
if (num % i == 0)
return false;
}
return true;
}
int main()
{
int l, r;
cin >> l >> r;
int ans = 0;
for (int i = l; i <= r; i++)
{
if (prime(abs(i)))
{
ans += i;
}
}
cout << ans;
return 0;
}
TechM Campus 2024
SumPrime
Python โ
using namespace std;
bool prime(int num)
{
if (num <= 1)
return false;
for (int i = 2; i * i <= num; ++i)
{
if (num % i == 0)
return false;
}
return true;
}
int main()
{
int l, r;
cin >> l >> r;
int ans = 0;
for (int i = l; i <= r; i++)
{
if (prime(abs(i)))
{
ans += i;
}
}
cout << ans;
return 0;
}
TechM Campus 2024
SumPrime
Python โ
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
sort(arr, arr + n);
cout << arr[n - 2] + arr[n - 1];
return 0;
}
Tech Mahindra โ
using namespace std;
int main()
{
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
sort(arr, arr + n);
cout << arr[n - 2] + arr[n - 1];
return 0;
}
Tech Mahindra โ
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int ans = 0;
map<char, int> m;
for (int i = 0; i < s.size(); i++)
{
m[s[i]]++;
}
for (auto x : m)
{
if (x.second == 1)
ans++;
}
cout << ans;
return 0;
}
Tech Mahindra
C++โ
using namespace std;
int main()
{
string s;
cin >> s;
int ans = 0;
map<char, int> m;
for (int i = 0; i < s.size(); i++)
{
m[s[i]]++;
}
for (auto x : m)
{
if (x.second == 1)
ans++;
}
cout << ans;
return 0;
}
Tech Mahindra
C++โ
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int n;
cin >> n;
for (int i = n; i < s.size() + n; i++)
{
cout << s[i % s.size()];
}
return 0;
}
C++โ
using namespace std;
int main()
{
string s;
cin >> s;
int n;
cin >> n;
for (int i = n; i < s.size() + n; i++)
{
cout << s[i % s.size()];
}
return 0;
}
C++โ
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int[][] arr = new int[N][N];
scanner.nextLine();
for (int i = 0; i < N; i++) {
String[] line = scanner.nextLine().split("#");
for (int j = 0; j < N; j++) {
arr[i][j] = Integer.parseInt(line[j]);
}
}
int maxMin = -1;
List<String> positions = new ArrayList<>();
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
int minVal = arr[i][j];
for (int x = Math.max(i - 1, 0); x <= Math.min(i + 1, N - 1); x++) {
for (int y = Math.max(j - 1, 0); y <= Math.min(j + 1, N - 1); y++) {
minVal = Math.min(minVal, arr[x][y]);
}
}
if (minVal > maxMin) {
maxMin = minVal;
positions.clear();
positions.add((i + 1) + "#" + (j + 1));
} else if (minVal == maxMin) {
positions.add((i + 1) + "#" + (j + 1));
}
}
}
for(String position : positions) {
System.out.println(position);
}
}
}
Game Centre
Java โ
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int[][] arr = new int[N][N];
scanner.nextLine();
for (int i = 0; i < N; i++) {
String[] line = scanner.nextLine().split("#");
for (int j = 0; j < N; j++) {
arr[i][j] = Integer.parseInt(line[j]);
}
}
int maxMin = -1;
List<String> positions = new ArrayList<>();
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
int minVal = arr[i][j];
for (int x = Math.max(i - 1, 0); x <= Math.min(i + 1, N - 1); x++) {
for (int y = Math.max(j - 1, 0); y <= Math.min(j + 1, N - 1); y++) {
minVal = Math.min(minVal, arr[x][y]);
}
}
if (minVal > maxMin) {
maxMin = minVal;
positions.clear();
positions.add((i + 1) + "#" + (j + 1));
} else if (minVal == maxMin) {
positions.add((i + 1) + "#" + (j + 1));
}
}
}
for(String position : positions) {
System.out.println(position);
}
}
}
Game Centre
Java โ
๐๐ฆ ๐๐น๐ด๐ผ ๐ป ๐ ใ๐๐ผ๐บ๐ฝ๐ฒ๐๐ถ๐๐ถ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ดใ
import java.util.*; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int N = scanner.nextInt(); int[][] arr = new int[N][N]; scanner.nextLine(); for (int iโฆ
Python 3โ
Tech Mahindra
Tech Mahindra
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int even = 0, odd = 0;
while (n > 0)
{
if ((n % 10) % 2 == 0)
even += n % 10;
else
odd += n % 10;
n = n / 10;
}
cout << even * odd;
}
C++โ
using namespace std;
int main()
{
int n;
cin >> n;
int even = 0, odd = 0;
while (n > 0)
{
if ((n % 10) % 2 == 0)
even += n % 10;
else
odd += n % 10;
n = n / 10;
}
cout << even * odd;
}
C++โ
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
int k;
cin >> k;
sort(arr, arr + n);
cout << arr[k - 1];
}
C++โ
using namespace std;
int main()
{
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
int k;
cin >> k;
sort(arr, arr + n);
cout << arr[k - 1];
}
C++โ
Today Anyone give exam Texas instruments OA?
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Element5
Role: Software Tester Trainee
Batch eligible: 2022 and 2023 grads.
Apply: https://resources.e5.ai/careers/stt
P.S: Only go if you donโt have any offer till now.
Role: Software Tester Trainee
Batch eligible: 2022 and 2023 grads.
Apply: https://resources.e5.ai/careers/stt
P.S: Only go if you donโt have any offer till now.
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Freshers, Full time, Part time all eligible.
If interested, send your resume at sourcing@upgrad.com
If interested, send your resume at sourcing@upgrad.com