Equilibrium Index problem in F#

Yan Cui

I help clients go faster for less using serverless technologies.

This article is brought to you by

Hookdeck: The Serverless Event Gateway

Hookdeck is a reliable and scalable serverless event gateway for sending, receiving, authenticating, transforming, filtering, and routing events between services in your event-driven architecture.

Learn more

A good friend pointed me to a nice coding challenge she encountered – finding the Equilibrium Index of an array in O(n) time.

After a quick discussion we ended up with 2 solutions, and naturally I had to code them up in F#

 

Solution 1

This is the same approach to the one you saw in the O(n) solution I posted the other day for the Multiply Others problem.

Here, we’ll create two temporary arrays – one that’s the running sum from the front, and the other the running sum from the rear, both are O(n) operations.

Once we have both, we can return all the indices where the front and rear arrays are equal.

(the questions usually only ask for one, but it’s nice to see all of them :-P)

This is a O(n) solution in both time and space.

 

Solution 2

A more space efficient, O(1), solution is to:

  • do one pass to sum the array (as the sum to the right)
  • then starting from the front and iteratively subtract elements from that sum until you find an equilibrium index

for example, given the input array [ -1; 3; -4; 5; 1; -6; 2; 1 ], the sum is 1, so if we start from the front of the array:

  • -1 : sum to the left is 0 (no elements), sum to the right is 1 – -1 = 2, no match
  • 3 : sum to the left is -1, sum to the right is 2 – 3 = -1, match, so index 1 is an equilibrium index
  • -4 : sum to the left is -1 + 3 = 2, sum to the right is -1 – -4 = 3, no match
  • 5 : sum to the left is 2 + -4 = -2, sum to the right is 3 – 5 = -2, match, index 3 is also an equilibrium index
  • 1 : sum to the left is -2 + 5 = 3, sum to the right is -2 – 1 = -3, no match
  • -6 : sum to the left is 3 + 1 = 4, sum to the right is -3 – -6 = 3, no match
  • 2 : sum to the left is 4 + -6 = -2, sum to the right is 3 – 2 = 1, no match
  • 1 : sum to the left is -2 + 2 = 0, sum to the right is 1 – 1 = 0, match, index 7 is also an equilibrium index

So, applying this in F# I ended up with this:

notice that I’m generating the output array via comprehensions, this can look a bit odd to people new to F# so I tend to shy away from it and usually go for seq { … } |> Seq.toArray instead.

 

Try it Yourself

 

Links

Whenever you’re ready, here are 4 ways I can help you:

  1. Production-Ready Serverless: Join 20+ AWS Heroes & Community Builders and 1000+ other students in levelling up your serverless game. This is your one-stop shop for quickly levelling up your serverless skills.
  2. Do you want to know how to test serverless architectures with a fast dev & test loop? Check out my latest course, Testing Serverless Architectures and learn the smart way to test serverless.
  3. I help clients launch product ideas, improve their development processes and upskill their teams. If you’d like to work together, then let’s get in touch.
  4. Join my community on Discord, ask questions, and join the discussion on all things AWS and Serverless.

1 thought on “Equilibrium Index problem in F#”

  1. Pingback: F# Weekly #51, 2016 – Sergey Tihon's Blog

Leave a Comment

Your email address will not be published. Required fields are marked *