Giuseppe Moschetta (Pepe)'s repositories
graph-traversal-implementation
This repository provides a simple yet effective implementation of fundamental graph traversal techniques, perfect for those looking to understand or utilize BFS and DFS in their projects.
BST-Binary-Search-Tree-Implementation
Recursive Implementation of Search and Insert Operations in a Binary Search Tree
reverse-linked-list
This project demonstrates the implementation of a singly linked list in JavaScript, including functionality to reverse the list. It is designed for a data processing tool, and includes basic operations such as node insertion, list traversal, and list reversal, with accompanying test cases to ensure correctness.
twoSum-app
The TwoSum App is a simple JavaScript application designed to find two indices in an array whose values add up to a given target sum. This project is a practical implementation of the popular "Two Sum" coding problem. It includes a simple interface
data-packet-routing
Implementation of DFS algorithm for data packet routing in a network traversing a graph and a binary tree
BFS-algorithm-implementation
BFS Algorithm to shortest path for rescuing project
cohort-tools-project-pep
Starter code for the BE MP "REST API" (Cohort Tools app)
lab-express-mongoose-recipes-v2-pep
Mini LAB - Express Mongoose Recipes (v2)
json-server-backend-pep
Starter code for the json-server lesson "Creating a Backend API"