You're reading from The Complete Coding Interview Guide in Java An effective guide for aspiring Java developers to ace their programming interviews

Product type Paperback

Published in Aug 2020

Publisher Packt

ISBN-13 9781839212062

Length 788 pages

Edition 1st Edition

Languages

Java

Concepts

Programming Language

Author (1):

Anghel Leonard

View More author details

Table of Contents (25) Chapters

Preface

1. Section 1: The Non-Technical Part of an Interview

2. Chapter 1: Where to Start and How to Prepare for the Interview FREE CHAPTER

3. Chapter 2: What Interviews at Big Companies Look Like

4. Chapter 3: Common Non-Technical Questions and How To Answer Them

5. Chapter 4: How to Handle Failures

6. Chapter 5: How to Approach a Coding Challenge

7. Section 2: Concepts

8. Chapter 6: Object-Oriented Programming

9. Chapter 7: Big O Analysis of Algorithms

10. Chapter 8: Recursion and Dynamic Programming

11. Chapter 9: Bit Manipulation

12. Section 3: Algorithms and Data Structures

13. Chapter 10: Arrays and Strings

14. Chapter 11: Linked Lists and Maps

15. Chapter 12: Stacks and Queues

16. Chapter 13: Trees and Graphs

17. Chapter 14: Sorting and Searching

18. Chapter 15: Mathematics and Puzzles

19. Section 4: Bonus – Concurrency and Functional Programming

20. Chapter 16: Concurrency

21. Chapter 17: Functional-Style Programming

22. Chapter 18: Unit Testing

23. Chapter 19: System Scalability

24. Other Books You May Enjoy

Leave a review - let other readers know what you think

Coding challenges

Now that we have had a brief overview of trees and graphs, it is time to challenge ourselves with the 25 most popular coding problems encountered in interviews about these topics.

As usual, we have a mix of problems that are usually encountered by the top companies of the world, including IT giants such as Amazon, Adobe and Google. So, let's get started!

Coding challenge 1 – Paths between two nodes

Problem: Consider you've been given a directed graph. Write a snippet of code that returns true if there is a path (route) between two given nodes.

Solution: Let's consider the directed graph shown in the following diagram:

Figure 13.15 – Paths from D to E and vice versa

If we consider nodes D and E, then we can see that from D to E, there are three paths, while from E to D, there are none. So, if we start from D and traverse the graph (via BFS or DFS) then, at some point, we have to pass through node E,...