Skip to content

added Question #5 #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
ygit merged 2 commits into from
Nov 12, 2019
Merged

added Question #5 #5

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
bb696c7
addedQuestion5
ygit Nov 11, 2019
66e06c8
update meta badge hyper link
ygit Nov 11, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 14 additions & 2 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,10 +1,22 @@
# Coding Problems

[![GitHub commit activity](https://img.shields.io/github/commit-activity/w/swiftmumbai/codingProblems)](https://github.com/swiftmumbai/chatkit/pulls)
[![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen)](https://github.com/swiftmumbai/codingProblems/pulls)

Solve Coding Interview Problems using Swift

Ready for First Question?
Solve it & raise a Pull Request.
Ready for First Question?
Solve it & raise a Pull Request! 🎉

---

#5 This problem was asked by Facebook.

Given a circular array, compute its maximum subarray sum in O(n) time. A subarray can be empty, and in this case the sum is 0.

For example, given [8, -1, 3, 4], return 15 as we choose the numbers 3, 4, and 8 where the 8 is obtained from wrapping around.

Given [-4, 5, 1, 0], return 6 as we choose the numbers 5 and 1.

---

Expand Down