About 4,760,000 results
Open links in new tab
  1. 17. Letter Combinations of a Phone Number - LeetCode

    Note that 1 does not map to any letters. [https://assets.leetcode.com/uploads/2022/03/15/1200px-telephone-keypad2svg.png] Example 1: Input: digits = "23" Output: …

  2. Explore - LeetCode

    LeetCode Explore is the best place for everyone to start practicing and learning on LeetCode. No matter if you are a beginner or a master, there are always new topics waiting for you to explore.

  3. Word Search - LeetCode

    Example 1: [https://assets.leetcode.com/uploads/2020/11/04/word2.jpg] Input: board = [ ["A","B","C","E"], ["S","F","C","S"], ["A","D","E","E"]], word = "ABCCED" Output: true Example 2: …

  4. Add Two Integers - LeetCode

    Example 1: Input: num1 = 12, num2 = 5 Output: 17 Explanation: num1 is 12, num2 is 5, and their sum is 12 + 5 = 17, so 17 is returned. Example 2: Input: num1 = -10, num2 = 4 Output: -6 Explanation: …

  5. Brick Wall - LeetCode

    Example 1: [https://assets.leetcode.com/uploads/2025/01/17/a.png] Input: wall = [ [1,2,2,1], [3,1,2], [1,3,2], [2,4], [3,1,2], [1,3,1,1]] Output: 2 Example 2: Input: wall = [ [1], [1], [1]] Output: 3 Constraints: * …

  6. Climbing Stairs - LeetCode

    Can you solve this real interview question? Climbing Stairs - You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can …

  7. Missing Number - LeetCode

    Can you solve this real interview question? Missing Number - Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array. …

  8. LeetCode - The World's Leading Online Programming Learning Platform

    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.

  9. Image Smoother - LeetCode

    If one or more of the surrounding cells of a cell is not present, we do not consider it in the average (i.e., the average of the four cells in the red smoother). …

  10. New 21 Game - LeetCode

    Example 2: Input: n = 6, k = 1, maxPts = 10 Output: 0.60000 Explanation: Alice gets a single card, then stops. In 6 out of 10 possibilities, she is at or below 6 points. Example 3: Input: n = 21, k = 17, …