Forwarded from Aman Raj
Dear,
I have opening for Senior Developer/Lead - Hyderabad
JD:
Java8
Design Pattern
Solid Principles
Springboot
Microservice Architecture
Junit
Any database
Location - Hyderabad
NP - 30 Days or service notice period and 60 Days also fine
If interested please share your CV to Ugesa_Elumalai@epam.com
Ugesa V E
Talent Acquisition Specialist at EPAM Systems
I have opening for Senior Developer/Lead - Hyderabad
JD:
Java8
Design Pattern
Solid Principles
Springboot
Microservice Architecture
Junit
Any database
Location - Hyderabad
NP - 30 Days or service notice period and 60 Days also fine
If interested please share your CV to Ugesa_Elumalai@epam.com
Ugesa V E
Talent Acquisition Specialist at EPAM Systems
Forwarded from Aman Raj
Hi
Jade is hiring
ยท Around 3+ years of experience in developing web-based applications in Core Java/J2EE and Microservices technologies
Experience on Spring, Spring Boot, Hibernate, highly responsive web applications using React JS, Angular.
Location- Pune, Hyderabad , Kolkata , Chandigarh
If you are interested then please share your resume at rupali.lokhande@jadeglobal.com
along with following details
Notice period/LWD
CCTC
ECTC
Rupali Lokhande
Talent Acquisition Specialist at Jade Global
Jade is hiring
ยท Around 3+ years of experience in developing web-based applications in Core Java/J2EE and Microservices technologies
Experience on Spring, Spring Boot, Hibernate, highly responsive web applications using React JS, Angular.
Location- Pune, Hyderabad , Kolkata , Chandigarh
If you are interested then please share your resume at rupali.lokhande@jadeglobal.com
along with following details
Notice period/LWD
CCTC
ECTC
Rupali Lokhande
Talent Acquisition Specialist at Jade Global
Forwarded from Aman Raj
Hi Aman
Iโve looked through your profile, and your experience in Java is quite impressive.
There are openings for multiple positions across India and I believe this opportunity will be an awesome upgrade for you!
Bhubaneshwar (3-8)
3-5 yrs :-https://career.infosys.com/jobdesc?jobReferenceCode=INFSYS-EXTERNAL-148254
5-8 yrs :-https://career.infosys.com/jobdesc?jobReferenceCode=INFSYS-EXTERNAL-148260
We are looking forward for your response.
Connect with me on LinkedIn for more updates and information
https://www.linkedin.com/in/prashanth-bharadwaj-45124516b/
Regards
Prashanth Bharadwaj
Prashanth Bharadwaj
Talent Acquisition Specialist at Infosys
Iโve looked through your profile, and your experience in Java is quite impressive.
There are openings for multiple positions across India and I believe this opportunity will be an awesome upgrade for you!
Bhubaneshwar (3-8)
3-5 yrs :-https://career.infosys.com/jobdesc?jobReferenceCode=INFSYS-EXTERNAL-148254
5-8 yrs :-https://career.infosys.com/jobdesc?jobReferenceCode=INFSYS-EXTERNAL-148260
We are looking forward for your response.
Connect with me on LinkedIn for more updates and information
https://www.linkedin.com/in/prashanth-bharadwaj-45124516b/
Regards
Prashanth Bharadwaj
Prashanth Bharadwaj
Talent Acquisition Specialist at Infosys
Message from srinivas sir so if you are all available do join the session and some projects ๐
// Wjp to count the no. of characters in given array I/P :- satgya O/P :- s= 1 a= 2 T = 1 h= 1 y=1
public class CountCharacter {
public static void main(String[] args) {
String str = "12345613245";
int count[] = new int[256];
int len = str.length();
for (int i = 0; i < len; i++)
count[str.charAt(i)]++;
char ch[] = new char[str.length()];
for (int i = 0; i < len; i++) {
ch[i] = str.charAt(i);
int find = 0;
for (int j = 0; j <= i; j++) {
// If any matches found
if (str.charAt(i) == ch[j])
find++;
}
if (find == 1)
System.out.println(str.charAt(i) + " =" + count[str.charAt(i)]);
}
}
}
public class CountCharacter {
public static void main(String[] args) {
String str = "12345613245";
int count[] = new int[256];
int len = str.length();
for (int i = 0; i < len; i++)
count[str.charAt(i)]++;
char ch[] = new char[str.length()];
for (int i = 0; i < len; i++) {
ch[i] = str.charAt(i);
int find = 0;
for (int j = 0; j <= i; j++) {
// If any matches found
if (str.charAt(i) == ch[j])
find++;
}
if (find == 1)
System.out.println(str.charAt(i) + " =" + count[str.charAt(i)]);
}
}
}
๐1
public class ReverseWordsInSentence {
public static void main(String[] args) {
String sentence = "which is the biggest continent";
String[] words = sentence.split(" ");
String reversedSentence = "";
for (int i = 0; i < words.length; i++) {
String word = words[i];
String reversedWord = "";
for (int j = word.length() - 1; j >= 0; j--) {
reversedWord = reversedWord + word.charAt(j);
}
reversedSentence = reversedSentence + reversedWord + " ";
}
System.out.println(reversedSentence);
}
}
public static void main(String[] args) {
String sentence = "which is the biggest continent";
String[] words = sentence.split(" ");
String reversedSentence = "";
for (int i = 0; i < words.length; i++) {
String word = words[i];
String reversedWord = "";
for (int j = word.length() - 1; j >= 0; j--) {
reversedWord = reversedWord + word.charAt(j);
}
reversedSentence = reversedSentence + reversedWord + " ";
}
System.out.println(reversedSentence);
}
}
public class LargestNumber {
public static void main(String[] args) {
int N = 139;
int D = 3;
int L = 0;
for (int i = N - 1; i >= 0; i--) {
String number = String.valueOf(i);
if (!number.contains(String.valueOf(D))) {
L = i;
break;
}
}
System.out.println("Largest number less than " + N +
" and not containing " + D + " is " + L);
}
}
public static void main(String[] args) {
int N = 139;
int D = 3;
int L = 0;
for (int i = N - 1; i >= 0; i--) {
String number = String.valueOf(i);
if (!number.contains(String.valueOf(D))) {
L = i;
break;
}
}
System.out.println("Largest number less than " + N +
" and not containing " + D + " is " + L);
}
}
๐1
public class BiggestNumber {
public static void main(String[] args) {
int a = 50, b = 20, c = 40;
if (a > b && a > c)
System.out.println("a is Biggest number");
else if (b > c)
System.out.println("b is Biggest number");
else
System.out.println("c is Biggest number");
}
}
public static void main(String[] args) {
int a = 50, b = 20, c = 40;
if (a > b && a > c)
System.out.println("a is Biggest number");
else if (b > c)
System.out.println("b is Biggest number");
else
System.out.println("c is Biggest number");
}
}