LeetCode 731. My Calendar II
Description https://leetcode.com/problems/my-calendar-ii/ Implement a MyCalendarTwo class to store your events. A new event can be added if adding the event will not…
Be a Good Techer and Tech for Good. www.goodtecher.com
Description https://leetcode.com/problems/my-calendar-ii/ Implement a MyCalendarTwo class to store your events. A new event can be added if adding the event will not…
Description https://leetcode.com/problems/odd-even-jump/ You are given an integer array A. From some starting index, you can make a series of jumps. The…
Description https://leetcode.com/problems/maximize-distance-to-closest-person/ You are given an array representing a row of seats where seats[i] = 1 represents a person sitting in the ith seat, and seats[i] =…
Description https://leetcode.com/problems/coordinate-with-maximum-network-quality/ You are given an array of network towers towers and an integer radius, where towers[i] = [xi, yi, qi] denotes the ith network tower with…
Description https://leetcode.com/problems/mean-of-array-after-removing-some-elements/ Given an integer array arr, return the mean of the remaining integers after removing the smallest 5% and the largest 5% of the elements.…
Description https://leetcode.com/problems/candy/ There are N children standing in a line. Each child is assigned a rating value. You are giving candies to…
Description https://leetcode.com/problems/fruit-into-baskets/ In a row of trees, the i-th tree produces fruit with type tree[i]. You start at any tree of your choice, then repeatedly perform…
Description https://leetcode.com/problems/meeting-rooms-ii/ Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],…] (si < ei), find the minimum number…
Description https://leetcode.com/problems/number-of-recent-calls/ You have a RecentCounter class which counts the number of recent requests within a certain time frame. Implement the RecentCounter class: RecentCounter() Initializes…
Description https://leetcode.com/problems/maximum-distance-in-arrays/ Given m arrays, and each array is sorted in ascending order. Now you can pick up two integers from two…