Codility Algorithm Practice Lesson 9: Maximum Slice Problem, Task 3: MaxDoubleSliceSum — a Python approach

Deck451
3 min readOct 17, 2021
This is the Department and Water and Power building in Downtown Los Angeles (John Ferraro Building).
Photo by Josh Rose on Unsplash

Good day! Time to finish the Maximum slice problem challenges in style. Last time we had the Maximum slice sum task. Now, we’re going to solve Maximum double slice sum. How? Coming right up :)

The task: we’re given a non-empty array A that contains N integers. The task defines a double

--

--

Deck451

Senior Software Engineer. Open-source contributor. Knowledge spreader. Fan of everything Python. Cybersecurity enthusiast. TryHackMe top 3%.