This repository contains solutions to both Nyansa Exercise problems.
Code is in the urlHits.py file.
#Note: Time complexity analysis:
The worst case time complexity will be O(n), where n are the total entries (lines) in the 'input.txt' file and n is greater than the distinct dates and urls.
Solution is in the producer-consumer file