Tip 1 : practise at least 50 questions of Array and String Questions
Tip 2 : practise on OOPS concept problem code with 5 pillars of oops
Tip 3 : practise on at least 40 questions on Pattern printing and recursion problems
at least one project is Mandatory
Tip 1 : At least one projects which we are done in Final yr of engineering
Tip 2 : Do not put false things on resume.
These are the online Mcq test which contains 45 mcq questions
What are DDL and DML command
Tip 1:five DDL commands in SQL:
CREATE Command
DROP Command
ALTER Command
TRUNCATE Command
RENAME Command
Tip 2:
Tip 3:
1 hr google meet interview
starts with introducing and then 20 mins theory question on OOPS concept
last 40 mins logical programming questions



I make the first string mutuable then i make stringBuilder.
String reverseWords(String S)
{
StringBuilder sb=new StringBuilder();
int l=S.length();
int temp=l-1;
int j=0;
int count=0;
for(int i=l-1;i>=0;i--){
if(S.charAt(i)=='.')
{
if(count==0){
j=i;
sb.append(S.substring(j+1,temp+1));
temp=j;
count++;
sb.append('.');
}
else{
j=i;
sb.append(S.substring(j+1,temp+1));
temp=j;
}
//sb.append('.');
}
}
if(sb.length()==0){
sb.append(S);
}
sb.append(S.substring(0,j));
return sb.toString();
}
These are the second round of interview of Google meet ,Interviewer is too good



If two or more such subarrays exist, return any subarray.
Firstly i create Array list to add the numbers of array
static ArrayList subarraySum(int[] arr, int n, int s)
{
ArrayList list = new ArrayList<>();
int sum=0 , count=0;
for(int i=0; is){
sum = sum - arr[count];
count++;
}
if(sum == s){
list.add(0,count+1);
list.add(1,i+1);
return list;
}
}
list.add(0,-1);
return list;
}

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?