Write a function to find the maximum for each and every contiguous subarray of size k.

Write a function to find the maximum for each and every contiguous subarray of size k.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: medium

标签: interviewbit, data-structure, topic-specific, data-structures, algorithms

参考答案摘要

Input: N = 9, K = 3 arr[] = {1, 2, 3, 1, 4, 5, 2, 3, 6} Output: {3, 3, 4, 5, 5, 5, 6} Explanation: In the first subarray of size 3: {1,2,3}, the value 3 is maximum, similarly for all such subarrays fo...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。