Elements of Programming Interviews in Java: The Insiders’ Guide, 2nd Edition

Elements of Programming Interviews in Java: The Insiders’ Guide, 2nd EditionReviews
Author: Adnan Aziz, Tsung-Hsien Lee, Amit Prakash
Pub Date: 2015
ISBN: 978-1517435806
Pages: 542
Language: English
Format: PDF
Size: 10 Mb


This is the Java version of our book. See the website for links to the C++ version, as well as to a version that uses larger fonts. Have you ever…

  • Wanted to work at an exciting futuristic company?
  • Struggled with an interview problem that could have been solved in 15 minutes?
  • Wished you could study real-world computing problems?

If so, you need to read Elements of Programming Interviews (EPI).
EPI is your comprehensive guide to interviewing for software development roles.
The core of EPI is a collection of over 250 problems with detailed solutions. The problems are representative of interview questions asked at leading software companies. The problems are illustrated with 200 figures, 300 tested programs, and 150 additional variants.
The book begins with a summary of the nontechnical aspects of interviewing, such as strategies for a great interview, common mistakes, perspectives from the other side of the table, tips on negotiating the best offer, and a guide to the best ways to use EPI. We also provide a summary of data structures, algorithms, and problem solving patterns.
Coding problems are presented through a series of chapters on basic and advanced data structures, searching, sorting, algorithm design principles, and concurrency. Each chapter stars with a brief introduction, a case study, top tips, and a review of the most important library methods. This is followed by a broad and thought-provoking set of problems.


Table of Contents


I The Interview
1 Getting Ready
2 Strategies For A Great Interview
3 Conducting An Interview
4 Problem Solving

II Problems
5 Primitive Types
6 Arrays
7 Strings
8 Linked Lists
9 Stacks and Queues
10 Binary Trees
11 Heaps
12 Searching
13 Hash Tables
14 Sorting
15 Binary Search Trees
16 Recursion
17 Dynamic Programming
18 Greedy Algorithms and Invariants
19 Graphs
20 Parallel Computing

III Domain Specific Problems
21 Design Problems
22 Language Questions
23 Object-Oriented Design
24 Common Tools

IV The Honors Class
25 Honors Class