Imagine you have only two eggs and a 100 story building in front of you. Describe an algorithm (or technique) to minimize the number of throws (or tries) to determine where the egg will start to break when thrown off the building. If the egg breaks when thrown from that floor, it will always break from that floor or higher (i.e. all eggs have the same results per floor; they break or they don't).
Whats your greatest strengths ?
Using some functions they gave me which operate with cells in spreadsheets, I had to compute sum of an array. Later I had to implement by myself those functions: the trickiest thing was to implement the part when some cell is a sum of two other cells and some of those two cells is a some of some other cells and so on ...
What's your salary?
What port number does https:// use?
Given two strings, merge them -> so that "abc" and "def" becomes "adbecf" for example"
2 - in C#, can you tell whether whatever the user has input is a string or integer?
Open to relocate ?
You don't have any wood experience, right?
How many different ways are there to paint a fence if no more than two adjacent fence posts can be the same color?
Viewing 2021 - 2030 interview questions