Tip 1 : Work on DSA and programming skills
Tip 2 : Be well versed with oops concepts and their application. Don't bluff on your resume and be ready to face any question on whatever you have mentioned there.
Tip 3 : Use playlists available on youtube on interview questions and practice them. Work om your communication skills and be confident.
Tip 1 : Make an only one page resume and highlight your projects, internships and skills.
Tip 2 : Don't put false information on your resume.



If ‘WORDS’ = ["word","world","row"], ‘ORDER’ = "worldabcefghijkmnpqstuvxyz",the answer will be ‘NO’ as first and second words are not lexicographically sorted as ‘l’ comes before ‘d’ in alien language.
We one by one calculate the LCP of each of the given string with the LCP so far. The final result will be our longest common prefix of all the strings.
Note that it is possible that the given strings have no common prefix. This happens when the first character of all the strings are not same.
2nd approach:- The approach is to sort the array of strings and compare the first and last elements of the sorted array. The common prefix between these two elements will be the longest common prefix for the entire array



i) Swap any two rows.
ii) Swap any two columns.
A chessboard matrix is a binary matrix where there are no two 0’s and no two 1’s who are adjacent to each other.
[ [1, 0], [0, 1] ] and [ [0, 1], [1, 0] ] are chessboard matrix whereas [ [1,0], [1, 1] ] isn’t.



1.’Left’ and ‘Right’ both are inclusive in the range ‘Left’ to ‘Right’.
‘Left’ = ‘23’ and ‘Right’ = ‘37’

All prime numbers from ‘23’ to ‘37’ are 23, 29, 31, 37
23 is ‘megaprime’ number because ‘2’ and ‘3’ both are prime
29 is not ‘megaprime’ number because ‘9’ is not a prime
31 is not a ‘megaprime’ number because ‘1’ is not a prime number
37 is ‘megaprime’ number because ‘3’ and ‘7’ both are prime numbers
Hence there are two ‘megaprime’ numbers 23, 37 out of 23, 29, 31, 37.
It happened in morning.
One coding problem on hackerrank.
Basic questions on oops and DBMS
Project description.



'arr '= [1,2,3,4,5]
'k' = 1 rotated array = [2,3,4,5,1]
'k' = 2 rotated array = [3,4,5,1,2]
'k' = 3 rotated array = [4,5,1,2,3] and so on.
Approach:
We will first take mod of K by N (K = K % N) because after every N rotation array will become the same as the initial array.
Now, we will iterate the array from i = 0 to i = N-1 and check,
If i < K, Print rightmost Kth element (a[N + i -K]). Otherwise,
Print array after ‘K’ elements (a[i – K]).
What is normalization?
What are 4 pillars of OOPS?
What are different types of keys in SQL?
It happened in the evening
What is your current location?
Will you be available to join the company on specified date?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?