LeetCode 560 | Subarray Sum Equals K | Solution Explained (Java + Whiteboard)

Published: 27 July 2020
on channel: Xavier Elon

3,005

The description reads:
"Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.

Example 1:

Input:nums = [1,1,1], k = 2
Output: 2

Constraints:

The length of the array is in range [1, 20,000].
The range of numbers in the array is [-1000, 1000] and the range of the integer k is [-1e7, 1e7].
Accepted
353,953
Submissions
807,646"

Running Time: O(N)
Space Complexity: O(N)

Always be pluggin:
Slack Channel: https://join.slack.com/t/xavierelonle...
Github: https://github.com/xavierelon1
Facebook:   / xavier.hollingsworth.3
Instagram:   / xavierelon
LinkedIn:   / xavier-hollingsworth-524144127
Twitter:   / elon_xavier

On this page of the site you can watch the video online LeetCode 560 | Subarray Sum Equals K | Solution Explained (Java + Whiteboard) with a duration of hours minute second in good quality, which was uploaded by the user Xavier Elon 27 July 2020, share the link with friends and acquaintances, this video has already been watched 3,005 times on youtube and it was liked by 44 viewers. Enjoy your viewing!

13,912

323