1. Interview Process

   • Types of Interviews

     • Phone Interviews

     • On-Site Interviews

   • Phases of Interviews

     • Behavior Interview

     • Technical Interview

     • Q/A Time

   • Summary  

2. Programming Languages

   • C 

     • Palindrome Numbers

   • C++

     • C++ Concepts 

     • Analyzing Execution of C++ Code

     • Implementing a Class or Member Function in C++

     • Assignment Operator 

   • C#

     • Singleton

   • Java

     • Java Keywords

     • Data Containers

     • Thread Scheduler

   • Summary

3. Data Structures

   • Arrays 

     • Duplication in an Array 

     • Search in a 2-D Matrix

   • String 

     • Strings in C/C++

     • Strings in C# 

     • Strings in Java

     • Replace Blanks in a String 

     • String Matching

   • Linked Lists

     • Print Lists from Tail to Head 

     • Sort Lists 

     • Loop in List 

   • Trees 

     • Next Nodes in Binary Trees 

     • Binary Search Tree Verification 

   • Stack and Queue 

     • Build a Queue with Two Stacks 

     • Build a Stack with Two Queues 

   • Summary

4. Algorithms

   • Recursion and Iteration

     • Fibonacci Sequence

   • Search and Sort 

     • Binary Search in Partially Sorted Arrays

     • Majorities in Arrays 

   • Backtracking 

     • String Path in Matrix 

     • Robot Move 

   • Dynamic Programming and Greedy Algorithms

     • Edit Distance

     • Minimal Number of Coins for Change

     • Minimal Times of Presses on Keyboards

   • Bit Operations 

     • Number of 1s in Binary

     • Numbers Occurring Only Once 

   • Summary

5. High Quality Code

   • Clearness

   • Completeness 

     • Test Cases for Completeness

     • Strategies to Handle Errors 

     • Power of Integers

     • Big Numbers as Strings

     • Delete Nodes from a List 

     • Partition Numbers in Arrays 

   • Robustness

     • kth Node from End 

     • Reverse a List

     • Substructures in Trees

   • Summary

6. Approaches to Solutions

   • Figures to Visualize Problems

     • Mirror of Binary Trees

     • Print Matrix in Spiral Order 

     • Clone Complex Lists 

   • Examples to Simplify Problems 

     • Stack with Min Function

     • Push and Pop Sequence of Stacks

     • Print Binary Trees Level by Level

     • Paths in Binary Trees 

   • Divide and Conquer 

     • Traversal Sequences and Binary Trees

     • Binary Search Trees and Double-Linked Lists 

     • Permutation and Combination

   • Summary

7. Optimization

   • Time Efficiency

     • Median in a Stream

     • Minimum  k  Numbers

     • Intersection of Sorted Arrays 

     • Greatest Sum of Sub-Arrays

     • Digit 1 Appears in Sequence from 1 to  n

     • Concatenate an Array to Get a Minimum Number 

   • Space-Time Trade-Off

     • Ugly Numbers

     • Hash Tables for Characters

     • Reversed Pairs in Array 

     • First Intersection Node in Two Lists

   • Summary 

8. Skills for Interviews

   • Communication and Learning Skills

     • Communications Skills

     • Learning Skills

   • Knowledge Migration Skill

     • Time of Occurrences in a Sorted Array 

     • Application of Binary Tree Traversals

     • Sum in Sequences

     • Reversing Words and Rotating Strings

     • Maximum in a Queue

   • Mathematical Modeling Skill

     • Probabilities of Dice Points 

     • Last Number in a Circle

     • Minimum Number of Moves to Sort Cards

     • Most Profit from Stock

   • Divergent Thinking Skills

     • Calculating 1+2+…+n 

     • Implementation of +, -, *, and /

     • Final/Sealed Classes in C++ 

     • Array Construction

   • Summary 

9. Interview Cases

   • Integer Value from a String 

     • The Interviewer’s Comments 

   • Lowest Common Parent Node in a Tree 

     • The Interviewer's Comments

Index