Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Hands-On Data Structures and Algorithms with Kotlin

You're reading from   Hands-On Data Structures and Algorithms with Kotlin Level up your programming skills by understanding how Kotlin's data structure works

Arrow left icon
Product type Paperback
Published in Feb 2019
Publisher Packt
ISBN-13 9781788994019
Length 220 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (2):
Arrow left icon
Chandra Sekhar Nayak Chandra Sekhar Nayak
Author Profile Icon Chandra Sekhar Nayak
Chandra Sekhar Nayak
Rivu Chakraborty Rivu Chakraborty
Author Profile Icon Rivu Chakraborty
Rivu Chakraborty
Arrow right icon
View More author details
Toc

Table of Contents (16) Chapters Close

Preface 1. Section 1: Getting Started with Data Structures FREE CHAPTER
2. A Walk Through - Data Structures and Algorithms 3. Arrays - First Step to Grouping Data 4. Section 2: Efficient Grouping of Data with Various Data Structures
5. Introducing Linked Lists 6. Understanding Stacks and Queues 7. Maps - Working with Key-Value Pairs 8. Section 3: Algorithms and Efficiency
9. Deep-Dive into Searching Algorithms 10. Understanding Sorting Algorithms 11. Section 4: Modern and Advanced Data Structures
12. Collections and Data Operations in Kotlin 13. Introduction to Functional Programming 14. Other Books You May Enjoy 15. 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...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at €18.99/month. Cancel anytime