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.
LeetCode4 寻找两个正序数组地中位数 LeetCode15 三数之和 LeetCode75 颜色分类 LeetCode76 最小覆盖...
LeetCode476https://leetcode.com/problems/number-complement/ LeetCode477https://leetcode.com/problems/total-hamming-distance/ LeetCode693https://leetcode.com/problems/binary-number-with-alternating-bits/ LeetCode762https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/ Leet...
Excel Sheet Column Number 172. Factorial Trailing Zeroes 173. Binary Search Tree Iterator 174. Dungeon Game 179. Largest Number 187. Repeated DNA Sequences 190. Reverse Bits 191. Number of 1 Bits 198. House Robber 199. Binary Tree Right Side View 200. Number of Islands 201. Bitwise AND ...
Can you solve this real interview question? Third Maximum Number - Given an integer array nums, return the third distinct maximum number in this array. If the third maximum does not exist, return the maximum number. Example 1: Input: nums = [3,2,1]
Happy Number (medium) Middle of the LinkedList (easy) 4. Pattern: Merge Intervals,区间合并模式 区间合并模式是一个用来处理有区间重叠的很高效的技术。在设计到区间的很多问题中,通常咱们需要要么判断是否有重叠,要么合并区间,如果他们重叠的话。这个模式是这么起作用的: 给两个区间,一个是a,另外一个是b。
:question: My LeetCode solutions. Contribute to MrHuxu/leetcode development by creating an account on GitHub.
...for those who wanted to navigate through LeetCode, but only know the question number What's this? This is a simple LeetCode navigator that goes to a selected LeetCode project via number input. How to visit? Either go to https://leetvigator.vercel.app, or: Build Leetvigator locally...
[LeetCode] Ugly Number (A New Question Added Today) Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include2, 3, 5. For example,6, 8are ugly while14is not ugly since it includes another prime factor7....
[LeetCode]Happy Number Question Write an algorithm to determine if a number is “happy”. A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number ...