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

# Understanding Stacks and Queues

In previous chapters, we covered linear data structures, such as an array, vector, and LinkedList. We were able to do any operation with any element. This chapter focuses mostly on abstracting those operations only to a certain element. This kind of abstraction can be looked at when we understand about data structures, such as stacks and queues. A stack is a data structure that allows us only to operate on the last element, whereas a queue allows us only to operate on the first and last element.

The following topics will be covered in this chapter:

• Understanding stacks
• Operations on stacks
• Implementation of stacks
• Understanding queues
• Operations on queues
• Implementation of queues
• Introducing circular queues
• Understanding deque ( short for double-ended queue)