HackerRank | Max Array Sum | Solution Explained (Java + Whiteboard )

Published: 28 July 2020
on channel: Xavier Elon

5,362

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

The description reads:"Given an array of integers, find the subset of non-adjacent elements with the maximum sum. Calculate the sum of that subset.

For example, given an array [-2, 1, 3, -4,5] we have the following possible subsets:

Subset Sum
[-2, 3, 5] 6
[-2, 3] 1
[-2, -4] -6
[-2, 5] 3
[1, -4] -3
[1, 5] 6
[3, 5] 8
Our maximum subset sum is 8"

FOLLOW ME:
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 HackerRank | Max Array Sum | Solution Explained (Java + Whiteboard ) with a duration of hours minute second in good quality, which was uploaded by the user Xavier Elon 28 July 2020, share the link with friends and acquaintances, this video has already been watched 5,362 times on youtube and it was liked by 67 viewers. Enjoy your viewing!