Much APIs

This repository contains the codes for Much's challenge. All code was written in Python 3.7.3.

External packages used:

• black (for code style)
• ipdb (for debugging)
• ipython (for testing)

No need to install any of these for execution.

1. Product Group Tree

To execute the first challenge solution, run:

python3 challenge1.py

The challenge1.py must be on the same folder level as the JSON with the products (product_groups.json).

There is no output, the challenge has a logger that shows the creations being made.

The complexity of the algorithm is O(N²) (Because of the ancestors' search).

2. Random crashes

To execute the second challenge solution, run:

python3 challenge2_runner.py

Both challenge2.py and challenge2_runner.py must be on the same folder level as the JSON with the products (product_groups.json)

The solution will create two files:

1. last.bkp: File with a single integer representing the number of objects saved on the last execution. Located at /tmp.

2. objects.bkp: File with a list of objects that were saved on the last execution. Located at /tmp.

At the final of the execution the objects.bkp file must contain a backup of all objects saved during execution.

There is no output (discarding the files), the challenge has a logger that shows the creations being made.

The complexity of the algorithm is O(N²).

PS: The execution will take a while because of the crashes restart, all file manipulation and loading to memory the backup objects.

3. Product Group Tree #2 - Bulk

To execute the third challenge solution, run:

python3 challenge3_runner.py

Both challenge3.py and challenge3_runner.py must be on the same folder level as the JSON with the products (product_groups.json)

The solution will create two files:

1. last.bkp: File with a single integer representing the number of objects saved on the last execution. Located at /tmp.

2. objects.bkp: File with a list of objects that were saved on the last execution. Located at /tmp.

At the final of the execution the objects.bkp file must contain a backup of all objects saved during execution.

There is no output (discarding the files), the challenge has a logger that shows the creations being made.

The complexity of the algorithm is O(N²).

PS: The PACKAGE_SIZE in the init method can be configured as pleased. Bigger package size means fewer operations, consequently, fewer crashes may happen and with fewer crashes, less accesses to the backup file to restart the execution.

---

Performance

The performance tests were made on a machine with the following setup:

• 6 cores, 12 threads CPU
• 4.1GHz CPU clock
• 16GB RAM

The results for each challenge (average) was:

• Challenge 1:

  • Runtime: 29 seconds

• Challenge 2:

  • Runtime: 2 minutes 55 seconds
  • Crashes (average): 134

• Challenge 3:

  • Runtime: 12 seconds
  • Crashes: 0.3
  • PACKAGE_SIZE: 13100

The runtime may vary depending on the machine and, on challenge 3, the package size.

References

• Git Commit Pattern