https://github.com/sourceallies/javascript-data-structures
A library of commonly used data structures for JavaScript interviews.
https://github.com/sourceallies/javascript-data-structures
Last synced: 11 months ago
JSON representation
A library of commonly used data structures for JavaScript interviews.
- Host: GitHub
- URL: https://github.com/sourceallies/javascript-data-structures
- Owner: sourceallies
- License: other
- Created: 2016-09-26T14:49:34.000Z (almost 10 years ago)
- Default Branch: master
- Last Pushed: 2016-10-03T01:00:48.000Z (almost 10 years ago)
- Last Synced: 2025-08-07T16:05:39.719Z (11 months ago)
- Language: JavaScript
- Size: 16.6 KB
- Stars: 1
- Watchers: 4
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
Since JavaScript doesn't have official implementations for any of the popular data
structures, this might come in handy when doing candidate interviews with JavaScript.
## Installation
```
npm i @sourceallies/data-structures --save-dev
```
## Data Structures
### Stack
```js
import {Stack} from '@sourceallies/data-structures';
const stack = new Stack();
```
| Function | Description |
|--------------------------|--------------------------------------------------------------------------------------------|
| `stack.size()` | Returns the size of the stack. |
| `stack.push(element)` | Adds `element` to the top of the stack. |
| `stack.peek()` | Returns the top element in the stack. Throws an error if the stack is empty. |
| `stack.pop()` | Returns and removes the top element in the stack. Throws an error if the stack is empty. |
### Queue
```js
import {Queue} from '@sourceallies/data-structures';
const queue = new Queue();
```
| Function | Description |
|--------------------------|--------------------------------------------------------------------------------------------|
| `queue.size()` | Returns the size of the queue. |
| `queue.enqueue(element)` | Adds `element` to the back of the queue. |
| `queue.peek()` | Returns the next element in the queue. Throws an error if the queue is empty. |
| `queue.dequeue()` | Returns and removes the next element in the queue. Throws an error if the queue is empty. |
### Hashmap
```js
import {Hashmap} from '@sourceallies/data-structures';
const hashmap = new Hashmap();
```
| Function | Description |
|--------------------------------|----------------------------------------------------------------------------------|
| `hashmap.size()` | Returns the number of key-value pairs in this map |
| `hashmap.put(key, value)` | Associates the given value with the given key in this map |
| `hashmap.get(key)` | Returns the value associated with this key, or `undefined` if it doesn't exist |
| `hashmap.getKeys()` | Returns an array of all keys in this map |
| `hashmap.containsKey(key)` | Returns `true` if the given key is present in this map |
| `hashmap.containsValue(value)` | Returns `true` if this map contains one or more keys that map to the given value |
| `hashmap.remove(key)` | Removes the key-value pair, if present | |
## License
[Apache Public License v2.0](https://github.com/sourceallies/javascript-data-structures/blob/master/LICENSE)