There is a one-dimensional garden of length n. In each position of the n length garden, a fountain has been installed. The fountain at the ith position has a value a[i] (1 <= i <= n) that describes the coverage limit of fountain i. A fountain can cover the range from the positon max((i-a[i]),1) to min ((i + a[i]),n). In the beginning, all the fountains are switched off. Determine the minimum number of fountains you need to activate so that the whole n length garden will b covered by water.
Write a Python function to rotate the elements of an N-by-N matrix by 90, 180, or 270 degrees in either a clockwise or counterclockwise direction.
Throttling Gateway
Programming to determine whether 2 triangles are equivalent? Equivalence is defined as one triangle can exactly covered by another after spinning and moving.
Find a point within the triangle that minimize the sum of distances to vertices
1 question was based on wiggle sort, other was some dice problem.
What is time complexity in Python? What is multiple inheritance? Can you explain this? etc
Coding interview was based on Python and probability questions. Coding interview had string manipulation and tokenization question & one dynamic programming question
First round - 2 coding questions 2nd question: Asks you to compute the stock price averaged over time.
Ask to finish 2 programming questions in hackerrank for 1 hour.
Viewing 991 - 1000 interview questions