One more way to do this, will just go on checking with the reference of index value I will check with arr[0] == I+1 if not the missing element is the I+1
public static void main(String[] args) { int [] arr = new int []{1,2,3,5, 6,7,8,9} ; int n= arr. length+1; int sum = n* (n+1) /2; for (int i : arr ){ sum -= i; } System.out .printIn("Missing number is "+sum);
String s = "India is My Country India is My Country"; String s1 = s.substring(0,s.length()/2); String s2 = s.substring(s.length()/2); String result = "\0";
result = s1.toLowerCase(); result += s2.toUpperCase(); System.out.println(result);
Here is the simplest way public class StringQuestion { public static void main(String[] args) { String str="Capgemini Coding Interview Questions Capgemini Coding Interview Questions"; String upper=str.substring(str.length()/2,str.length()).toUpperCase(); String lower=str.substring(0,str.length()/2).toLowerCase(); System.out.println("The final output is "+lower +" " +upper); } }
Cloudtech ,not anymore... I am working on java 11 and it's not this easy for sure they do ask array and some advanced DSA concepts as well.. this looks like fresher interview
Hi Teja, Very good question. This logic can handle upto n = 46300 elements easily. The calculation n*(n +1) will still fit in int data type. If you want even more elements then we can go for long data type.
Hi Ashok, We already know the sum of first 10 numbers using formula sum1 = n*(n+1)/2. We will then take the sum of input array. Missing number = sum1 - sum of input array
He could have taken an variable with initial value of 1 and compare it with every element. If equal, increase value of that variable. Where the variable and element value differ, break the loop and cur value of that variable is the output.
@@AshishKumar-cy7dx No brother. Listen to the problem statement carefully. It says there n numbers are given then the interviewer says suppose 1 to 10 and one number is missing. Also, we don't need nested loops to sort the array. Arrays.sort () function will do it in logN TC
@@lonestoryteller5430 you listen and understand problem statement .u can't use inbuilt function in any interview.its is just one of case in sorted order,you have to write logic for all case.
Great ..now we are aware of character class and its methods, toUpperCase(), toLowerCase()
Really good questions. Thank you!! Please, make videos on questions related to Collection also.
One more way to do this, will just go on checking with the reference of index value I will check with arr[0] == I+1 if not the missing element is the I+1
array need to be sorted
@@parthjethwani1837 yes
public static void main(String[] args) {
int [] arr = new int []{1,2,3,5, 6,7,8,9} ;
int n= arr. length+1;
int sum = n* (n+1) /2;
for (int i : arr ){
sum -= i;
}
System.out .printIn("Missing number is "+sum);
String s = "India is My Country India is My Country";
String s1 = s.substring(0,s.length()/2);
String s2 = s.substring(s.length()/2);
String result = "\0";
result = s1.toLowerCase();
result += s2.toUpperCase();
System.out.println(result);
What is meaning of "\0" ?
@@kiranbhopale1249 means null
Like 0 in integers
Ur logic so simple sir
String s1=s.substring(0,(s.length()/2).toLowerCase();
String s2=s.substring(s.length()).toUpperCase();
@@ramakrishnakoonapareddy3251 i think it's readability is simple
If they really ask these questions I'm gonna go into interviews right now
i was asked missing and repeating number program for 3.5 lpa package
please don't do DS and Algo, we can get this easily.
Do class related videos like Employee, list of employees , increase their salary, group by etc
what if we remove two numbers from an array and then try to find missing number. How can we do that?
String lowerUpperString = new StringBuilder().append(str.substring(0, mid).toLowerCase()).append(str.substring(mid).toUpperCase()).toString();
Here is the simplest way
public class StringQuestion {
public static void main(String[] args) {
String str="Capgemini Coding Interview Questions Capgemini Coding Interview Questions";
String upper=str.substring(str.length()/2,str.length()).toUpperCase();
String lower=str.substring(0,str.length()/2).toLowerCase();
System.out.println("The final output is "+lower +" " +upper);
}
}
So you don't need any actual DSA problem solving skills for Capgemini??
Is it that easy or am i missing something
For Capgemini Java 8 is enough. 👍
Cloudtech ,not anymore... I am working on java 11 and it's not this easy for sure they do ask array and some advanced DSA concepts as well.. this looks like fresher interview
@@rahulkharapkar9962 hii bro
Don't you think for missing number code the formula will result in overflow if n is very very large
Hi Teja,
Very good question.
This logic can handle upto n = 46300 elements easily. The calculation n*(n +1) will still fit in int data type. If you want even more elements then we can go for long data type.
if only one no is missing then only answer will work.what if 2 no are missing .
I must have the worst luck, for a 5LAP job, they asked me codewars morse code advance, as a fresher. 🤣🤣
Hi Gaurav,
Which company 😁
@@cloudtech5260 giyzer systems.
Great! Have a wonderful career ahead 👍
@@cloudtech5260 na, i got rosted in that interview, i didn't know what i am supposed to do😅😅
@@cloudtech5260 official feedback was that, candidate is arrogant, rude and does not know coding.
tysm for teaching begneers
This is not an actual capgemini interview....
This is mock interview with actual questions.
Plz post real time questions
Yes will do. 👍
Excellent
Sound is too low!
We will fix in upcoming videos!! 👍
If I provide the number in put how u find the last element in this case 10
Hi Ashok,
We already know the sum of first 10 numbers using formula sum1 = n*(n+1)/2. We will then take the sum of input array.
Missing number = sum1 - sum of input array
Birlliant
He could have taken an variable with initial value of 1 and compare it with every element. If equal, increase value of that variable. Where the variable and element value differ, break the loop and cur value of that variable is the output.
For that there will be two for loop.time complexity will be O(n^2).here it is O(n).
@@AshishKumar-cy7dx Nope. If the array is sorted and increasing or decreasing by 1, as given in the problem, it will take only linear TC.
@@lonestoryteller5430 array is not sorted.for sorting again you need to run two for loop
@@AshishKumar-cy7dx No brother. Listen to the problem statement carefully. It says there n numbers are given then the interviewer says suppose 1 to 10 and one number is missing. Also, we don't need nested loops to sort the array. Arrays.sort () function will do it in logN TC
@@lonestoryteller5430 you listen and understand problem statement .u can't use inbuilt function in any interview.its is just one of case in sorted order,you have to write logic for all case.
capgi bht chindi company hai package ke mamle me
With 2 year bond😂🤣