Chapter 11: Linked Lists and Maps

This chapter covers the most popular coding challenges involving maps and linked lists that you will encounter in coding interviews. Since singly linked lists are preferred in technical interviews, most of the problems in this chapter will exploit them. However, you can challenge yourself and try to solve each such problem in the context of a doubly linked list as well. Commonly, the problems become easier to solve for a doubly linked list because a doubly linked list maintains two pointers for each node and allows us to navigate back and forth within the list.

By the end of this chapter, you'll know all of the popular problems involving linked lists and maps, and you'll have enough knowledge and understanding ...

Get The Complete Coding Interview Guide in Java now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.