Data Structures
Challenge 03 - Sorting Flights by Price
In this Challenge, you are going to be figuring out how you can sort slices in Go
Difficulty: Beginner
Challenge 04 - Checking for Duplicates
In this challenge, we are going to implement a function that allows us to check and see if there are duplicates within a list in Go
Difficulty: Intermediate
Challenge 05 - Implementing a Stack in Go
In this challenge, you will be implementing some of the core functionality of the Stack data structure in Go!
Difficulty: Advanced
Challenge 06 - Implementing a Queue in Go
In this challenge, you will be implementing some of the core functionality of the Queue data structure in Go!
Difficulty: Advanced
Challenge 07 - Minimums, Maximums and Errors
In this Challenge, you are going to find the cheapest and most expensive flights from a list in Go
Difficulty: Intermediate
Challenge 08 - Check Permutations
In this challenge, you are going to be building a function that takes in two string values and checks to see if they are permutations of each other!
Difficulty: Intermediate
Challenge 09 - 🔗 Singly Linked Lists
In this challenge, you will be implementing the basic functionality of a singly linked list in Go!
Difficulty: Advanced
Challenge 10 - Word Frequencies
In this challenge, you will be tasked with efficiently counting the frequencies of words in Go!
Difficulty: Beginner
Challenge 11 - Sets and Subsets
In this challenge, you are going to be implementing a function that checks to see if a set is a sub-set.
Difficulty: Intermediate