Cracking the Coding Interview - Fooo

Recommendations

Info

Solutions to Chapter 11 | System Design and Memory Limits 9 while (in.hasNextInt()) { 10 int n = in.nextInt(); 11 blocks[n / (bitfield.length * 8)]++; 12 } 13 14 for (int i = 0; i < blocks.length; i++) { 15 if (blocks[i] < bitfield.length * 8){ 16 /* if value < 2^20, then at least 1 number is missing in 17 * that section. */ 18 starting = i * bitfield.length * 8; 19 break; 20 } 21 } 22 23 in = new Scanner(new FileReader(“input_file_q11_4.txt”)); 24 while (in.hasNextInt()) { 25 int n = in.nextInt(); 26 /* If the number is inside the block that’s missing numbers, 27 * we record it */ 28 if( n >= starting && n < starting + bitfield.length * 8){ 29 bitfield [(n-starting) / 8] |= 1
Solutions to Chapter 11 | System Design and Memory Limits 11 4 You have an array with all the numbers from 1 to N, where N is at most 32,000 The array may have duplicate entries and you do not know what N is With only 4KB of memory available, how would you print all duplicate elements in the array? SOLUTION 2 0 5 Cracking the Coding Interview | Concepts and Algorithms pg 72 We have 4KB of memory which means we can address up to 8 * 4 * (2^10) bits Note that 32* (2^10) bits is greater than 32000 We can create a bit vector with 32000 bits, where each bit represents one integer NOTE: While this isn’t an especially difficult problem, it’s important to implement this cleanly We will define our own bit vector class to hold a large bit vector 1 public static void checkDuplicates(int[] array) { 2 BitSet bs = new BitSet(32000); 3 for (int i = 0; i < array.length; i++) { 4 int num = array[i]; 5 int num0 = num - 1; // bitset starts at 0, numbers start at 1 6 if (bs.get(num0)) { 7 System.out.println(num); 8 } else { 9 bs.set(num0); 10 } 11 } 12 } 13 14 class BitSet { 15 int[] bitset; 16 17 public BitSet(int size) { 18 bitset = new int[size >> 5]; // divide by 32 19 } 20 21 boolean get(int pos) { 22 int wordNumber = (pos >> 5); // divide by 32 23 int bitNumber = (pos & 0x1F); // mod 32 24 return (bitset[wordNumber] & (1 > 5); // divide by 32 29 int bitNumber = (pos & 0x1F); // mod 32 30 bitset[wordNumber] |= 1
Page 1 and 2:
CRACKING THE C O D I N G I N T E R
Page 4 and 5:
CRACKING THE C O D I N G I N T E R
Page 7 and 8:
Table of Contents Foreword 4 Introd
Page 10 and 11:
Dear Readers, CareerCup com Forewor
Page 12 and 13:
My Approach Introduction The focus
Page 14 and 15:
Behind the Scenes | The Microsoft I
Page 16 and 17:
Behind the Scenes | The Google Inte
Page 18 and 19:
Behind the Scenes | The Yahoo Inter
Page 20 and 21:
Interview War Stories the next few
Page 22 and 23:
Interview War Stories | Failure to
Page 24 and 25:
Interview War Stories | You Can (Ma
Page 26 and 27:
Before the Interview
Page 28 and 29:
Before the Interview | Resume Advic
Page 30 and 31:
Before the Interview | Behavioral P
Page 32:
What You Need To Know Before the In
Page 35 and 36:
At the Interview | Handling Behavio
Page 37 and 38:
At the Interview | Handling Technic
Page 39 and 40:
At the Interview | Handling Technic
Page 41 and 42:
At the Interview | Five Algorithm A
Page 43 and 44:
At the Interview | The Offer and Be
Page 45 and 46:
At the Interview | Top Ten Mistakes
Page 47 and 48:
At the Interview | Frequently Asked
Page 49 and 50:
Interview Questions How This Book i
Page 52 and 53:
Part 1 Data Structures
Page 54 and 55:
Chapter 1 | Arrays and Strings 1 1
Page 56 and 57:
2 1 Write code to remove duplicates
Page 58 and 59:
Chapter 3 | Stacks and Queues 3 1 D
Page 60:
Chapter 4 | Trees and Graphs 4 1 Im
Page 63 and 64:
Chapter 5 | Bit Manipulation How to
Page 65 and 66:
Chapter 6 | Brain Teasers Do compan
Page 67 and 68:
Chapter 7 | Object Oriented Design
Page 69 and 70:
Chapter 8 | Recursion How to Recogn
Page 71 and 72:
Chapter 9 | Sorting and Searching H
Page 73 and 74:
Chapter 10 | Mathematical How to Ap
Page 75 and 76:
Chapter 11 | Testing Testing Proble
Page 77 and 78:
Chapter 12 | System Design and Memo
Page 80 and 81:
Part 3 Knowledge Based
Page 82 and 83:
Chapter 13 | C++ 13 1 Write a metho
Page 84 and 85:
Chapter 14 | Java 14 1 In terms of
Page 86 and 87:
Chapter 15 | Databases 15 1 Write a
Page 88 and 89:
Chapter 16 | Low Level 16 1 Explain
Page 90 and 91:
Chapter 17 | Networking 17 1 Explai
Page 92:
Chapter 18 | Threads and Locks 18 1
Page 95 and 96:
Chapter 19 | Moderate 19 1 Write a
Page 97 and 98:
Chapter 20 | Hard 20 1 Write a func
Page 99 and 100:
Each problem may have many 'optimal
Page 101 and 102:
Solutions to Chapter 1 | Arrays and
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
Page 109:
Page 112 and 113:
Solutions to Chapter 2 | Linked Lis
Page 114 and 115:
Page 116 and 117:
Page 118 and 119:
Approach 2: Solutions to Chapter 3
Page 120 and 121:
Solutions to Chapter 3 | Stacks and
Page 122 and 123:
Page 124 and 125:
Page 126 and 127:
Page 129 and 130:
Solutions to Chapter 4 | Trees and
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Solutions to Chapter 5 | Bit Manipu
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Solutions to Chapter 6 | Brain Teas
Page 151 and 152:
Page 153 and 154:
Page 155:
Page 158 and 159:
Solutions to Chapter 7 | Object Ori
Page 160 and 161: Solutions to Chapter 7 | Object Ori
Page 166 and 167: 41 } 42 } Overview: Solutions to Ch
Page 176 and 177: Solutions to Chapter 8 | Recursion
Page 185 and 186: Solutions to Chapter 9 | Sorting an
Page 193 and 194: Solutions to Chapter 10 | Mathemati
Page 203 and 204: Solutions to Chapter 11 | System De
Page 209: Solutions to Chapter 11 | System De
Page 215 and 216: Solutions to Chapter 12 | Testing 1
Page 221 and 222: Solutions to Chapter 13 | C++ 13 1
Page 231 and 232: Solutions to Chapter 14 | Java 14 1
Page 237 and 238: Solutions to Chapter 15 | Databases
Page 243 and 244: Solutions to Chapter 16 | Low Level
Page 255 and 256: Solutions to Chapter 17 | Networkin
Page 261 and 262:
Solutions to Chapter 17 | Networkin
Page 263 and 264:
Solutions to Chapter 18 | Threads a
Page 265 and 266:
Page 267 and 268:
Page 269 and 270:
Page 271 and 272:
Solutions to Chapter 19 | Moderate
Page 273 and 274:
Page 275 and 276:
Page 277 and 278:
Page 279 and 280:
Page 281 and 282:
Page 283 and 284:
Page 285 and 286:
Solutions to Chapter 20 | Hard 20 1
Page 287 and 288:
Page 289 and 290:
Page 291 and 292:
Page 293 and 294:
Page 295 and 296:
Solutions to Chapter 20 | Hard 20 p
Page 297 and 298:
Page 299 and 300:
Page 301 and 302:
Page 303 and 304:
Solutions to Chapter 20 | Hard 32 m
Page 305:
Solutions to Chapter 20 | Hard 17 }
Page 308 and 309:
M matrixes 101, 102, 163, 169, 184,
Page 310:
About the Author Gayle Laakmann’s
show all

Cracking the Coding Interview - Fooo

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?