Coding Interviews: Questions, Analysis & Solutions

Index

A

Anagrams, 212

Arrays.sort in O(nlogn) time, 202

B

Backtracking

definition, 90

robot move

C++ code, 93–4

source code, 94

test cases, 94

string path in matrix

C++ code, 91–2

source code, 92

test cases, 92

Bidirectional communication, 220

Big numbers as strings

function to add two arbitrary positive integers, 120–1, 123

simulating increment on a string, 118–9

simulating permutation, 120

source code, 120

test cases, 120

underestimating complexity, 117

Binary search algorithm

on a diagonal, 38–40

Java code, 37

partially sorted matrix, 40–