Define a macro for byte offset of a given field in a structure.
Software Engineer Software Developer Interview Questions
467,307 software engineer software developer interview questions shared by candidates
How would you speed up your typical bit reversal algorithm?
One of the questions was asked by Ahmed Bashir, who (I later learned) was a Director level and the manager of the hiring manager. The question was as follows. You are given 25 horses. In each race only up to 5 horses can run and each race only reveals the ranking between the horses (i.e., we do not know the actual time). What is the minimum number of races you need to have in order to reveal the 3 fastest horses between the 25.
Is the given number a bitwise palindrome?
How can we write multiple strings to a file while keeping them separated?
''' We want to implement a feature to suggest to users the cheapest hotel that is more popular than the one they are looking at. Write a function that given an array of hotels, sorted by their popularity returns a map from the hotel ids that associates each hotel with the cheapest hotel that is more popular than the one in question. if there is no hotel that is cheaper and more popular than the one with that id, then it shouldn't be put in the map. You can assume that hotel ids and prices are integers and that hotels have the following format: struct hotel{ int id; int price; } Example 1: input = [ { id => 123, price => 200 }, # Most popular { id => 55, price => 150 }, # Second most popular { id => 17, price => 70 }, # Third most popular { id => 18, price => 500 }, # ... { id => 27, price => 270 }, { id => 101, price => 230 } # Least popular ] output = { 18 : 17, 27 : 17, 101 : 17 }
This function performs a basic smoothing of inlist and returns the result (outlist). Both lists have the same length, N. Each item in inlist is assumed to have type 'float', and 'h' is assumed to be an integer. For each i, outlist[i] will be the average of inlist[k] over all k that satisfy i-h <= k <= i+h and 0 <= k <= N-1.
Suppose you are going from a jungle in your jeep. One of the wheel comes off its axel. All the wheels have 4 nut each to hold on to the axel. You dont have any mechanic shop near by. The place is dangerous so you cant go walking. How will you fix your car and resume your journey.
Tell me about yourself
Reversal of all words in a sentence(e.g: "This is a good question" becomes "question good a is This")
Viewing 1971 - 1980 interview questions