Skip to main content

Programming Interviews Exposed: Secrets to Landing Your Next Job, 3rd Edition

Programming Interviews Exposed: Secrets to Landing Your Next Job, 3rd Edition

John Mongan, Noah Suojanen Kindler, Eric Giguère

ISBN: 978-1-118-28340-0

Nov 2012

336 pages

$19.99

Product not available for purchase

Description

Be prepared for your next job interview with this tried-and-true advice

In today's tight job market, competition for programming jobs is hotter than ever. This third edition of a popular guide to programming interviews includes new code examples, information on the latest languages, new chapters on sorting and design patterns, tips on using LinkedIn, and a downloadable app to help prepare applicants for the interview. Like its earlier editions, this guide covers what software companies and IT departments want their programmers to know and includes plenty of helpful hints to boost your confidence.

  • Looks at current job search and hiring processes, such as the rise of LinkedIn and other social networks as recruiting resources
  • Addresses the most important languages for a programmer to know and features examples in multiple languages
  • Includes new programming questions designed to sharpen your knowledge
  • Features all-new chapters on design patterns and sorting, including how to deal with memory constraints and mobility issues

Walk into your next job interview with confidence, knowing you have thoroughly studied this newest edition of Programming Interviews Exposed.

Preface xxv

Introduction xxix

Chapter 1: Before the Search 1

Chapter 2: The Job Application Process 9

Chapter 3: Approaches to Programming Problems 19

Chapter 4: Linked Lists 31

Chapter 5: Trees and Graphs 61

Chapter 6: Arrays and Strings 85

Chapter 7: Recursion 107

Chapter 8: Sorting 125

Chapter 9: Concurrency 145

Chapter 10: Object-Oriented Programming 159

Chapter 11: Design Patterns 167

Chapter 12: Databases 177

Chapter 13: Graphics and Bit Manipulation 191

Chapter 14: Counting, Measuring, and Ordering Puzzles 207

Chapter 15: Graphical and Spatial Puzzles 225

Chapter 16: Knowledge-Based Questions 239

Chapter 17: Nontechnical Questions 253

Appendix: Résumés 263

Conclusion 283

Index 285

Equations on page 277
These equations should all appear at the bottom of page 277.
Download
ChapterPageDetailsDatePrint Run
26Error in Text
In the final statement of the second to last paragraph, the text currently reads:
O(n)

It should read:
O(n^2)
12/12/2012

26Error in Text
Currently reads: "beginning"
Should read: "end"
1/2/2014

29Error in Text
Third bullet point, second list, should read:
20 log 20 ≈ 26.02 (replace = with ≈)
12/14/2012

33Error in Text
The first line should be: ~IntElement() {}
12/14/2012

124Error in Text
In the third paragraph, running time reads:
O(3^n+1)

but should read:
O(3^n)
12/14/2012

205Error in Text
In the first paragraph following code, last line: the text ", in 1957" (which conflicts with the date of the citation) should be deleted.
12/14/2012

57Text Correction: Error in Code
On page 57, there needs to be a check for null in the exploreAndSeparate function.
if(curNode->child->prev){
curNode->child->prev->next = NULL;
This check is needed because the recursive method can visit the same element multiple times. I can send an example unflattened list, which after being flattened, will cause the program to crash.
05/01/15