Javascript Coding Exercise: The QuickSort Implementation in Javascript
Given an array of integers nums, sort the array in ascending order. Example 1: Input: Output: Example 2: Input: Output: Note: 1 <= A.length <= 10000 -50000 <= A …
In-place Run-Length String Compressions using C++
Given an array of characters, compress it in-place. The length after compression must always be smaller than or equal to the original array. Every element of the array should …
Algorithms to Compute the Factor Combinations for An Integer using DFS and BFS
Numbers can be regarded as product of its factors. For example, 8 = 2 x 2 x 2; = 2 x 4. Write a function that takes an integer …
How to Design a High Performance/Scalable Hit Counter Class?
June 11, 2019
algorithms, c / c++, coding exercise, data structure, design questions, OOP
No Comments
Design a hit counter which counts the number of hits received in the past 5 minutes. Each function accepts a timestamp parameter (in seconds granularity) and you may assume …
Finding Out Which Content Is Unacceptable For Your Website
Memorable domain name? Check. Really cool color scheme and navigation? Check. Content that your audience loves? Uh-oh. No worries this is where most website owners go wrong. They slave …
Depth First Search to Compute the Permutation with Duplicates: Letter Tile Possibilities
You have a set of tiles, where each tile has one letter tiles printed on it. Return the number of possible non-empty sequences of letters you can make. Example …