About 51 results
Open links in new tab
  1. 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.

  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. Contest - LeetCode

    Enhance your coding abilities and get valuable real-world feedback by participating in contests on LeetCode. You can also win up to 5000 LeetCoins per contest, as well as bonus prizes from …

  4. LeetCode 75 - Study Plan - LeetCode

    LeetCode 75 Summary 75 Essential & Trending Problems Must-do problem list for interview prep Best for 1~3 month of prep time

  5. Account Login - 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.

  6. 3Sum - LeetCode

    Can you solve this real interview question? 3Sum - Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j ...

  7. Maximum Subarray - LeetCode

    Can you solve this real interview question? Maximum Subarray - Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] …

  8. Minimum Path Sum - LeetCode

    1. Please don't post any solutions in this discussion. 2. The problem discussion is for asking questions about the problem or for sharing tips - anything except for solutions. 3. If you'd like to share your …

  9. Container With Most Water - LeetCode

    Can you solve this real interview question? Container With Most Water - You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) …

  10. Trapping Rain Water - LeetCode

    Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example 1: Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6 …