Coding exercise for Python engineering roles at Onlife.

The Process

You will want to fork or clone this repository so you can work on the problem, and share the solution.

You can share the solution by either:

• adding the @svo and @arunzone GitHub users as collaborators to your copy in GitHub
• archiving your local repository and emailing it back to the talent team

The Problem

We want the ability to split a cable n times into the longest equal integer length cables possible; with any remaining cable to be cut into that same length until not possible.

The new behaviour we are asking you to write is to complete a class that will split a cable n times into equal integer lengths as cited above, i.e. if you have:

given_cable = Cable(10, "coconuts")
result = Splitter().split(given_cable, 1))

The result will be an array with two Cable with a length of 5.

Any remainder will also be split into Cable, with their lengths being the same as the existing splits while possible e.g. if we have a cable with a length of 5 and split it twice:

given_cable = Cable(5, "coconuts")
result = Splitter().split(given_cable, 2))

The result will be an array with five Cable with lengths of 1.

• the three Cable that are the longest int lengths that can be done with the two cuts
• the remaining length of 2 split into lengths of 1
  • NOTE: if the initial splits were of length 3 and the remainder was 4, the remainder would be split into a 3 length and 1 length Cable

The following are the minimum/maximum values for Cable.length and times (all inclusive i.e. these values are allowed):

• times:
  • minimum: 1
  • maximum: 64
• length:
  • minimum: 2
  • maximum: 1024

Any request that does not adhere to the constraints is to to raise a ValueError, as is any request that cannot be enacted e.g. a request to split a Cable a number of times that would result in less than 1 for the lengths.

Additionally, the first Cable will have a name of "coconuts-0", the second a name of "coconuts-1".

The number in the name should be right-justified and zero-filled e.g. if the names end up with numbers > 9 and < 100, then the name would take the form:

"coconuts-00"
"coconuts-01"
...
"coconuts-09"
"coconuts-10"

The Solution

We have provided a basic project with some domain models for you to use to deliver a new piece of behaviour.

The project includes the following domain model:

./src/coding_exercise/domain/model/cable.py

This class has the following attributes provided as constructor arguments:

• length:int
• name:str

An empty implementation has been put in place in the following:

./src/coding_exercise/application/splitter.py

The associated tests are in:

./tests/coding_exercise/application/test_splitter.py

The signature of the split method in src/coding_exercise/application/splitter.py is required by an external consumer and should not be modified i.e.:

def split(self, cable: Cable, times: int) -> list[Cable]:

The same is true of the Cable class in src/coding_exercise/domain/model/cable.py i.e. do not modify this file or the associated tests in tests/coding_exercise/domain/model/test_cable.py.

Test

This project uses tox to automate testing. To run the tests do the following:

tox

Tested Configuration

Technology	Version
python	3.11.2
tox	3.28.0

Development Environment

This project includes a Vagrant development environment for convenience.

If you decide to leverage it, you can do the following:

vagrant up
vagrant ssh
cd /vagrant

Tested Configuration

Technology	Version
os	macOS 14.5
vagrant	2.4.1
ansible	2.17.1
colima	0.6.9
docker	27.0.3