Class Design on Vhaos's Leetcode Solutions

Class Design on Vhaos's Leetcode Solutions https://vhaos-leetcode-solutions.now.sh/tags/class-design/ Recent content in Class Design on Vhaos's Leetcode Solutions Hugo -- gohugo.io en-us Kareem Daggash Thu, 01 Oct 2020 01:00:52 +0100 Number of Recent Calls https://vhaos-leetcode-solutions.now.sh/leetcodedaily/october/1-number-of-recent-calls/ Thu, 01 Oct 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/october/1-number-of-recent-calls/ LeetCode October - Day 1 Problem Statement 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 time t, where t represents some time in milliseconds, and returns the number of requests that has happened in the past 3000 milliseconds (including the new request). Implement Rand10 Using Rand https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/28-implement-rand10-using-rand7/ Fri, 28 Aug 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/28-implement-rand10-using-rand7/ LeetCode August - Day 28 Problem Statement Given the API rand7() that generates a uniform random integer in the range [1, 7], write a function rand10() that generates a uniform random integer in the range [1, 10]. You can only call the API rand7(), and you shouldn’t call any other API. Please do not use a language’s built-in random API. Each test case will have one internal argument n, the number of times that your implemented function rand10() will be called while testing. Stream of Characters https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/23-stream-of-characters/ Sun, 23 Aug 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/23-stream-of-characters/ LeetCode August - Day 23 Problem Statement Implement the StreamChecker class as follows: StreamChecker(words): Constructor, init the data structure with the given words. query(letter): returns true if and only if for some k >= 1, the last k characters queried (in order from oldest to newest, including this letter just queried) spell one of the words in the given list. Example: StreamChecker streamChecker = new StreamChecker(["cd","f","kl"]); // init the dictionary. Iterator for Combination https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/13-iterator-for-combination/ Thu, 13 Aug 2020 01:00:52 +0100 https://vhaos-leetcode-solutions.now.sh/leetcodedaily/august/13-iterator-for-combination/ LeetCode August - Day 13 Problem Statement Design an Iterator class, which has: A constructor that takes a string characters of sorted distinct lowercase English letters and a number combinationLength as arguments. A function next() that returns the next combination of length combinationLength in lexicographical order. A function hasNext() that returns True if and only if there exists a next combination. Example: // creates the iterator. CombinationIterator iterator = new CombinationIterator("abc", 2); iterator.