LeetCode company repo

A public GitHub repo that aggregates LeetCode interview questions by company (300+ firms including Citadel, Jane Street, Goldman) and sorts them by recency went viral as a study tool — it’s presented as a way to map interview patterns for targeted prep. Recruiters and students are using the list to focus practice for specific buyside and trading interviews (x.com).

The GitHub project leetcode-companywise-interview-questions is published under the user snehasishroy and its README notes a snapshot date of Feb 21, 2026; the repository shows roughly 3.2k stars and about 718 forks in public indices. (github.com) The repository’s file tree contains dozens of company-specific directories and commit entries that update “problem statements” across many firms, with the last bulk updates labeled Feb 21, 2026. (github.com) The README documents built-in filters and metadata fields—time windows (last 30 days, 3 months, 6 months, 1 year) plus attributes such as difficulty, acceptance rate and a frequency percentage to enable ranked filtering. (github.com) This pattern is repeated across multiple public projects; the long-running LeetCode-Questions-CompanyWise repo by krishnadey30 remains one of the most-followed examples and shows roughly 19k stars. (github.com) Community guides and tutorials have surfaced the aggregated lists for targeted practice: a Dev.to walkthrough explains building a company-filtered tool from GitHub sources, and a YouTube walkthrough demonstrating a “company-wise” repo has gathered roughly 1.9k views. (dev.to) Third-party sites and companion projects now expose the same dataset in web apps that advertise broad coverage—one aggregator’s 2026 index advertises access to problems across “1000+” company-specific listings for filtering by difficulty and timeframe. (codinginterviewai.com)

Get your own daily briefing

Scout delivers personalized news, insights, and conversations tailored to your role and industry.

Download on the App Store

Shared from Scout - Be the smartest in the room.