About 50 results
Open links in new tab
  1. LeetCode - The World's Leading Online Programming Learning …

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

    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. Study Plan - LeetCode

    Enhance your coding skills and prepare for job interviews with LeetCode's study plans.

  4. Array - 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.

  5. Valid Parentheses - LeetCode

    Can you solve this real interview question? Valid Parentheses - Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid …

  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

    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 …

  8. Merge Two Sorted Lists - LeetCode

    You are given the heads of two sorted linked lists list1 and list2. Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists. Return …

  9. Spiral Matrix - LeetCode

    Given an m x n matrix, return all elements of the matrix in spiral order. Example 1: Input: matrix = [[1,2,3],[4,5,6],[7,8,9]] Output: [1,2,3,6,9,8,7,4,5] Example 2 ...

  10. Reorder List - LeetCode

    Can you solve this real interview question? Reorder List - You are given the head of a singly linked-list. The list can be represented as: L0 → L1 → … → Ln - 1 → Ln Reorder the list to be …