#### Overview of this book

Data structures and algorithms are more than just theoretical concepts. They help you become familiar with computational methods for solving problems and writing logical code. Equipped with this knowledge, you can write efficient programs that run faster and use less memory. Hands-On Data Structures and Algorithms with Kotlin book starts with the basics of algorithms and data structures, helping you get to grips with the fundamentals and measure complexity. You'll then move on to exploring the basics of functional programming while getting used to thinking recursively. Packed with plenty of examples along the way, this book will help you grasp each concept easily. In addition to this, you'll get a clear understanding of how the data structures in Kotlin's collection framework work internally. By the end of this book, you will be able to apply the theory of data structures and algorithms to work out real-world problems.
Table of Contents (16 chapters)
Preface
Free Chapter
Section 1: Getting Started with Data Structures
A Walk Through - Data Structures and Algorithms
Arrays - First Step to Grouping Data
Section 2: Efficient Grouping of Data with Various Data Structures
Introducing Linked Lists
Understanding Stacks and Queues
Maps - Working with Key-Value Pairs
Section 3: Algorithms and Efficiency
Deep-Dive into Searching Algorithms
Understanding Sorting Algorithms
Section 4: Modern and Advanced Data Structures
Collections and Data Operations in Kotlin
Introduction to Functional Programming
Other Books You May Enjoy
Assessments

# Group of unique elements – Set, MutableSet

Set also has two variants in Kotlin, like List or any other collection—Set and MutableSet. Like List, Set is read-only and MutableList and MutableSet are the mutable versions of Set, which contain the read/write functionalities.

As with List, Set also has read-only properties and functions, such as size, isEmpty(), get(index: Int), and so on. We are not describing them here again to avoid redundant contents in this book. The big difference between Set and List is that, Set doesn't do ordering like List (unless you use OrderedSet), so it lacks the functions that involve orders, such as indexOf(item), add(index, item) , and so on.

Set, as you already know from earlier chapters, represents mathematical sets (the ones in Set theory).

From previous chapters, you already know that we cannot put duplicate items in sets. If...