RequestHunt is a community-driven platform that collects and curates feature requests from X (Twitter), Reddit, and GitHub. We help product teams discover what features real users are asking for, making it easier to validate product ideas and prioritize feature development based on actual user demand.

How does RequestHunt collect feature requests?

RequestHunt uses AI-powered extraction to automatically collect feature requests from social media platforms including X, Reddit, and GitHub. The platform monitors discussions, issues, and posts to identify genuine user feature requests, extracting key information like the requested feature, product mentioned, and user sentiment.

Who uses RequestHunt?

RequestHunt is used by product managers, founders, developers, and product teams who want to discover what features real users are requesting. It's particularly valuable for startups looking to validate ideas, established companies prioritizing their roadmap, and developers building products that solve real user problems.

Is RequestHunt free to use?

Yes, browsing and searching feature requests on RequestHunt is completely free. We also offer API access for developers who want to integrate feature request data into their own applications. Check our pricing page for API plan details.

How often is RequestHunt data updated?

RequestHunt continuously collects feature requests from Reddit, X (Twitter), and GitHub. You can also trigger on-demand scraping via the API or web interface to get the freshest data for any topic.

[TheAlgorithms/Java] Add Stock Span Problem algorithm in Java

I want to add an implementation of the Stock Span Problem to the Java repository. The Stock Span Problem is a classic monotonic-stack algorithm that computes, for each day, how many consecutive previous days had a stock price less than or equal to the current day's price. The implementation runs in linear time using a stack of indices.

Original Source

@@oleksii-tumanov | 0 pts | 3/14/2026

### What would you like to Propose? I want to add an implementation of the Stock Span Problem to the Java repository. The Stock Span Problem is a classic monotonic-stack algorithm that computes, for each day, how many consecutive previous days had a stock price less than or equal to the current day's price. The implementation runs in linear time using a stack of indices. ### Issue details Expected behavior: Given an array of stock prices, the algorithm should return an array where each position contains the span for that day. Example: - prices: [100, 80, 60, 70, 60, 75, 85] - expected result: [1, 1, 1, 2, 1, 4, 6] Planned/implemented test coverage: - mixed example arrays - increasing prices - decreasing prices - repeated equal prices - empty array - single-element array - null input throws `IllegalArgumentException` ### Additional Information _No response_

Discussion

Loading comments...