Technical2026-08-13
Data structures and algorithms
AI-Expanded — inferred from the question title, not from the original candidate report
Given an array of integers, design an efficient algorithm to find the length of the longest subarray where the sum of elements is equal to a target value k. Your solution should handle both positive and negative integers and aim for a time complexity of O(n) using an appropriate data structure.
Context & Summary
Online assessment with coding problems and MCQs
💻 Coding practice works best on desktop.
Code editors are too cramped on mobile screens.
Conceptual Question
This appears to be a conceptual, design, or behavioral question rather than an algorithmic coding problem. The code editor and automated test cases have been disabled for this question.
Back to questions
InterviewDigest