#248

Longest Subarray with Sum K

MediumSliding Window

Solve the classic problem: "Longest Subarray with Sum K". This is a medium Sliding Window problem commonly asked in placement interviews at top tech companies. Read the examples carefully and think about edge cases before coding your solution.

Examples

Input: Example input goes here

Output: Expected output

Walk through the logic step by step.

Input: Second test case

Output: Another expected output

class Solution:
    def longestSubarraywithSumK(self):
        # Write your solution here
        pass

Output

Run your code to see output here.