Filter by
Utility
7 items found
Knights Travails
Category:
vanilla
utility
data structure and algorithm
Knights Travails is a program that calculates the shortest path for a knight on a chessboard to move from a starting position to a target position. It uses a graph-based approach to explore all possible moves and determine the optimal path.
Source code: https://github.com/gofhilman/knights-travails
Binary Search Trees
Category:
featured
vanilla
utility
data structure and algorithm
This project creates a balanced Binary Search Tree (BST) manually in JavaScript. It includes various methods to manipulate and traverse the tree, ensuring efficient data storage and retrieval.
Source code: https://github.com/gofhilman/binary-search-trees
Hashmap
Category:
vanilla
utility
data structure and algorithm
This project creates a HashMap class manually in JavaScript, which is a data structure that maps keys to values. It uses a hashing function to determine the index for storing key-value pairs in an array of linked lists. The HashMap dynamically resizes itself when the load factor exceeds a certain threshold, ensuring efficient operations.
Source code: https://github.com/gofhilman/hashmap
Linked List
Category:
vanilla
utility
data structure and algorithm
This project creates a LinkedList class manually in JavaScript. The LinkedList class provides a dynamic data structure that allows for efficient insertion, deletion, and traversal of elements. Each node in the linked list contains a value and a reference to the next node, forming a chain-like structure.
Source code: https://github.com/gofhilman/linked-lists
