Solving programming problems is never one-size-fits-all. Whether in selection processes or when you want your application to perform better, there are several paths available.
The purpose of the presentation is to compare the possibilities (in memory complexity, time, readability, and code maintainability) with a problem that will be solved with different algorithms and data structures in Go.
We will list the positive and negative points of each approach, addressing topics such as performance, callstacks, heap memory, recursion, queues, linked lists, slices (and arrays).