{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"ds-1000","formal_name":"DS-1000","introduction":"DS-1000 builds 1,000 data-science problems from real StackOverflow questions across seven libraries including NumPy, Pandas and Matplotlib. The problems are perturbed so that recalling the original answer does not solve them.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://ds1000-code-gen.github.io/","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"562f9278-8f0e-58fc-a67d-cc4e7c669385","task_key":"default--test--815","task_revision_id":"1","upstream_id":"815","short_description":"How to find relative extrema of a 2D array? An element is a relative extrema if…","config":"default","split":"test","body":"{\"library\":\"Scipy\",\"prompt\":\"Problem:\\nHow to find relative extrema of a 2D array? An element is a relative extrema if it is less or equal to the neighbouring n (e.g. n = 2) elements forwards and backwards in the row. \\nThe result should be a list of indices of those elements, [0, 1] stands for arr[0][1]. It should be arranged like\\n[[0, 1], [0, 5], [1, 1], [1, 4], [2, 3], [2, 5], ...]\\nA:\\n<code>\\nimport numpy as np\\nfrom scipy import signal\\narr = np.array([[-624.59309896, -624.59309896, -624.59309896,\\n                      -625., -625., -625.,], [3, 0, 0, 1, 2, 4]])\\nn = 2\\n</code>\\nresult = ... # put solution in this variable\\nBEGIN SOLUTION\\n<code>\\n\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://ds1000-code-gen.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}