22. Generate Parentheses - LeetCode
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example 1: Input: n = 3 Output ...
LeetCode - The World's Leading Online Programming Learning …
Not only does LeetCode prepare candidates for technical interviews, we also help companies identify top technical talent. From sponsoring contests to providing online assessments and …
Generate Parentheses - LeetCode
Can you solve this real interview question? Generate Parentheses - Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for …
Trapping Rain Water - LeetCode
Example 1: [https://assets.leetcode.com/uploads/2018/10/22/rainwatertrap.png] Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 Explanation: The above elevation map (black section) is …
Minimum Height Trees - LeetCode
Example 1: [https://assets.leetcode.com/uploads/2020/09/01/e1.jpg] Input: n = 4, edges = [ [1,0], [1,2], [1,3]] Output: [1] Explanation: As shown, the height of the tree is 1 when the root is the …
Top Interview 150 - Study Plan - LeetCode
Copyright © 2026 LeetCode Help Center Jobs Bug Bounty Assessment Students Terms Privacy Policy United States
Self Dividing Numbers - LeetCode
Given two integers left and right, return a list of all the self-dividing numbers in the range [left, right] (both inclusive). Example 1: Input: left = 1, right = 22 Output: …
Path Sum II - LeetCode
Example 1: Input: root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22 Output: [[5,4,11,2],[5,8,4,5]] Explanation: There are two paths whose sum equals targetSum: 5 + 4 + …
LRU Cache - LeetCode
Can you solve this real interview question? LRU Cache - Design a data structure that follows the constraints of a Least Recently Used (LRU) cache [https://en ...
Problem List - LeetCode
Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.