Automatic Fiverr HeadHunter

Automatic Fiverr HeadHunter Workflow Overview This workflow automates the process of finding and cataloging freelancers on Fiverr. Specifically, it's designed to act as an automated "headhunter" by searching for User-Generated Content (UGC) creators, scraping their gig information from the search results page, and systematically logging it into a Google Sheet. This creates an evergreen, auto-updating database of potential collaborators or hires, eliminating the manual effort of searching and data entry. Technologies Used - n8n Schedule Trigger: Initiates the workflow on an automated schedule. - n8n HTTP Request Node: Performs web scraping to fetch live data from Fiverr. - n8n HTML Node: Parses raw web page content to extract specific, structured data. - Google Sheets: Acts as a simple database to store and organize the scraped freelancer data. Automation Value This workflow provides significant value by automating a time-consuming lead generation and prospecting task. Instead of manually searching Fiverr daily, copying details, and pasting them into a list, this automation builds a targeted list of potential freelancers automatically. It saves countless hours, ensures data is captured consistently and accurately, and provides a ready-to-use dataset for outreach or hiring teams. Node-by-Node Analysis 1. Daily Fiverr Scrape Trigger This Schedule Trigger node is the engine that starts the entire automation. It is configured to activate the workflow once every day at 9:00 AM. This "set it and forget it" approach ensures a fresh list of freelancers is gathered regularly without any manual intervention. 2. Fetch Fiverr Search Results This HTTP Request node acts as the web scraper. Once triggered, it sends a GET request to Fiverr's search page with the query ugc. To ensure a successful request and avoid being blocked, it mimics a real browser by sending specific User-Agent, Accept, and Accept-Language headers. The output of this node is the raw HTML content of the Fiverr search results page, which is then passed to the next node for processing. 3.