leetcode Guess Number Higher or Lower
We are playing the Guess Game. The game is as follows:
I pick a number from 1 to n. You have to guess which number I picked.
Every time you guess wrong, I’ll tell you whether the number is higher or lower.
You call a pre-defined API
guess(int num)which returns 3 possible results (
123 -1 : My number is lower1 : My number is higher0 : Congrats! You got it!
123 n = 10, I pick 6.Return 6.
leetcode Super Pow
Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.
1234 a = 2b = Result: 8
1234 a = 2b = [1,0]Result: 1024
leetcode Sum of Two Integers
Calculate the sum of two integers a and b, but you are not allowed to use the operator
Given a = 1 and b = 2, return 3.
leetcode Largest Divisible Subset
Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj% Si = 0.
If there are multiple solutions, return any subset is fine.
123 nums: [1,2,3]Result: [1,2] (of course, [1,3] will also be ok)
123 nums: [1,2,4,8]Result: [1,2,4,8]
leetcode Valid Perfect Square
Given a positive integer num, write a function which returns True if num is a perfect square else False.
Note: Do not use any built-in library function such as
12 Input: 16Returns: True
12 Input: 14Returns: False
leetcode Water and Jug Problem
You are given two jugs with capacities x and y litres. There is an infinite amount of water supply available. You need to determine whether it is possible to measure exactly z litres using these two jugs.
- Fill any of the jugs completely.
- Empty any of the jugs.
- Pour water from one jug into another till the other jug is completely full or the first jug itself is empty.
12 Input: x = 2, y = 6, z = 4Output: True
12 Input: x = 2, y = 6, z = 5Output: False
leetcode Max Sum of Rectangle No Larger Than K
Given a non-empty 2D matrix matrix and an integer k, find the max sum of a rectangle in the matrix such that its sum is no larger than k.
12345 Given matrix = [[1, 0, 1],[0, -2, 3]]k = 2
The answer is
2. Because the sum of rectangle
[[0, 1], [-2, 3]]is 2 and 2 is the max number no larger than k (k = 2).
- The rectangle inside the matrix must have an area > 0.
- What if the number of rows is much larger than the number of columns?
leetcode 169. Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than⌊ n/2 ⌋ times.
You may assume that the array is non-empty and the majority element always exist in the array.
leetcode Russian Doll Envelopes
You have a number of envelopes with widths and heights given as a pair of integers
(w, h). One envelope can fit into another if and only if both the width and height of one envelope is greater than the width and height of the other envelope.
What is the maximum number of envelopes can you Russian doll? (put one inside other)
Given envelopes =
[[5,4],[6,4],[6,7],[2,3]], the maximum number of envelopes you can Russian doll is
3([2,3] => [5,4] => [6,7]).
leetcode Intersection of Two Arrays
Given two arrays, write a function to compute their intersection.
Given nums1 =
[1, 2, 2, 1], nums2 =
[2, 2], return
- Each element in the result must be unique.
- The result can be in any order.