Software Engineer

Convert Snake Case string to Camel Case in Java.

You are given a string 'STR'. Your task is to count the number of special palindromic substrings of size greater than 1 that the given string contains. A substring is said to be a special palindrome in the following two cases:

If all the characters in the substring are the same.

If the length of the substring is odd and only the middle element is different, while all the other characters are the same. 

Example:

“aba” is a special palindrome, while “abaa” is not

Was given 2 tables and asked to apply left and inner join on them.

There is a room with a door (closed) and three light bulbs. Outside the room, there are three switches, connected to the bulbs. You may manipulate the switches as you wish, but once you open the door you can’t change them. Identify each switch with its bulb. All bulbs are in working condition.

Give fifty words that don't have the the alphabet 'a' in them.

Was asked to perform right join, left join and inner join on two tables. And then to compared the number of rows in the output.

How to multiply two numbers without using the multiply operator.

Where do I see myself in the next 5 years?

Asked about my preferred job location and the reason behind it.