A breadth-first version of the UNIX find command

Collection of LeetCode questions to ace the coding interview!

Search, Knowledge, Uncertainty, Optimization, Learning, Neural Networks and Language.

This is a repository created to store the leetcode questions. This maynot be the most efficient way of solving the problem.

Prácticas para la materia de Inteligencia Artificial - FI UNAM 2024-2

My LC submissions

A web application showcasing pathfinding algorithms like BFS, A*, and Bi-directional Search with interactive demonstrations. Includes a maze generator for further exploration.

This section of the repository serves as a comprehensive exploration of a wide range of data structures and algorithms. From the foundational arrays to the complexities of graphs and trees, with a commitment to clarity, depth, and practicality, this repository is designed to be your go-to resource for mastering data structures and algorithms.

A repository of offline javascript-powered tools for visualising 2D path planning on binary occupancy grids and LEGO-EV3 related activities.

Find the shortest path between two works based on the crossovers they had.

Find the shortest path between two football players using the breadth-first search algorithm.

Find the shortest path between two Wikipedia articles using breadth-first search.

An experimental tool to find fastest winning moves using bruteforce for the board game Splendor

Project: Knights Travails

An asdf plugin for bfs, the breadth-first UNIX find variant

AI searching Algorithms Implementation with Nodejs

My assignments, labs, and code snippets from INF135 (Advanced Programming) at UiB (University of Bergen)

Players were tasked with navigating to the end of a maze, at which point the game would be over.