Leetcode
   HOME

TheInfoList



OR:

LeetCode LLC,
doing business as A trade name, trading name, or business name is a pseudonym used by companies that do not operate under their registered company name. The term for this type of alternative name is fictitious business name. Registering the fictitious name with ...
LeetCode, is an online platform for coding interview preparation. The platform provides coding and algorithmic problems intended for users to practice coding. LeetCode has gained popularity among job seekers in the
software industry The software industry includes businesses for development, maintenance and publication of software that are using different business models, mainly either "license/maintenance based" (on-premises) or " Cloud based" (such as SaaS, PaaS, IaaS, ...
and coding enthusiasts as a resource for technical interviews and coding competitions. As of 2025, the website has 26.3 million monthly visitors.


Features

LeetCode offers both free and premium access options. While free users have access to a limited number of questions, premium users gain access to additional questions previously used in interviews at large tech companies. The performance of users' solutions is evaluated based on execution speed and memory usage, and is ranked against other submissions in the LeetCode database. Additionally, LeetCode provides its users with mock interviews and online assessments. LeetCode hosts weekly and biweekly contests, each having 4 problems. After participating in a contest for the first time, one gets assigned a ranking, which can be found in their profile. LeetCode also provides its users with daily challenges, following UTC, with a lucky draw at the end of each month for those who stayed consistent for the month. LeetCode supports a wide range of programming languages, including
Java Java is one of the Greater Sunda Islands in Indonesia. It is bordered by the Indian Ocean to the south and the Java Sea (a part of Pacific Ocean) to the north. With a population of 156.9 million people (including Madura) in mid 2024, proje ...
,
Python Python may refer to: Snakes * Pythonidae, a family of nonvenomous snakes found in Africa, Asia, and Australia ** ''Python'' (genus), a genus of Pythonidae found in Africa and Asia * Python (mythology), a mythical serpent Computing * Python (prog ...
,
JavaScript JavaScript (), often abbreviated as JS, is a programming language and core technology of the World Wide Web, alongside HTML and CSS. Ninety-nine percent of websites use JavaScript on the client side for webpage behavior. Web browsers have ...
, and C. In September 2024, LeetCode China supports
Huawei Huawei Technologies Co., Ltd. ("Huawei" sometimes stylized as "HUAWEI"; ; zh, c=华为, p= ) is a Chinese multinational corporationtechnology company in Longgang, Shenzhen, Longgang, Shenzhen, Guangdong. Its main product lines include teleco ...
's for all problems. The platform features forums where users can engage in discussions related to problems, the interview process, and share their interview experiences.


Types of problems

Every question on LeetCode has a particular category or tag. Some of the most common tags include
arrays An array is a systematic arrangement of similar objects, usually in rows and columns. Things called an array include: {{TOC right Music * In twelve-tone and serial composition, the presentation of simultaneous twelve-tone sets such that the ...
, strings, two pointers,
stack Stack may refer to: Places * Stack Island, an island game reserve in Bass Strait, south-eastern Australia, in Tasmania’s Hunter Island Group * Blue Stack Mountains, in Co. Donegal, Ireland People * Stack (surname) (including a list of people ...
s,
binary search In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the m ...
, sliding windows,
linked list In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the next. It is a data structure consisting of a collection of nodes whi ...
s,
trees In botany, a tree is a perennial plant with an elongated stem, or trunk, usually supporting branches and leaves. In some usages, the definition of a tree may be narrower, e.g., including only woody plants with secondary growth, only p ...
,
trie In computer science, a trie (, ), also known as a digital tree or prefix tree, is a specialized search tree data structure used to store and retrieve strings from a dictionary or set. Unlike a binary search tree, nodes in a trie do not store t ...
s,
backtracking Backtracking is a class of algorithms for finding solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate ("backtracks") as soon as it de ...
, heaps,
priority queue In computer science, a priority queue is an abstract data type similar to a regular queue (abstract data type), queue or stack (abstract data type), stack abstract data type. In a priority queue, each element has an associated ''priority'', which ...
s,
graph Graph may refer to: Mathematics *Graph (discrete mathematics), a structure made of vertices and edges **Graph theory, the study of such graphs and their properties *Graph (topology), a topological space resembling a graph in the sense of discret ...
s,
breadth-first search Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores all nodes at the present depth prior to moving on to the nodes at the next dept ...
,
depth-first search Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible al ...
, dynamic programming,
greedy algorithm A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy strategy does not produce an optimal solution, but a greedy heuristic can yield locally ...
s,
bit manipulation Bit manipulation is the act of algorithmically manipulating bits or other pieces of data shorter than a word. Computer programming tasks that require bit manipulation include low-level device control, error detection and error correction, corr ...
, database problems, and math. As of April 2025, LeetCode offers 3525 questions across its three levels of difficulty; with 873 questions categorized as easy, 1829 as medium, and 823 as hard.


History

LeetCode was founded in Silicon Valley in 2015 by Winston Tang. After moving to the US from Malaysia in 2005, Tang founded the company, citing his own experiences working at Amazon and Google as inspiration. LeetCode expanded its operations to China in 2018, providing Chinese problems, solutions and forums on its Chinese website ''Likou'' (). In 2021, LeetCode secured its first round of funding, receiving a $10 million investment from Lightspeed China Partners.


See also

*
Competitive programming Competitive programming or sport programming is a mind sport involving participants trying to program according to provided specifications. The contests are usually held over the Internet or a local network. Competitive programming is recogn ...


References


External links

* {{Official website American educational websites Programming contests Computer science competitions Software developer communities