Mitsogo is hiring Fresher
Apply link 👇
https://boards.greenhouse.io/mitsogoinc/jobs/4045384008?gh_src=eacea7cc8us
Apply link 👇
https://boards.greenhouse.io/mitsogoinc/jobs/4045384008?gh_src=eacea7cc8us
👍3
Adobe is hiring for SDE l role |
0 - 2 years experience | Noida location | CTC : 12 - 20 LPA ( expected )
https://careers.adobe.com/us/en/job/ADOBUSR146901EXTERNALENUS/Software-Development-Engineer?utm_medium=phenom-feeds&source=LinkedIn&utm_source=linkedin
0 - 2 years experience | Noida location | CTC : 12 - 20 LPA ( expected )
https://careers.adobe.com/us/en/job/ADOBUSR146901EXTERNALENUS/Software-Development-Engineer?utm_medium=phenom-feeds&source=LinkedIn&utm_source=linkedin
👍3
miniOrange is hiring for Software Engineer Java
2024/2023/2022 batches eligible
Location : Pune
Last date to apply : 6 PM, 10 July 2024
CTC : 6 - 8 LPA ( expected )
Apply Now :-
https://www.miniorange.com/career/hiring-drive
2024/2023/2022 batches eligible
Location : Pune
Last date to apply : 6 PM, 10 July 2024
CTC : 6 - 8 LPA ( expected )
Apply Now :-
https://www.miniorange.com/career/hiring-drive
👍2❤1
Interview Kickstart is hiring for Frontend Engineer I and II | 1 - 4 years experience | Remote |
Apply Now:-
https://interviewkickstart.keka.com/careers/jobdetails/45540
Apply Now:-
https://interviewkickstart.keka.com/careers/jobdetails/45540
👍2
class Result {
public static void goodSequence(BufferedReader bufferedReader) throws IOException {
StringTokenizer st = new StringTokenizer(bufferedReader.readLine());
int T = Integer.parseInt(st.nextToken());
for (int t = 0; t < T; t++) {
st = new StringTokenizer(bufferedReader.readLine(), ",");
int N = Integer.parseInt(st.nextToken());
int M = Integer.parseInt(st.nextToken());
st = new StringTokenizer(bufferedReader.readLine(), ",");
int[] sequence = new int[N];
for (int i = 0; i < N; i++) {
sequence[i] = Integer.parseInt(st.nextToken());
}
String result = solveTestCase(N, M, sequence);
System.out.println(result);
}
}
private static String solveTestCase(int N, int M, int[] sequence) {
int countDivisible = 0;
for (int x : sequence) {
if (x % M == 0) {
countDivisible++;
}
}
if (countDivisible == 0) {
return "0/1";
}
long totalSubsequences = (1L << N) - 1;
long goodSubsequences = (1L << countDivisible) - 1;
long P = goodSubsequences;
long Q = totalSubsequences;
long commonDivisor = gcd(P, Q);
P /= commonDivisor;
Q /= commonDivisor;
return P + "/" + Q;
}
private static long gcd(long a, long b) {
while (b != 0) {
long temp = b;
b = a % b;
a = temp;
}
return a;
}
}
public static void goodSequence(BufferedReader bufferedReader) throws IOException {
StringTokenizer st = new StringTokenizer(bufferedReader.readLine());
int T = Integer.parseInt(st.nextToken());
for (int t = 0; t < T; t++) {
st = new StringTokenizer(bufferedReader.readLine(), ",");
int N = Integer.parseInt(st.nextToken());
int M = Integer.parseInt(st.nextToken());
st = new StringTokenizer(bufferedReader.readLine(), ",");
int[] sequence = new int[N];
for (int i = 0; i < N; i++) {
sequence[i] = Integer.parseInt(st.nextToken());
}
String result = solveTestCase(N, M, sequence);
System.out.println(result);
}
}
private static String solveTestCase(int N, int M, int[] sequence) {
int countDivisible = 0;
for (int x : sequence) {
if (x % M == 0) {
countDivisible++;
}
}
if (countDivisible == 0) {
return "0/1";
}
long totalSubsequences = (1L << N) - 1;
long goodSubsequences = (1L << countDivisible) - 1;
long P = goodSubsequences;
long Q = totalSubsequences;
long commonDivisor = gcd(P, Q);
P /= commonDivisor;
Q /= commonDivisor;
return P + "/" + Q;
}
private static long gcd(long a, long b) {
while (b != 0) {
long temp = b;
b = a % b;
a = temp;
}
return a;
}
}
👍4❤1
allcoding1_official
Photo
import java.util.*;
public class Maib {
private static int reverseNumber(int num) {
int reversed = 0;
while (num != 0) {
reversed = reversed * 10 + num % 10;
num /= 10;
}
return reversed;
}
private static int largestPossibleNumber(int num) {
char[] digits = String.valueOf(num).toCharArray();
Arrays.sort(digits);
StringBuilder largestNumStr = new StringBuilder(new String(digits)).reverse();
return Integer.parseInt(largestNumStr.toString());
}
private static List<Integer> splitIntoDigits(int num) {
List<Integer> digits = new ArrayList<>();
while (num != 0) {
digits.add(num % 10);
num /= 10;
}
Collections.reverse(digits);
return digits;
}
public static String processAndEncodeArray(int[] arr) {
for (int i = 0; i < arr.length; i++) {
arr[i] = reverseNumber(arr[i]);
}
for (int i = 0; i < arr.length; i++) {
arr[i] = largestPossibleNumber(arr[i]);
}
List<Integer> allDigits = new ArrayList<>();
for (int num : arr) {
allDigits.addAll(splitIntoDigits(num));
}
Set<Integer> uniqueDigits = new LinkedHashSet<>(allDigits);
List<Integer> uniqueDigitList = new ArrayList<>(uniqueDigits);
// Step 5: Generate the encoded string
StringBuilder encodedString = new StringBuilder();
for (int digit : uniqueDigitList) {
if (digit == 0) {
encodedString.append('$');
} else if (digit % 2 == 0) {
encodedString.append('*');
} else {
encodedString.append('#');
}
}
return encodedString.toString();
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = scanner.nextInt();
}
String result = processAndEncodeArray(arr);
System.out.println(result);
}
}
public class Maib {
private static int reverseNumber(int num) {
int reversed = 0;
while (num != 0) {
reversed = reversed * 10 + num % 10;
num /= 10;
}
return reversed;
}
private static int largestPossibleNumber(int num) {
char[] digits = String.valueOf(num).toCharArray();
Arrays.sort(digits);
StringBuilder largestNumStr = new StringBuilder(new String(digits)).reverse();
return Integer.parseInt(largestNumStr.toString());
}
private static List<Integer> splitIntoDigits(int num) {
List<Integer> digits = new ArrayList<>();
while (num != 0) {
digits.add(num % 10);
num /= 10;
}
Collections.reverse(digits);
return digits;
}
public static String processAndEncodeArray(int[] arr) {
for (int i = 0; i < arr.length; i++) {
arr[i] = reverseNumber(arr[i]);
}
for (int i = 0; i < arr.length; i++) {
arr[i] = largestPossibleNumber(arr[i]);
}
List<Integer> allDigits = new ArrayList<>();
for (int num : arr) {
allDigits.addAll(splitIntoDigits(num));
}
Set<Integer> uniqueDigits = new LinkedHashSet<>(allDigits);
List<Integer> uniqueDigitList = new ArrayList<>(uniqueDigits);
// Step 5: Generate the encoded string
StringBuilder encodedString = new StringBuilder();
for (int digit : uniqueDigitList) {
if (digit == 0) {
encodedString.append('$');
} else if (digit % 2 == 0) {
encodedString.append('*');
} else {
encodedString.append('#');
}
}
return encodedString.toString();
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = scanner.nextInt();
}
String result = processAndEncodeArray(arr);
System.out.println(result);
}
}
👍7
Ciena is hiring for Software Engineering DevOps New Grad
Expected Salary : 10-20 LPA
Batch : 2024/2023 passouts eligible
Apply here :
https://careers.ciena.com/us/en/job/CIENUSR025123ENUS/Software-Engineering-DevOps-New-Grad
Telegram:- @allcoding1_official
Expected Salary : 10-20 LPA
Batch : 2024/2023 passouts eligible
Apply here :
https://careers.ciena.com/us/en/job/CIENUSR025123ENUS/Software-Engineering-DevOps-New-Grad
Telegram:- @allcoding1_official
👍4❤1
GenC PWD Hiring 2023 & 2024 Batch
Apply link 👇
https://app.joinsuperset.com/join/#/signup/student/jobprofiles/07a89094-b25f-4041-b191-5bd8eb09a5aa
Apply link 👇
https://app.joinsuperset.com/join/#/signup/student/jobprofiles/07a89094-b25f-4041-b191-5bd8eb09a5aa
👍6
🎯Tech Mahindra link open for 2024 Batch
Immediately apply before it closed
Apply Now:-
https://registration.techmahindra.com/Candidate/Instructions.aspx
Immediately apply before it closed
Apply Now:-
https://registration.techmahindra.com/Candidate/Instructions.aspx
👍1
🎯Shell is hiring for Interns
2025 batch eligible
Location : Bangalore/Gurgaon
Apply:-
https://jobs.shell.com/job/bengaluru/shell-assessed-internship-programme-2025-india/25244/67560377344
2025 batch eligible
Location : Bangalore/Gurgaon
Apply:-
https://jobs.shell.com/job/bengaluru/shell-assessed-internship-programme-2025-india/25244/67560377344
👍2
🎯Accenture
Job role:- Associate Software Engineer (ASE)
Experience: 0 Month - 11 Month(s)
Salary: INR 4,60,700 -
Job Type: Full Time
Location: Bangalore, Hyderabad, Pune, Mumbai, Chennai, Gurugram, Kolkata, Indore, Jaipur, Coimbatore, Ahmedabad, Bhubaneswar
Apply Now:- https://indiacampus.accenture.com/myzone/accenture/1/jobs/25377/job-details
Telegram:- @allcoding1_official
Job role:- Associate Software Engineer (ASE)
Experience: 0 Month - 11 Month(s)
Salary: INR 4,60,700 -
Job Type: Full Time
Location: Bangalore, Hyderabad, Pune, Mumbai, Chennai, Gurugram, Kolkata, Indore, Jaipur, Coimbatore, Ahmedabad, Bhubaneswar
Apply Now:- https://indiacampus.accenture.com/myzone/accenture/1/jobs/25377/job-details
Telegram:- @allcoding1_official
👍5❤2
Meesho | SDE l - Android | 17 - 21 LPA ( expected ) | 1+ year experience | Bangalore
Link : https://meesho.io/jobs/android-developer---i?id=f35e1cae-5847-4b92-bd76-c0474197724f
Link : https://meesho.io/jobs/android-developer---i?id=f35e1cae-5847-4b92-bd76-c0474197724f
👍4
HCL is hiring 2023/2024 Batch
Eligibility: BBA
APPLY LINK
https://forms.office.com/pages/responsepage.aspx?id=N-edGDrJWk-LaG9MqZQZEn1JaGPZlC1ChKI35Gw0sAtUNzdRRFY4SzNHMDVZNk04SlZXTU5UVlZUVy4u
Eligibility: BBA
APPLY LINK
https://forms.office.com/pages/responsepage.aspx?id=N-edGDrJWk-LaG9MqZQZEn1JaGPZlC1ChKI35Gw0sAtUNzdRRFY4SzNHMDVZNk04SlZXTU5UVlZUVy4u
👍3❤2
🎯Cognizant PWD off-campus hiring | Registrations open for 2023 & 2024 graduates
Greetings from Cognizant
At Cognizant, we believe in hiring and partnering with the best to engineer excellence for leading businesses around the world. We are pleased to announce that our PwD (Persons with Disabilities) off-campus hiring is live.
This opportunity is open for any B.E / B.Tech / M.E / M. Tech/ MCA/ MSc (IT/CS) or MS Software engineering (streams such as Leather, Food, Fashion, etc.. are excluded) students from 2023, 2024 batch with a proof of disability certificate.
We are happy to share the registration link for candidates interested to work in Cognizant and accelerate their careers. Registration link present in the attached mail. Kindly circulate it to interested candidates for them to apply.
Apply Now:- https://app.joinsuperset.com/company/cognizant/
Greetings from Cognizant
At Cognizant, we believe in hiring and partnering with the best to engineer excellence for leading businesses around the world. We are pleased to announce that our PwD (Persons with Disabilities) off-campus hiring is live.
This opportunity is open for any B.E / B.Tech / M.E / M. Tech/ MCA/ MSc (IT/CS) or MS Software engineering (streams such as Leather, Food, Fashion, etc.. are excluded) students from 2023, 2024 batch with a proof of disability certificate.
We are happy to share the registration link for candidates interested to work in Cognizant and accelerate their careers. Registration link present in the attached mail. Kindly circulate it to interested candidates for them to apply.
Apply Now:- https://app.joinsuperset.com/company/cognizant/
👍10
🎯Infor is hiring for Quality Analyst, Associate
0 - 1 year experience
https://careers.infor.com/en_US/careers/JobDetail/Quality-Assurance-Analyst-Associate/14544#
0 - 1 year experience
https://careers.infor.com/en_US/careers/JobDetail/Quality-Assurance-Analyst-Associate/14544#
👍1