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

Questions

1. Implement a fixed-sized double-ended queue (FixedDeque).
2. Implement a dynamic-sized circular queue.
3. Imagine a situation where lots of people are standing in a queue to enter a temple and the queue gets enqueued by a group of people. Similarly, it gets dequeued by a group of people. So we need to have the enqueue() and dequeue() APIs to support collections instead of just a single element.
4. To enter into a temple, there are three queues and each queue is associated with a ticket system. All of these three queues get served based on their priority. The higher the ticket cost, the higher the priority they get served. Design such a kind of system using a queue that understands priority. The ticket prices are as follows:
1. Free—the longer queue as more people opt for it
2. ₹50—A bit shorter queue
3. ₹100— The Shortest queue
5. Implement a queue...