安裝中文字典英文字典辭典工具!
安裝中文字典英文字典辭典工具!
|
- 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
- Study Plan - LeetCode
Enhance your coding skills and prepare for job interviews with LeetCode's study plans
- 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
- 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 you climb to the top? Example 1: Input: n = 2 Output: 2 Explanation: There are two ways to climb to the top 1 1 step + 1 step 2 2 steps Example 2: Input: n = 3 Output: 3 Explanation: There
- Palindrome Number - LeetCode
Can you solve this real interview question? Palindrome Number - Given an integer x, return true if x is a palindrome, and false otherwise Example 1: Input: x = 121 Output: true Explanation: 121 reads as 121 from left to right and from right to left Example 2: Input: x = -121 Output: false Explanation: From left to right, it reads -121 From right to left, it becomes 121- Therefore it is not
- Swapping Nodes in a Linked List - LeetCode
You are given the head of a linked list, and an integer k Return the head of the linked list after swapping the values of the k th node from the beginning and the k th node from the end (the list is 1-indexed) Example 1: Input: head = [1,2,3,4,5], k = 2 Output: [1,4,3,2,5] Example 2: Input: head = [7,9,6,6,7,8,3,0,9,5], k = 5 Output: [7,9,6,6,8,7,3,0,9,5] Constraints: The number of nodes in
- Word Break - LeetCode
Can you solve this real interview question? Word Break - Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words Note that the same word in the dictionary may be reused multiple times in the segmentation Example 1: Input: s = "leetcode", wordDict = ["leet","code"] Output: true Explanation: Return
- 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
|
|
|