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

# Summary

In this chapter, we learnt that a stack is a simple linear data structure abstracting all elements from the user except the very last one.

A queue is one of the widely used data structures. Using a queue, we can solve many problems, such as distributing time among processors in a round-robin mechanism, job scheduling, a print queue in a printer, messaging systems, asynchronous applications, and so on. A queue uses the FIFO method to operate on its data. In addition to FIFO, a queue can also be represented as a LIFO or FCFS data structure.

If we've a scenario where the buffer is of a fixed size, then we should always go for fixed queue implementation, for example, a queue in a cinema theatre. Here, the seat count is 200, so we can create a buffer size of 200 and, as the people come in, we serve them in the FCFS manner until all 200 seats are full.

Whereas if you can...