安裝中文字典英文字典辭典工具!
安裝中文字典英文字典辭典工具!
|
- LeetCode - The Worlds 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
- 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 sponsored companies
- Explore - 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
- 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 if: 1 Open brackets must be closed by the same type of brackets 2 Open brackets must be closed in the correct order 3 Every close bracket has a corresponding open bracket of the
- 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] Output: 6 Explanation: The subarray [4,-1,2,1] has the largest sum 6 Example 2: Input: nums = [1] Output: 1 Explanation: The subarray [1] has the largest sum 1 Example 3: Input: nums = [5,4,-1
- Study Plan - LeetCode
Enhance your coding skills and prepare for job interviews with LeetCode's study plans
- 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 the head of the merged linked list Example 1: Input: list1 = [1,2,4], list2 = [1,3,4] Output: [1,1,2,3,4,4] Example 2: Input: list1 = [], list2 = [] Output: [] Example 3: Input: list1 = [], list2
- Longest Substring Without Repeating Characters - LeetCode
Can you solve this real interview question? Longest Substring Without Repeating Characters - Given a string s, find the length of the longest substring without duplicate characters Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3 Note that "bca" and "cab" are also correct answers Example 2: Input: s = "bbbbb" Output: 1 Explanation: The answer
|
|
|