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")
Problem solving # 1 : (9 marks) Input is [1,34,3,98,9,76,45,4] and the output should be 998764543431
A file contains a billion integers, try to find any one integer that is not in the file.
How to would you find out whether a substring occurs in a given string?
Q: Describe some real life applications of machine learning
Logic based questions. Scenarios. Code reviews
your given 2 ordered list A and list B. B has enough space to hold its existing numbers plus all the numbers in A. Add the numbers from A in B. Make sure B is ordered. Whats the fastest way to do this?
Viewing 1981 - 1990 interview questions