Study Plan - LeetCode Enhance your coding skills and prepare for job interviews with LeetCode's study plans
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
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
Two Sum - LeetCode A really brute force way would be to search for all possible pairs of numbers but that would be too slow Again, it's best to try out brute force solutions just for completeness It is from these brute force solutions that you can come up with optimizations
Profile - 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
Sliding Window Maximum - LeetCode Can you solve this real interview question? Sliding Window Maximum - You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right You can only see the k numbers in the window Each time the sliding window moves right by one position Return the max sliding window Example 1: Input: nums = [1,3,-1,-3,5,3,6,7], k
Calendário