CLRS study. Codes are written with golang.

This is the collection of solutions to some computer problems, mainly leetcode

Get all paths in graph using by edges

Algorithms and data structures implementation in Go

Geração de Labirintos

Backend for Online TicTacToe game - invite friends to play TicTacToe on a board of any size and winning condition! Built wit Gin-Gonic, MongoDB, Pusher and Vercel.

I built a full-stack application where users interact with a 20x20 grid to select a start and end tile. The backend, built with Go, calculates the shortest path using Depth-First Search (DFS) and Breadth-First Search (BFS) and returns the result to the frontend. The frontend visually highlights the computed path.

This Go program demonstrates a basic binary tree traversal using Depth-First Search (DFS).

This project contains implementation for BFS and DFS algorithms, and data structures such as Stack, Queue and Graph. It can be run using command line arguments.