5
Arrays, Collections, and Data Structures
This chapter includes 24 problems covering three main topics. We start with several problems related to the new Vector API dedicated to parallel data processing. We continue with several data structures, including Rope, Skip List, K-D Tree, Zipper, Binomial Heap, Fibonacci Heap, Pairing Heap, Huffman Coding, and so on. Finally, we discuss the three most popular join algorithms.
At the end of this chapter, you’ll know how to write code for exploiting data parallel processing, exploiting a bunch of cool and lesser-known data structures, and how join operations work. And, as a bonus, you’ll be familiar with the JDK 21 Sequenced Collections API.
Problems
Use the following problems to test your programming ...
Get Java Coding Problems - Second Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
