【学科前沿】Cracking the Coding Interview, 6th Edition

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

图书名称：Cracking the Coding Interview, 6th Edition: 189 Programming Questions and Solutions
作者：Gayle Laakmann McDowell
出版社：CareerCup
页数：687
出版时间：July 2015                           
语言：English
格式：pdf
内容简介：
I am not a recruiter. I am a software engineer. And as such, I know what it's like to be asked to whip up brilliant algorithms on the spot and then write flawless code on a whiteboard. I've been through this as a candidate and as an interviewer.

  Cracking the Coding Interview, 6th Edition is here to help you through this process, teaching you what you need to know and enabling you to perform at your very best. I've coached and interviewed hundreds of software engineers. The result is this book.

  Learn how to uncover the hints and hidden details in a question, discover how to break down a problem into manageable chunks, develop techniques to unstick yourself when stuck, learn (or re-learn) core computer science concepts, and practice on 189 interview questions and solutions.

  These interview questions are real; they are not pulled out of computer science textbooks. They reflect what's truly being asked at the top companies, so that you can be as prepared as possible.  WHAT'S INSIDE?

• 189 programming interview questions, ranging from the basics to the trickiest algorithm problems.
• A walk-through of how to derive each solution, so that you can learn how to get there yourself.
• Hints on how to solve each of the 189 questions, just like what you would get in a real interview.
• Five proven strategies to tackle algorithm questions, so that you can solve questions you haven't seen.
• Extensive coverage of essential topics, such as big O time, data structures, and core algorithms.
• A behind the scenes look at how top companies like Google and Facebook hire developers.
• Techniques to prepare for and ace the soft side of the interview: behavioral questions.
• For interviewers and companies: details on what makes a good interview question and hiring process
  

回复免费：

本帖隐藏的内容

Cracking the Coding Interview, 6th Edition 189 Programming Questions and Solutions.pdf (53.81 MB)

2016-6-11 19:29:45 上传

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏39 回帖

关键词：Interview Cracking Edition Coding editio software English through 出版社 write

1.3 URLify: Write a method to replace all spaces in a string with '%20'. You may assume that the string
has sufficient space at the end to hold the additional characters, and that you are given the "true"
length of the string. (Note: if implementing in Java, please use a character array so that you can
perform this operation in place.)
EXAMPLE
Input: "Mr John Smith ", 13
Output: "Mr%20John%20Smith"

1. package Q1_03_URLify;
   
2. 
   
3. import CtCILibrary.AssortedMethods;
   
4. 
   
5. public class Question {
   
6.         // Assume string has sufficient free space at the end
   
7.         public static void replaceSpaces(char[] str, int trueLength) {
   
8.                 int spaceCount = 0, index, i = 0;
   
9.                 for (i = 0; i < trueLength; i++) {
   
10.                         if (str[i] == ' ') {
    
11.                                 spaceCount++;
    
12.                         }
    
13.                 }
    
14.                 index = trueLength + spaceCount * 2;
    
15.                 if (trueLength < str.length) str[trueLength] = '\0';
    
16.                 for (i = trueLength - 1; i >= 0; i--) {
    
17.                         if (str[i] == ' ') {
    
18.                                 str[index - 1] = '0';
    
19.                                 str[index - 2] = '2';
    
20.                                 str[index - 3] = '%';
    
21.                                 index = index - 3;
    
22.                         } else {
    
23.                                 str[index - 1] = str[i];
    
24.                                 index--;
    
25.                         }
    
26.                 }
    
27.         }
    
28.        
    
29.         public static int findLastCharacter(char[] str) {
    
30.                 for (int i = str.length - 1; i >= 0; i--) {
    
31.                         if (str[i] != ' ') {
    
32.                                 return i;
    
33.                         }
    
34.                 }
    
35.                 return -1;
    
36.         }
    
37.        
    
38.         public static void main(String[] args) {
    
39.                 String str = "Mr John Smith    ";
    
40.                 char[] arr = str.toCharArray();
    
41.                 int trueLength = findLastCharacter(arr) + 1;
    
42.                 replaceSpaces(arr, trueLength);       
    
43.                 System.out.println("\"" + AssortedMethods.charArrayToString(arr) + "\"");
    
44.         }
    
45. }

复制代码

牛尾巴 发表于 2016-6-11 19:30
图书名称：Cracking the Coding Interview, 6th Edition: 189 Programming Questions and Solutions[/backc ...

贴石好书

1.4 Palindrome Permutation: Given a string, write a function to check if it is a permutation of
a palindrome. A palindrome is a word or phrase that is the same forwards and backwards. A
permutation is a rearrangement of letters. The palindrome does not need to be limited to just
dictionary words.
EXAMPLE
Input: Tact Coa
Output: True (permutations: "taco cat'; "atc o eta·; etc.)

1. Instead of checking the number of odd counts at the end, we can check as we go along. Then, as soon as
   
2. we get to the end, we have our answer.
   
3. boolean isPermutationOfPalindrome(String phrase) {
   
4. int countOdd = 0;
   
5. int[] table new int[Character.getNumericValue('z') -
   
6. Character.getNumericValue('a') + 1];
   
7. for (char c phrase.toCharArray()) {
   
8. int x = getCharNumber(c);
   
9. if (x != -1) {
   
10. table[x]++;
    
11. if (table[x] % 2 1) {
    
12. countOdd++;
    
13. } else {
    
14. countOdd--;
    
15. }
    
16. }
    
17. }
    
18. return countOdd <= 1;
    
19. }

复制代码

1.5 One Away: There are three types of edits that can be performed on strings: insert a character,
remove a character, or replace a character. Given two strings, write a function to check if they are
one edit (or zero edits) away.
EXAMPLE
pale, ple -> true
pales, pale -> true
pale, bale -> true
pale, bae -> false

1. package Q1_05_One_Away;
   
2. 
   
3. public class QuestionA {
   
4. 
   
5.         public static boolean oneEditReplace(String s1, String s2) {
   
6.                 boolean foundDifference = false;
   
7.                 for (int i = 0; i < s1.length(); i++) {
   
8.                         if (s1.charAt(i) != s2.charAt(i)) {
   
9.                                 if (foundDifference) {
   
10.                                         return false;
    
11.                                 }
    
12.                                
    
13.                                 foundDifference = true;
    
14.                         }
    
15.                 }
    
16.                 return true;
    
17.         }
    
18.        
    
19.         /* Check if you can insert a character into s1 to make s2. */
    
20.         public static boolean oneEditInsert(String s1, String s2) {
    
21.                 int index1 = 0;
    
22.                 int index2 = 0;
    
23.                 while (index2 < s2.length() && index1 < s1.length()) {
    
24.                         if (s1.charAt(index1) != s2.charAt(index2)) {
    
25.                                 if (index1 != index2) {
    
26.                                         return false;
    
27.                                 }               
    
28.                                 index2++;
    
29.                         } else {
    
30.                                 index1++;
    
31.                                 index2++;
    
32.                         }
    
33.                 }
    
34.                 return true;
    
35.         }       
    
36.        
    
37.         public static boolean oneEditAway(String first, String second) {
    
38.                 if (first.length() == second.length()) {
    
39.                         return oneEditReplace(first, second);
    
40.                 } else if (first.length() + 1 == second.length()) {
    
41.                         return oneEditInsert(first, second);
    
42.                 } else if (first.length() - 1 == second.length()) {
    
43.                         return oneEditInsert(second, first);
    
44.                 }
    
45.                 return false;
    
46.         }
    
47.        
    
48.         public static void main(String[] args) {
    
49.                 String a = "pse";
    
50.                 String b = "pale";
    
51.                 boolean isOneEdit = oneEditAway(a, b);
    
52.                 System.out.println(a + ", " + b + ": " + isOneEdit);
    
53.         }
    
54. 
    
55. }

复制代码

1.6 String Compression: Implement a method to perform basic string compression using the counts
of repeated characters. For example, the string aabcccccaaa would become a2blc5a3. If the
"compressed" string would not become smaller than the original string, your method should return
the original string. You can assume the string has only uppercase and lowercase letters (a - z).

1. package Q1_06_String_Compression;
   
2. 
   
3. public class QuestionA {       
   
4.         public static String compressBad(String str) {
   
5.                 String compressedString = "";
   
6.                 int countConsecutive = 0;
   
7.                 for (int i = 0; i < str.length(); i++) {
   
8.                         countConsecutive++;
   
9.                        
   
10.                         /* If next character is different than current, append this char to result.*/
    
11.                         if (i + 1 >= str.length() || str.charAt(i) != str.charAt(i + 1)) {
    
12.                                 compressedString += "" + str.charAt(i) + countConsecutive;
    
13.                                 countConsecutive = 0;
    
14.                         }
    
15.                 }
    
16.                 return compressedString.length() < str.length() ? compressedString : str;
    
17.         }
    
18.        
    
19.         public static void main(String[] args) {
    
20.                 String str = "aa";
    
21.                 System.out.println(str);
    
22.                 System.out.println(compressBad(str));
    
23.         }
    
24. }

复制代码

1.7 Rotate Matrix: Given an image represented by an NxN matrix, where each pixel in the image is 4
bytes, write a method to rotate the image by 90 degrees. Can you do this in place?

1. package Q1_07_Rotate_Matrix;
   
2. 
   
3. import CtCILibrary.*;
   
4. 
   
5. public class Question {
   
6. 
   
7.         public static boolean rotate(int[][] matrix) {
   
8.                 if (matrix.length == 0 || matrix.length != matrix[0].length) return false; // Not a square
   
9.                 int n = matrix.length;
   
10.                
    
11.                 for (int layer = 0; layer < n / 2; layer++) {
    
12.                         int first = layer;
    
13.                         int last = n - 1 - layer;
    
14.                         for(int i = first; i < last; i++) {
    
15.                                 int offset = i - first;
    
16.                                 int top = matrix[first][i]; // save top
    
17. 
    
18.                                 // left -> top
    
19.                                 matrix[first][i] = matrix[last-offset][first];                        
    
20. 
    
21.                                 // bottom -> left
    
22.                                 matrix[last-offset][first] = matrix[last][last - offset];
    
23. 
    
24.                                 // right -> bottom
    
25.                                 matrix[last][last - offset] = matrix[i][last];
    
26. 
    
27.                                 // top -> right
    
28.                                 matrix[i][last] = top; // right <- saved top
    
29.                         }
    
30.                 }
    
31.                 return true;
    
32.         }
    
33.        
    
34.         public static void main(String[] args) {
    
35.                 int[][] matrix = AssortedMethods.randomMatrix(3, 3, 0, 9);
    
36.                 AssortedMethods.printMatrix(matrix);
    
37.                 rotate(matrix);
    
38.                 System.out.println();
    
39.                 AssortedMethods.printMatrix(matrix);
    
40.         }
    
41. 
    
42. }

复制代码