Algorithms and Interviews: Job Interviewing for Programmers

Description

Learn how to prepare for technical programming interviews. This book focuses on job interviews for software engineers, both from the traditional interview perspective as well as the technical programming side. While useful review for Computer Science graduates, it is also helpful for self-taught programmers, bootcamp graduates, and anyone interested in job hunting and interview techniques as well as computer algorithm implementation. Interview related topics include: Interview preparation Interview process Common interview questions (both traditional and technical) Resume preparation Programming topics include: Data structures Problem solving paradigms Problem modeling Big-O calculations Complexity analysis Object Oriented Programming review Algorithm topics include: Iteration Recursion Divide and conquer Algorithm Analysis Linear data structures Linked lists Stacks vs. queues Hash tables Graphs and trees Heaps Priority queues Linear searching Advanced graph algorithms Dynamic programming Greedy algorithms Sorting and selection algorithms Two's complement Bit manipulation Math topics include: Number theory Probability Linear algebra Geometry Preface Prepping for Interviews Programming Interviews Interview Preparation After the Interview Programming Review Data Structures and Algorithms Python Object-Oriented Programming Algorithms Iteration and Recursion Divide and Conquer Algorithm Analysis Linear Data Structure Graphs and Trees Heap and Priority Queue Linear Search Advanced Graph Algorithms Dynamic Programming Greedy Algorithms Sorting and Selection Algorithms Bit Manipulation Mathematics Math and Probability Problems Appendix Common Interview Questions Bibliography About the Author