Lunski's Clutter

Given a sorted array A of unique numbers, find the K-th missing number starting from the leftmost number of the array.

Example 1

1
2
3
4

Input: A = [4,7,9,10], K = 1
Output: 5
Explanation: 
The first missing number is 5.

Example 2:

1
2
3
4

Input: A = [4,7,9,10], K = 3
Output: 8
Explanation: 
The missing numbers are [5,6,8,…], hence the third missing number is 8.

Example 3:

1
2
3
4

Input: A = [1,2,4], K = 3
Output: 6
Explanation: 
The missing numbers are [3,5,6,7,…], hence the third missing number is 6.

Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],…] (si < ei), find the minimum number of conference rooms required.

Example 1

1
2

Input: [[0, 30],[5, 10],[15, 20]]
Output: 2

Example 2

1
2

Input: [[7,10],[2,4]]
Output: 1

Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],…] (si < ei), determine if a person could attend all meetings.

Example 1:

1
2

Input: [[0,30],[5,10],[15,20]]
Output: false

Example 2:

1
2

Input: [[7,10],[2,4]]
Output: true

Given two strings s and t , write a function to determine if t is an anagram of s.

Example 1:

1
2

Input: s = "anagram", t = "nagaram"
Output: true

Example 2:

1
2

Input: s = "rat", t = "car"
Output: false

Note:
You may assume the string contains only lowercase alphabets.

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].

The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.

You must write an algorithm that runs in O(n) time and without using the division operation.

Example 1:

1
2

Input: nums = [1,2,3,4]
Output: [24,12,8,6]

Example 2:

1
2

Input: nums = [-1,1,0,-3,3]
Output: [0,0,9,0,0]