Youssef Noam

The problem was somewhat like this. There were B number of books , L number of Libraries and D days as a deadline. Books were marked from 0 to B-1 as id and each book was associated with some score S, where S[i] is the score for book having id i. There were L libraries and each library have following details: Number of books in the library : N Days required for a library to finish signup process : T Number of books that can be shipped from that library on a single day : M Every Library has to go through a signup process which takes T days to complete and only after that they can start sending books to get scanned. And only one library can complete signup process at a time. But sending of books from the libraries to get scanned can go on in parallel once the signup process is completed for that particular library. Our task is to select libraries in such a manner that it can maximise the score of books sent by the selected libraries to get scanned within deadline D. The solution was a team effort that took about 4 group discussions and multiple testing

This was my first time participating in FINHACK, I have worked with 3 members team on our project "C-BOT". We went through: 1- design thinking 2- business modeling 3- prototyping 4- pitching in front of representatives of "La Banque Centrale Populaire" as well as P-Curiosity Lab