Write the algorithm for this: If you have a string aaabbc the output should be a3b2c1, for the string aabcc the output should be a2b1c2 and so on. You should not allocate memory for a new string and you can do this only by reading each character once. Ps: if the result is bigger than the original string (like abc -> a1b1c1) just return null or some message that makes that clear.
Given two rectangles, check if they intersect? He also asked me if I have seen the question before to which I replied I had but that I had not tried solving it.
Questions included in my description
Write code to solve a problem in Polish notation. e.g : 1 2 3 + / is 1/(2+3)
multiply 2 numbers without using * sign
implement a function thet gets a string ans prints all string permutetions
Medium- easy level coding question. Technical Testing/automation experience related questions
Write a method to reverse the order of words in a string. e.g.: "This is a string" -> "string a is This"
Normal coding pattern question with few validation
What would your 30-60-90 day plan be?
Viewing 431 - 440 interview questions