Schonfeld Challenge Solution

Inspiration

I saw the Schonfeld problem, and it looked challenging so I wanted to give it a try!

What it does

This script solves the Schonfeld Street ID Challenge problem.

As the algorithm iterates through the security IDs in the csv, it uses a heap data structure to efficiently keep the data ordered from most to least relevant to the search query.

How I built it

I created this script with Python.

Challenges I ran into

I had to use many new libraries for this script, so the syntax was very unfamiliar, and I spent a lot of time researching syntax. I also had to switch to another csv parser library as the first was not efficient for my use-case.

Last but not least, I did run into a bug that took some time out, but after a short break, I managed to figure out the problem!

Accomplishments that I'm proud of

I'm glad I planned out all the logic before starting to code everything up, because figuring out the syntax for the new libraries was very distracting

What I learned

I learned more about heaps while working on this script. The heap is essential to my script's algorithm, and I had to do a little research and work to tailor the heap to my usage.

Built With

• python