They used codility for OA, so i coulnd't get any feedback. I had 3 days to do it.
Feedback loop was very quick, like 2 days.
First problem was a binary search one.
Second problem was a string one (greedy).
Third was finding all number of squares set to 0 that can reach all squares set to 1 in a binary matrix.
Completed all 3, but i bruteforced the third.
If you need me to expand on something just comment, i think it's enough (since the whole process was less than a week) but i'm happy to help.