Binary Search in JavaScript
Binary search is a great way to improve lookup time on a sorted data set. You can go from O(n) to O(log n), which »
Track Min/Max Using a Stack in O(1) Time
Previously, we built a stack in JavaScript [https://learnjswith.me/implement-a-stack-in-javascript/]. We are going to extend that by solving a coding challenge. How do you track »
Implement an LRU Cache in JavaScript
A least recently used (LRU) cache is a cache implementation that discards the least recently used item when the cache becomes full. This requires keeping track »
Implement a Queue in JavaScript
What is a Queue? Let's ask Wikipedia [https://en.wikipedia.org/wiki/Queue_(abstract_data_type)]. > In computer science, a queue is a particular kind of »
Implement a Stack in JavaScript
What is a Stack? See Wikipedia [https://en.wikipedia.org/wiki/Stack_(abstract_data_type)]. > In computer science, a stack is an abstract data type that »