Which edge case matters for this problem?

Practice this question from Subarray Sum Equals K - Prefix Sum Hashmap Pattern Practice Quiz, with options and an explanation.

Question

Which edge case matters for this problem?

Option A — Correct answer

Negative numbers require prefix sums instead of sliding window.

Option B

Whether the graph is connected

Option C

Whether the array is rotated

Option D

Whether the tree is balanced

Explanation

Negative numbers require prefix sums instead of sliding window.

Subarray Sum Equals K - Prefix Sum Hashmap Pattern Practice Quiz

All questions · Previous question

Open on QuizMaker