argo VS google-maps-scraper

I'm attempting to scrape an overview of all places in one neighbourhood via the Google Nearby Places API in Python. Unfortunately Google limits this to 60 places per request, but I need to find around 2000 of them. I'm a beginner and mostly rely on tutorials, so I followed this, adapted it a bit and I get an .xlsx file with all the data I need. But only for the 60 establishments. I'm not the first one running into this limitation – and someone came up with neat solution, dividing the area of interest into many smaller ones and combining the results: https://github.com/samuelfullerthomas/argo It even checks if there are >60 places in one area and then sub-divides these even more, to make sure none are missing. Exactly what I would need for my code. Unfortunately, said solution is written in JavaScript, which I'm even lacking the very basic knowledge of. I couldn't find anything similar written in Python. Is there any way to implement his solution to my existing Python code? How interoperable are Python and JavaScript? Is there some completely different way that I'm missing here? I'd appreciate any hints on how to approach this.

My scrapers runs at 120 Listing per 10 Minutes. So yours is quite Fast. You can see my scraper at https://github.com/omkarcloud/google-maps-scraper. It is quite popular with 95 Stars.

GitHub Link: https://github.com/omkarcloud/google-maps-scraper

Google Maps Scraper Repository: https://github.com/omkarcloud/google-maps-scraper Helps in extracting data from Google Maps to discover B2B leads for expanding your customer base.