Implement valid 1-D convolution

Q: Implement valid 1-D convolution

This question evaluates a candidate's understanding of 1-D convolution operations, windowed array manipulation, boundary and edge-case handling, and the ability to analyze time and space complexity.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Implement a 'valid' 1‑D convolution function: given an input array of numbers, a kernel array of numbers, and a scalar bias, compute outputs only where the kernel fully overlaps the input, adding the bias to each output. Define the function signature, handle cases where the kernel is empty or longer than the input, clarify assumptions (e.g., stride = 1), and analyze time and space complexity.

Implement valid 1-D convolution

Overview

Comments (0)