✅GFG DSA COURSE
✅GFG INTERVIEW PREPARATION COURSE
✅GFG JAVA BACKEND WEB DEVELOPMENT
✅ PROGRAMME LANGUAGE
Premium Paid Courses for Free ⚡️🔥
🗂 Java
🔗Link :- @itjobsservices
🗂 JavaScript
🔗Link :- @itjobsservices
🗂 Node.js
🔗Link :- @itjobsservices
🗂 Python
🔗Link :- @itjobsservices
🗂React
🔗Link :- @itjobsservices
🗂 React Native
🔗Link :- @itjobsservices
🗂 Redux
🔗Link :- @itjobsservices
🗂 SQL
🔗Link :- @itjobsservices
🗂-Xamarin Forms
🔗Link :- @itjobsservices
✅GFG INTERVIEW PREPARATION COURSE
✅GFG JAVA BACKEND WEB DEVELOPMENT
✅ PROGRAMME LANGUAGE
Premium Paid Courses for Free ⚡️🔥
🗂 Java
🔗Link :- @itjobsservices
🗂 JavaScript
🔗Link :- @itjobsservices
🗂 Node.js
🔗Link :- @itjobsservices
🗂 Python
🔗Link :- @itjobsservices
🗂React
🔗Link :- @itjobsservices
🗂 React Native
🔗Link :- @itjobsservices
🗂 Redux
🔗Link :- @itjobsservices
🗂 SQL
🔗Link :- @itjobsservices
🗂-Xamarin Forms
🔗Link :- @itjobsservices
👍7🔥2❤1
Company:- CGI
Package:-4.5 lpa
Role:- java developer
Batches:- 2022/2023/2024/2025
Apply Now:- https://cgi.njoyn.com/CORP/in/share/JobDetails.asp?clid=21001&jobid=J1124-0912&BRID=1180642&LANG=1&SBDID=943
Package:-4.5 lpa
Role:- java developer
Batches:- 2022/2023/2024/2025
Apply Now:- https://cgi.njoyn.com/CORP/in/share/JobDetails.asp?clid=21001&jobid=J1124-0912&BRID=1180642&LANG=1&SBDID=943
👍5❤1
Check out these free resources from Microsoft:
1. [Azure]
@itjobsservices
2. [Microsoft Cloud Blog]
@itjobsservices
3. [Visual Studio Code]
@itjobsservices
4. [Microsoft DevBlogs]
@itjobsservices
5. [Microsoft Developer]
@itjobsservices
6. [Microsoft Learn]
@itjobsservices
7. [MSDN Profile]
@itjobsservices
8. [Technet Profile]
@itjobsservices
9. [Microsoft Startups]
@itjobsservices
10.[TechCommunity]
@itjobsservices
1. [Azure]
@itjobsservices
2. [Microsoft Cloud Blog]
@itjobsservices
3. [Visual Studio Code]
@itjobsservices
4. [Microsoft DevBlogs]
@itjobsservices
5. [Microsoft Developer]
@itjobsservices
6. [Microsoft Learn]
@itjobsservices
7. [MSDN Profile]
@itjobsservices
8. [Technet Profile]
@itjobsservices
9. [Microsoft Startups]
@itjobsservices
10.[TechCommunity]
@itjobsservices
👍8
Cisco Hiring Software Development, Test and Automation Engineer
Graduation Year: 2022 / 2023 / 2024
Salary: 15 LPA
Location: Bangalore
Apply Now:- https://jobs.cisco.com/jobs/ProjectDetail/Software-Development-Test-and-Automation-Engineer-Wireless-Meraki/1431162
Graduation Year: 2022 / 2023 / 2024
Salary: 15 LPA
Location: Bangalore
Apply Now:- https://jobs.cisco.com/jobs/ProjectDetail/Software-Development-Test-and-Automation-Engineer-Wireless-Meraki/1431162
👍2
📌IT learning courses
📌All programing courses
📌Abdul bari courses
📌Ashok IT
📌Linux
📌Networking
📌Design patterns
📌Donet
📌Docker
📌Entity framework
📌Node.js
📌ASP. Net
📌Aps. Net cro
📌java
📌JavaScript
📌full stack developer
Tutorials + Books + Courses + Trainings + Workshops + Educational 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 , 🇫🇷
𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋 𝐂𝐎𝐔𝐑𝐒𝐄
⚡️ Reconnaissance and Footprinting
⚡️ Network Scanning
⚡️ Enumeration
⚡️ Firewalls HIDs Honeypot
⚡️ Malware and Threats
⚡️ Mobile Platform
⚡️ Pentesting
⚡️ Sql Injection
⚡️ System Hacking
⚡️ Web Application
⚡️ Wireless Network
⚡️ Cloud Computing
⚡️ Web Server
⚡️ Social Engineering
⚡️ Session Hijacking
⚡️ Sniffing
⚡️ BufferOverflow
⚡️ Cryptography
⚡️ Denial Of Service
All courses (60 rupees)
Lifetime access
Contact:- @meterials_available
📌All programing courses
📌Abdul bari courses
📌Ashok IT
📌Linux
📌Networking
📌Design patterns
📌Donet
📌Docker
📌Entity framework
📌Node.js
📌ASP. Net
📌Aps. Net cro
📌java
📌JavaScript
📌full stack developer
Tutorials + Books + Courses + Trainings + Workshops + Educational 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 , 🇫🇷
𝐂𝐘𝐁𝐄𝐑 𝐒𝐄𝐂𝐔𝐑𝐈𝐓𝐘 𝐀𝐋𝐋 𝐂𝐎𝐔𝐑𝐒𝐄
⚡️ Reconnaissance and Footprinting
⚡️ Network Scanning
⚡️ Enumeration
⚡️ Firewalls HIDs Honeypot
⚡️ Malware and Threats
⚡️ Mobile Platform
⚡️ Pentesting
⚡️ Sql Injection
⚡️ System Hacking
⚡️ Web Application
⚡️ Wireless Network
⚡️ Cloud Computing
⚡️ Web Server
⚡️ Social Engineering
⚡️ Session Hijacking
⚡️ Sniffing
⚡️ BufferOverflow
⚡️ Cryptography
⚡️ Denial Of Service
All courses (60 rupees)
Lifetime access
Contact:- @meterials_available
👍2
Company: Zeta
Role : SDE( Intern)
Batch : 2025
Apply link-
https://jobs.lever.co/zeta/7703ac43-7425-4af3-8551-9f53eeb9bc6e?lever-via=brPz4nskIn&lever-social=job_site
Role : SDE( Intern)
Batch : 2025
Apply link-
https://jobs.lever.co/zeta/7703ac43-7425-4af3-8551-9f53eeb9bc6e?lever-via=brPz4nskIn&lever-social=job_site
👍4
Amazon | hiring fresher | Graduates | Go AI associate | 6month contract
Company: Amazon
Experience: hiring fresher
Qualification : Graduates
Role : Go AI associate
Register Today :
https://amazonvirtualhiring.hirepro.in/registration/incta/dirc1/apply/?event=14610&job=58500
Company: Amazon
Experience: hiring fresher
Qualification : Graduates
Role : Go AI associate
Register Today :
https://amazonvirtualhiring.hirepro.in/registration/incta/dirc1/apply/?event=14610&job=58500
👍5
𝐀𝐖𝐒 𝐅𝐑𝐄𝐄 𝐂𝐞𝐫𝐭𝐢𝐟𝐢𝐜𝐚𝐭𝐢𝐨𝐧 𝐂𝐨𝐮𝐫𝐬𝐞
Want to boost your career with AWS certifications but don’t want to spend a fortune?
I’ve got you covered! Here are FREE Amazon AWS certification courses that you can start today.
Learn cloud computing skills, ace those AWS exams, and open doors to top tech roles.
Apply now:- @itjobsservices
Enroll For FREE & Get
Want to boost your career with AWS certifications but don’t want to spend a fortune?
I’ve got you covered! Here are FREE Amazon AWS certification courses that you can start today.
Learn cloud computing skills, ace those AWS exams, and open doors to top tech roles.
Apply now:- @itjobsservices
Enroll For FREE & Get
👍4
Gartner Recruitment 2025 Hiring For Associate Software Engineer- BE/BTech/ME/MTech
Apply Link- https://offcampusjobs4u.com/gartner-recruitment-2025-hiring/
Apply Link- https://offcampusjobs4u.com/gartner-recruitment-2025-hiring/
OffCampusJobs4u.Com - Off Campus Jobs | Off Campus Drives | Freshers Jobs | Off Campus Hiring
Gartner Recruitment 2025 Hiring For Associate Software Engineer- BE/BTech/ME/MTech | OffCampusJobs4u.com
Gartner Recruitment 2025 Hiring For Associate Software Engineer- BE/BTech/ME/MTech | OffCampusJobs4u.com | Off Campus Jobs | Off Campus Drives | Freshers Jobs
👍2
ANZ is hiring Software Engineer
2022, 2023, 2024 gards eligible
Location: Bangalore
Apply now :-
https://careers.anz.com/job/Bengaluru-Software-Engineer/1059263066/
2022, 2023, 2024 gards eligible
Location: Bangalore
Apply now :-
https://careers.anz.com/job/Bengaluru-Software-Engineer/1059263066/
❤1👍1
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
👍7❤1
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
👍3
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
👍3
import java.util.Scanner;
public class TwoSum {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// Input the array size
System.out.println("Enter the size of the array:");
int size = scanner.nextInt();
// Input the array elements
int[] arr = new int[size];
System.out.println("Enter the array elements:");
for (int i = 0; i < size; i++) {
arr[i] = scanner.nextInt();
}
// Input the target value
System.out.println("Enter the target value:");
int target = scanner.nextInt();
int maxSum=0;
for (int i = 0; i < size; i++) {
int wind=0;
for (int j = i; j < size; j++) {
wind += arr[i+j];
maxSum=Math.max(maxSum,wind);
}
scanner.close();
}
}
public class TwoSum {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// Input the array size
System.out.println("Enter the size of the array:");
int size = scanner.nextInt();
// Input the array elements
int[] arr = new int[size];
System.out.println("Enter the array elements:");
for (int i = 0; i < size; i++) {
arr[i] = scanner.nextInt();
}
// Input the target value
System.out.println("Enter the target value:");
int target = scanner.nextInt();
int maxSum=0;
for (int i = 0; i < size; i++) {
int wind=0;
for (int j = i; j < size; j++) {
wind += arr[i+j];
maxSum=Math.max(maxSum,wind);
}
scanner.close();
}
}
❤2👍2
// Online Java Compiler
// Use this editor to write, compile and run your Java code online
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// Input the array size
System.out.println("Enter the size of the array:");
int size = scanner.nextInt();
// Input the array elements
int[] arr = new int[size];
System.out.println("Enter the array elements:");
for (int i = 0; i < size; i++) {
arr[i] = scanner.nextInt();
}
// Input the target value
System.out.println("Enter the target value:");
int target = scanner.nextInt();
int maxSum=0;
boolean flag=false;
for (int i = 0; i < size; i++) {
int wind=0;
for (int j = i+1; j < 2; j++) {
if(arr[i]+arr[j]==15){
flag=true;
break;
}
}
}
System.out.println(true);
scanner.close();
}
}
// Use this editor to write, compile and run your Java code online
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// Input the array size
System.out.println("Enter the size of the array:");
int size = scanner.nextInt();
// Input the array elements
int[] arr = new int[size];
System.out.println("Enter the array elements:");
for (int i = 0; i < size; i++) {
arr[i] = scanner.nextInt();
}
// Input the target value
System.out.println("Enter the target value:");
int target = scanner.nextInt();
int maxSum=0;
boolean flag=false;
for (int i = 0; i < size; i++) {
int wind=0;
for (int j = i+1; j < 2; j++) {
if(arr[i]+arr[j]==15){
flag=true;
break;
}
}
}
System.out.println(true);
scanner.close();
}
}
👍4