Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

day190

package

v0.0.0-...-36687a4 Latest Latest Go to latest Published: Oct 28, 2020 License: MIT Imports: 0 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/vaskoz/dailycodingproblem-go

Links

Open Source Insights

Documentation ¶

Index ¶

func KadaneAlg(nums []int) int
func MaxWrapSubarraySum(nums []int) int

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

func KadaneAlg ¶

func KadaneAlg(nums []int) int

KadaneAlg implements https://en.wikipedia.org/wiki/Maximum_subarray_problem#Kadane's_algorithm

func MaxWrapSubarraySum ¶

func MaxWrapSubarraySum(nums []int) int

MaxWrapSubarraySum returns the maximum possible sum for a subarray in a circular array. Runs in O(N) time and O(N) space because the data is mutated.

Types ¶

This section is empty.

Source Files ¶

View all Source files

problem.go