This repository contains all the data structure programs in C programming language

Collection of LeetCode questions to ace the coding interview!

A breadth-first version of the UNIX find command

recreation of snake game with "ai" mode

A graph search visualiser built over Numpy and Pygame, with an ability to visualise custom-made search algorithms!

Code from Problem Solving with Algorithms and Data Structures using Python

solving challenges from various problem sites like advent of code, leet code and others

My LC submissions

This C++ project implements an Emergency Travel Planning System using graph theory's adjacency lists, employing BFS and DFS for efficient city navigation. It optimizes routes based on user preferences for minimizing travel time or cost, with dynamic memory management for city and route data.

👓 Visualization of the Breadth First Search pathfinding algorithm

A Graph Data Structure in Pure Swift

Primer trabajo práctico de la materia Programación III, 1S, UNGS. El repositorio original está en gitlab y fue migrado aquí. Los contribuidores son https://gitlab.com/santiagodarce1, https://gitlab.com/feedex20 y https://gitlab.com/MatiKK

This repository contains solution to all the LeetCode questions I've solved! Daily grind 🏃 (Updating)

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

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

The Breadth First Search Algorithm, written in P5JS

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

Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures.