000 04290cam a2200397Ii 4500
001 946058293
003 OCoLC
005 20190729110535.0
008 160104t20162015caua 000 0 eng
020 _a9780984782857 (pbk)
020 _a0984782850 (pbk)
035 _a(OCoLC)946058293
040 _aAU@
_beng
_erda
_cAU@
_dOCLCO
_dOCLCF
_dAMH
_dRRR
_dOBE
050 4 _aQA76.6
_b.L33 2016
082 0 4 _a005.1023
_223
100 1 _aMcDowell, Gayle Laakmann,
_d1982-
245 1 0 _aCracking the coding interview :
_b189 programming questions and solutions /
_cGayle Laakmann McDowell.
246 3 0 _a189 programming interview questions and solutions
250 _a6th edition.
264 1 _aPalo Alto, CA
_bCareerCup, LLC,
_c2016.
264 4 _c©2015
300 _ax, 696 pages :
_billustrations ;
_c26 cm
336 _atext
_btxt
_2rdacontent
336 _astill image
_bsti
_2rdacontent
337 _aunmediated
_bn
_2rdamedia
338 _avolume
_bnc
_2rdacarrier
505 0 _aI. The interview process. Why? ; How questions are selected ; It's all relative ; Frequently asked questions -- II. Behind the scenes. The Microsoft interview ; The Amazon interview ; The Google interview ; The Apple interview ; The Facebook interview ; The Palantir interview -- III. Special situations. Experienced candidates ; Testers and SDETs ; Product (and program) management ; Dev lead and managers ; Startups ; Acquisitions and acquihires ; For interviewers -- IV. Before the interview. Getting the right experience ; Writing a great resume ; Preparation map -- V. Behavioral questions. Interview preparation grid ; Know your technical projects ; Responding to behavioral questions ; So, tell me about yourself -- VI. Big O. An analogy ; Time complexity ; Space complexity ; Drop the constraints ; Drop the non-dominant terms ; Multi-part algorithms : add vs. multiply ; Amortized time ; Log N runtimes ; Recursive runtimes ; Examples and exercises -- VII. Technical questions. How to prepare ; What you need to know ; Walking through a problem ; Optimize & Solve Technique # 1 : Look for BUD ; Optimize & Solve Technique #2 : DIY (Do it yourself) ; Optimize & Solve Technique #3 : Simplify and generalize ; Optimize & Solve Technique #4 : Base case and build ; Optimize & Solve Technique #5 : Data structure brainstorm ; Best conceivable runtime (BCR) ; Handling incorrect answers ; When you've heard a question before ; The 'perfect' language for interviews ; What good coding looks like ; Don't give up! -- VIII. The offer and beyond. Handling offers and rejection ; Evaluating the offer ; Negotiation ; On the job -- IX. Interview questions. Data structures: Arrays and strings ; Linked lists ; Stacks and queues ; Trees and graphs ; Concepts and algorithms. Bit manipulation ; Math and logic puzzles ; Object-oriented design ; Recursion and dynamic programming ; System design and scalability ; Sorting and searching ; Testing ; Knowledge based. C and C++ ; Java ; Databases ; Threads and locks ; Additional review problems: Moderate ; Hard -- X. Solutions. Data structures ; Concepts and algorithms ; Knowledge based ; Additional review problems -- XI. Advanced topics. Useful math ; Topological sort ; Dijkstra's algorithm ; Hash table collision resolution ; Rabin-Karp substring search ; AVL trees ; Red-black trees ; MapReduce ; Additional studying -- XII. Code library. HashMapList <T, E> ; TreeNode (Binary search tree) ; LinkedListNode (Linked list) ; Trie & TrieNode -- XIII. Hints. Hints for data structures ; Hints for concepts and algorithms ; Hints for knowledge-based questions ; Hints for assorted review problems -- XIV. About the author.
520 _aNow in the 6th edition, the book gives you the interview preparation you need to get the top software developer jobs. This is a deeply technical book and focuses on the software engineering skills to ace your interview. The book includes 189 programming interview questions and answers, as well as other advice.
650 0 _aComputer programming
_vProblems, exercises, etc.
650 0 _aComputer programming
_xVocational guidance.
650 0 _aEmployment interviewing.
655 7 _aProblems and exercises.
_2fast
_0(OCoLC)fst01423783
596 _a1
948 _au613335
903 _a33831
999 _c33831
_d33831