Forwarded from allcoding1_official
import java.util.Scanner;
public class NegativeSum {
public static void main(String[] args) {
int[] numbers = {2, -3, -14, 7};
int negativeSum = findNegativeSum(numbers);
}
public static int findNegativeSum(int[] arr) {
int sum = 0;
for (int num : arr) {
if (num < 0) {
sum += num;
}
}
return sum;
}
}
Wipro exam ans
19/1/2025
Java
@itjobsservices
public class NegativeSum {
public static void main(String[] args) {
int[] numbers = {2, -3, -14, 7};
int negativeSum = findNegativeSum(numbers);
}
public static int findNegativeSum(int[] arr) {
int sum = 0;
for (int num : arr) {
if (num < 0) {
sum += num;
}
}
return sum;
}
}
Wipro exam ans
19/1/2025
Java
@itjobsservices
Forwarded from allcoding1_official
import java.util.Scanner;
public class MidIndexProblem {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// Read the number of elements
System.out.println("Enter the number of elements:");
int n = scanner.nextInt();
// Read the array elements
int[] arr = new int[n];
System.out.println("Enter the elements:");
for (int i = 0; i < n; i++) {
arr[i] = scanner.nextInt();
}
// Find the mid-index
int midIndex = n / 2;
// Output the middle element
System.out.println("Middle element: " + arr[midIndex]);
scanner.close();
}
}
wipro
19/1/25
2. ans , mid-index problem
Java
@itjobsservices
public class MidIndexProblem {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// Read the number of elements
System.out.println("Enter the number of elements:");
int n = scanner.nextInt();
// Read the array elements
int[] arr = new int[n];
System.out.println("Enter the elements:");
for (int i = 0; i < n; i++) {
arr[i] = scanner.nextInt();
}
// Find the mid-index
int midIndex = n / 2;
// Output the middle element
System.out.println("Middle element: " + arr[midIndex]);
scanner.close();
}
}
wipro
19/1/25
2. ans , mid-index problem
Java
@itjobsservices
π2
import java.util.Scanner;
public class RotateNumberArray {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// Input the number
System.out.println("Enter the number:");
String input = scanner.next();
int n = input.length();
// Convert the number into an array of digits
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = Character.getNumericValue(input.charAt(i));
}
// Input the number of rotations
System.out.println("Enter the number of rotations:");
int rotations = scanner.nextInt();
// Perform the rotation
int[] rotatedArray = rotateArray(arr, rotations);
// Print the rotated array as a number
System.out.println("Rotated Number:");
for (int digit : rotatedArray) {
System.out.print(digit);
}
scanner.close();
}
public static int[] rotateArray(int[] arr, int rotations) {
int n = arr.length;
// Normalize the rotations
rotations = rotations % n;
// Create a new array to hold the rotated result
int[] result = new int[n];
// Copy the last 'rotations' elements to the beginning
for (int i = 0; i < rotations; i++) {
result[i] = arr[n - rotations + i];
}
// Copy the remaining elements
for (int i = rotations; i < n; i++) {
result[i] = arr[i - rotations];
}
return result;
}
}
Sample input
123456
2
Sample Output
561234
Java
19/1/25
Wipro exam
public class RotateNumberArray {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// Input the number
System.out.println("Enter the number:");
String input = scanner.next();
int n = input.length();
// Convert the number into an array of digits
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = Character.getNumericValue(input.charAt(i));
}
// Input the number of rotations
System.out.println("Enter the number of rotations:");
int rotations = scanner.nextInt();
// Perform the rotation
int[] rotatedArray = rotateArray(arr, rotations);
// Print the rotated array as a number
System.out.println("Rotated Number:");
for (int digit : rotatedArray) {
System.out.print(digit);
}
scanner.close();
}
public static int[] rotateArray(int[] arr, int rotations) {
int n = arr.length;
// Normalize the rotations
rotations = rotations % n;
// Create a new array to hold the rotated result
int[] result = new int[n];
// Copy the last 'rotations' elements to the beginning
for (int i = 0; i < rotations; i++) {
result[i] = arr[n - rotations + i];
}
// Copy the remaining elements
for (int i = rotations; i < n; i++) {
result[i] = arr[i - rotations];
}
return result;
}
}
Sample input
123456
2
Sample Output
561234
Java
19/1/25
Wipro exam
π5π1
π―Software Dev Engineer, Amazon University Talent Acquisition
Location:- IND, KA, Bengaluru
Job role:- Software Development
BASIC QUALIFICATIONS
- Bachelor's degree or equivalent
Apply Now:- www.itjobs.services
Location:- IND, KA, Bengaluru
Job role:- Software Development
BASIC QUALIFICATIONS
- Bachelor's degree or equivalent
Apply Now:- www.itjobs.services
π3β€1π1
π₯π₯MSI Thin 15 Intel Core i5 12th Gen 12450H - (16 GB/512 GB SSD/Windows 11 Home/4 GB Graphics/NVIDIA GeForce RTX 3050/144 Hz)
π Deal Price : βΉ45,790
Buy Here : https://fkrt.co/0AshyW
π₯ Bank Offer : βΉ6,200 Instant discount On HDFC Credit Card EMI Txn
β‘οΈβ‘οΈ1,000 Off With Using 100 SuperCoins
π Deal Price : βΉ45,790
Buy Here : https://fkrt.co/0AshyW
π₯ Bank Offer : βΉ6,200 Instant discount On HDFC Credit Card EMI Txn
β‘οΈβ‘οΈ1,000 Off With Using 100 SuperCoins
π3
TCS NQT Mass Hiring for Freshers:
Graduation Year: 2025
Eligibility: BTech / BE / MTech / ME / MCA / MSc / MS
Job Roles:
Ninja - 3.36 LPA
Digital - 7 LPA
Prime - 9 LPA
Apply Link: https://www.tcs.com/careers/india/tcs-fresher-hiring-nqt-batch-2025
Registration End Date: 23rd March
Test Date: 15th March onwards
Graduation Year: 2025
Eligibility: BTech / BE / MTech / ME / MCA / MSc / MS
Job Roles:
Ninja - 3.36 LPA
Digital - 7 LPA
Prime - 9 LPA
Apply Link: https://www.tcs.com/careers/india/tcs-fresher-hiring-nqt-batch-2025
Registration End Date: 23rd March
Test Date: 15th March onwards
π7
Morningstar Hiring
Apply now:-
https://careers.morningstar.com/us/en/job/REQ-049926/Quantitative-Analyst-New-Product-Development
Apply now:-
https://careers.morningstar.com/us/en/job/REQ-049926/Quantitative-Analyst-New-Product-Development
JP Morgan is Hiring
Role: Testing Analyst
Location: Bengaluru
Apply Link : https://jpmc.fa.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1001/job/210598211/?utm_medium=jobshare&utm_source=External+Job+Share
Role: Testing Analyst
Location: Bengaluru
Apply Link : https://jpmc.fa.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1001/job/210598211/?utm_medium=jobshare&utm_source=External+Job+Share
π2
Zoho Off Campus Hiring Announced For Freshers and Exp as Software Developer
β Apply Link:
https://careers.zohocorp.com/forms/fcc89b5ebd373d598e0224d10f2199d1df76b48507184e42d200f0fd7de96aff
β Job Role: Software Developer
β Experience: 0 to 3 Year
βLast Date: 7 March
β Apply Link:
https://careers.zohocorp.com/forms/fcc89b5ebd373d598e0224d10f2199d1df76b48507184e42d200f0fd7de96aff
β Job Role: Software Developer
β Experience: 0 to 3 Year
βLast Date: 7 March
π3
Deloitte conducting internship free
Apply now:-
https://www.theforage.com/simulations?companies=deloitte-au&fbclid=PAY2xjawI_rXFleHRuA2FlbQIxMAABpnbGngkc6nBDAHT23bKsXX_SyV0nFCOcIi4dZC3iHtOEow9iZJFtn1Uilg_aem_s5y6RQTj8ER1tGNXPG7L7g
Apply now:-
https://www.theforage.com/simulations?companies=deloitte-au&fbclid=PAY2xjawI_rXFleHRuA2FlbQIxMAABpnbGngkc6nBDAHT23bKsXX_SyV0nFCOcIi4dZC3iHtOEow9iZJFtn1Uilg_aem_s5y6RQTj8ER1tGNXPG7L7g
Theforage
Virtual job simulations and short courses | Forage
Use Forage job simulations to build skills and learn about roles in data, engineering, investment banking and more at companies like JP Morgan, BCG, and Red Bull
π2
Company name: Portcast
Role: Data Science Intern
Batch Eligible: 2025 & 2026 graduates
Location: Remote
Apply Link: https://jobs.lever.co/portcast/7ec43ef0-d521-4df3-9f51-58e72a839538
Role: Data Science Intern
Batch Eligible: 2025 & 2026 graduates
Location: Remote
Apply Link: https://jobs.lever.co/portcast/7ec43ef0-d521-4df3-9f51-58e72a839538