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.
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
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

Operations on queues

Queues allow for operating only on the front and rear elements. Some basic operations are as follows:

• Insertion: This allows you to insert an element at the last index (rear) of the queue. This operation can also be termed EnQueue.
• Deletion: Allows you to delete an element from the first index (front) of the queue. This operation can also be termed DeQueue.

In addition to these two primary operations, a queue can also allow a few other operations, such as the following:

• front(): Returns the element at the front without mutating the queue
• rear(): Returns the element at the rear without mutating the queue
• isEmpty(): Tells whether a queue is empty or not
• isFull(): Tells whether a queue is full or not
• size(): Returns the size of the queue

If we closely observe the operations it allows us to do, we can notice that the element that's being enqueued first...