Cody

Problem 378. Inhomogenous Depth Scale Interpolation

I recently came across a dataset for physical ocean parameters such as temperature and salinity that provided data in the form of a 3-Dimensional array of depths and a 3-Dimensional array of the parameters where each point on the first two dimensions corresponds to a latitude and longitude, respectively, and the points in the third dimension corresponds to depths.

Given a target depth, return the linearly interpolated values of the data at that depth without using the keywords for or while in your code.

For example, if Z and V are arrays with size [ M, N, D ], the output matrix V2 would be of size [ M N ].

Test Case Details:

  • The depth array, Z, will always start at 0 and end at 1, which are also the bounds of the target depth d. This is so that you do not have to handle "edge" cases.
  • The depth array, Z, will always be sorted in the third dimension.
  • Both input arrays will be the same size.
  • The test cases are randomly generated and your solution is tested against a simple for-looping code.

Solution Stats

55.56% Correct | 44.44% Incorrect
Last solution submitted on Apr 02, 2019

Problem Comments

Solution Comments

Recent Solvers7

Suggested Problems

More from this Author57