Algorithms for interviews : a problem-solving approach

Algorithms For Interviews (AFI) aims to help engineers interviewing for software development positions as well as their interviewers. AFI consists of 174 solved algorithm design problems. It covers core material, such as searching and sorting; general design principles, such as graph modeling and dynamic programming; advanced topics, such as strings, parallelism and intractability. It also covers system design, problem solving, and interviewing techniques. AFI's authors are practicing algorithmists, with extensive academic and industrial experience. They have collectively published over 100 articles on applied algorithms, applied their skills at Google, Microsoft, IBM, Qualcomm, and a number of smaller software startups, and conducted many job interviews for various computer science jobs. Cover Prologue Problem Solving Techniques I Problems 1 Searching 2 Sorting 3 Meta-algorithms 4 Algorithms on Graphs 5 Algorithms on Strings 6 Intractability 7 Parallel Computing 8 Design Problems 9 Discrete Mathematics 10 Probability 11 Programming II Interview 12 Strategies For A Great Interview 13 Conducting An Interview III Solutions 1 Searching 2 Sorting 3 Meta-algorithms 4 Aigorithms on Graphs 5 Aigorithms on Strings 6 Intractability 7 Paral!el Computing 8 Design Problems 9 Discrete Mathematics 10 Probability 11 Programming Index of Prob!ems