Algorithm · Waymo · Medium
Requirements Write a max-pooling operation that accepts either a matrix or a tensor. For every pooling window, return the largest element it contains. As a follow-up, extend the result so that each maximum is accompanied by its location. Before coding, explicitly define the window dimensions, vertical and horizontal strides, edge or padding treatment, tensor layout, and the rule used when multiple entries share the maximum value. Use this exact starter signature: For this…
Checking your access…