LeetCode 374. Guess Number Higher or Lowerhttps://leetcode.com/problems/guess-number-higher-or-lower/description/?envType=study-plan-v2&envId=leetcode-75We 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 will tell you whether the number I picked is higher or lower than your guess. You call a p..

LeetCode 933. Number of Recent Callshttps://leetcode.com/problems/number-of-recent-calls/submissions/1617618196/?envType=study-plan-v2&envId=leetcode-75 You have a RecentCounter class which counts the number of recent requests within a certain time frame. Implement the RecentCounter class: RecentCounter() Initializes the counter with zero recent requests. int ping(int t) Adds a new request at ti..

LeetCode 1207. Unique Number of Occurrenceshttps://leetcode.com/problems/unique-number-of-occurrences/?envType=study-plan-v2&envId=leetcode-75 Given an array of integers arr, return true if the number of occurrences of each value in the array is unique or false otherwise. Example 1: Input: arr = [1,2,2,1,1,3] Output: true Explanation: The value 1 has 3 occurrences, 2 has 2 and 3 has 1. No two va..

LeetCode 1385. Find the Distance Value Between Two Arrays https://leetcode.com/problems/find-the-distance-value-between-two-arrays/description/ Given two integer arrays arr1 and arr2, and the integer d, return the distance value between the two arrays. The distance value is defined as the number of elements arr1[i] such that there is not any element arr2[j] where |arr1[i]-arr2[j]| Example 1: ..

LeetCode 349. Intersection of Two Arrayshttps://leetcode.com/problems/intersection-of-two-arrays/description/Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any order. Example 1: Input: nums1 = [1,2,2,1], nums2 = [2,2] Output: [2] Example 2: Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4] Ou..