5, 10 or 20 seats+ for your team - learn more
Play the role of chief guest engagement officer at an amusement park. You’ve decided to model the visitor experience by using a queue data structure to simulate guests waiting in line for a ride. The park’s sales and marketing department would also like you to study what might happen if VIP (very important pocketbook!) visitors are allowed to jump to the front of various park attraction lines using a special pass. As you carry out these tasks, you’ll experiment with different types of queues, write a function to detect loops in a linked list, build a queue using a doubly linked list, and create trees, fundamental data structures in many algorithms. When you’re done, you’ll have the experience and skills you need to build a complete waiting-customer model and other programs using linked data structures in Go.
This liveProject is for Go programmers, from beginning level to advanced, who want to learn how to create models in Go using linked data structures. To begin these liveProjects you’ll need to be familiar with the following:
geekle is based on a wordle clone.