This is correct code but this brute code will update you with correct n small code for the same
Keep one offer in hand and negotiate with others again keep an offer of a higher package and negotiate for a higher package
import java.util.*;
public class PalidromeNumber {
public static void main(String[] args) {
Scanner x = new Scanner (System.in);
System.out.println("Enter value to check palidrome or not Palidrome");
String s1= x.next();
String s2 = "";
for(int i= s1.length()-1;i>=0;i--) {
s2 = s2+ s1.charAt(i);
}if (s1.equals(s2)) {
System.out.println("The entered number "+s1+" is a palindrome number ");
}else{
System.out.println("The entered number "+s1+" is not a palindrome number ");
}
}
}
class PalidromeNumber1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number: ");
int num=sc.nextInt();
int r,sum=0;
int temp=num;
while(num>0)
{
r=num%10;
sum=(sum*10)+r;
num=num/10;
}
if(temp==sum)
System.out.println("The entered number "+temp+" is a palindrome number ");
else
System.out.println("The entered number "+temp+" is not a palindrome");
}
}
public class PalidromeNumber {
public static void main(String[] args) {
Scanner x = new Scanner (System.in);
System.out.println("Enter value to check palidrome or not Palidrome");
String s1= x.next();
String s2 = "";
for(int i= s1.length()-1;i>=0;i--) {
s2 = s2+ s1.charAt(i);
}if (s1.equals(s2)) {
System.out.println("The entered number "+s1+" is a palindrome number ");
}else{
System.out.println("The entered number "+s1+" is not a palindrome number ");
}
}
}
class PalidromeNumber1 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter the number: ");
int num=sc.nextInt();
int r,sum=0;
int temp=num;
while(num>0)
{
r=num%10;
sum=(sum*10)+r;
num=num/10;
}
if(temp==sum)
System.out.println("The entered number "+temp+" is a palindrome number ");
else
System.out.println("The entered number "+temp+" is not a palindrome");
}
}
static List<EdM1>list2= List.of(new EdM1(1001,"Kannababu","m",40000,"Hyderabad","EIE"),new EdM1(1002,"Srinivas","m",42000,"Chennai","CSE"));
public static void main(String[] args) {
list2.forEach(System.out::println);
public static void main(String[] args) {
list2.forEach(System.out::println);
Microsoft is Hiring for 2023 batch Software Engineer
Role: SDE
Passout year: 2023
Qualification: B.tech/BE/MCA/M.tech/BCA
Branch: CS/IT/EE/ECE/EEE
Ctc : 42 Lpa - 46 Lpa
Location: Bangalore, Hyderabad, Noida
Apply now - https://careers.microsoft.com/us/en/job/1494883/Software-Engineering-Full-Time-Opportunity-for-University-Graduates
Telegram: @stockkida
WhatsApp: https://chat.whatsapp.com/F7kqpKp6WFZJQiuTXpYH1K
Role: SDE
Passout year: 2023
Qualification: B.tech/BE/MCA/M.tech/BCA
Branch: CS/IT/EE/ECE/EEE
Ctc : 42 Lpa - 46 Lpa
Location: Bangalore, Hyderabad, Noida
Apply now - https://careers.microsoft.com/us/en/job/1494883/Software-Engineering-Full-Time-Opportunity-for-University-Graduates
Telegram: @stockkida
WhatsApp: https://chat.whatsapp.com/F7kqpKp6WFZJQiuTXpYH1K
Top LeetCode questions asked in Google Interviews for SDE role (PART-1) 💓
📍 Please don't ignore this post, it took a lot of effort & time to research & create this post. Many of us are preparing for the interviews to get placed in top product-based companies and #Leetcode is one of the good platforms to practice the #DSA questions.
📍Here is a list of questions (Part-1) which recently asked by Google during the interviews. The questions and their respective links are in the same order. The content source is the Internet and Leetcode.
◾QUESTIONS :-
- H-Index
- Poor Pigs
- Valid Square
- Decode String
- Text Justification
- Battleships in a Board
- Minimum Time Difference
- Longest Absolute File Path
- Student Attendance Record II
- Evaluate Reverse Polish Notation
- Longest Increasing Path in a Matrix
◾Links:-
- https://lnkd.in/dVy49_Nr
- https://lnkd.in/daX_YFyX
- https://lnkd.in/dvq8H_2w
- https://lnkd.in/dDpYv6G5
- https://lnkd.in/dYNWn5N3
- https://lnkd.in/d29shXsD
- https://lnkd.in/dGAuhsvh
- https://lnkd.in/dHD-2TVZ
- https://lnkd.in/dbnqgbkA
- https://lnkd.in/dCX4BzSE
- https://lnkd.in/dmEWHdSd
📍 If you find it useful, give it a like and save it. Feel free to comment with your thoughts and queries. Don't forget to save this Post. Also share it with your friends and colleagues out there.🎭
tags-
#coding #datastructures #algorithms #google #interview #computerscience #softwareengineer #data #programming
📍 Please don't ignore this post, it took a lot of effort & time to research & create this post. Many of us are preparing for the interviews to get placed in top product-based companies and #Leetcode is one of the good platforms to practice the #DSA questions.
📍Here is a list of questions (Part-1) which recently asked by Google during the interviews. The questions and their respective links are in the same order. The content source is the Internet and Leetcode.
◾QUESTIONS :-
- H-Index
- Poor Pigs
- Valid Square
- Decode String
- Text Justification
- Battleships in a Board
- Minimum Time Difference
- Longest Absolute File Path
- Student Attendance Record II
- Evaluate Reverse Polish Notation
- Longest Increasing Path in a Matrix
◾Links:-
- https://lnkd.in/dVy49_Nr
- https://lnkd.in/daX_YFyX
- https://lnkd.in/dvq8H_2w
- https://lnkd.in/dDpYv6G5
- https://lnkd.in/dYNWn5N3
- https://lnkd.in/d29shXsD
- https://lnkd.in/dGAuhsvh
- https://lnkd.in/dHD-2TVZ
- https://lnkd.in/dbnqgbkA
- https://lnkd.in/dCX4BzSE
- https://lnkd.in/dmEWHdSd
📍 If you find it useful, give it a like and save it. Feel free to comment with your thoughts and queries. Don't forget to save this Post. Also share it with your friends and colleagues out there.🎭
tags-
#coding #datastructures #algorithms #google #interview #computerscience #softwareengineer #data #programming
LinkedIn
LinkedIn: Log In or Sign Up
1 billion members | Manage your professional identity. Build and engage with your professional network. Access knowledge, insights and opportunities.