Programming/Algorithms interview questions: page 2 of 2

Questions 51–67

51. Exchanging two integers with no scratch variableEasy
52. Removing repeats from a sorted arrayEasy
53. Evaluating a polynomial with nested multiplicationEasy
54. Rolling window average on streaming dataEasy
55. Comparing insertion, merge and quick sortEasy
56. Shuffling cards so all orders are equally likelyEasy
57. Uniform random character from a stream in one passMedium
58. Joint min and max with about 3n/2 comparisonsMedium
59. First nonzero entry in an array of unknown sizeMedium
60. Locating a value in a row- and column-sorted gridMedium
61. Runtime blow-up of recursive FibonacciMedium
62. Largest-sum run of consecutive elementsMedium
63. Bit trick to detect powers of twoEasy
64. Times seven using shifts and subtractionEasy
65. Turning uniform draws into normal drawsEasy
66. Monte Carlo estimate of pi and its errorEasy
67. Quasi-random sequences for numerical integrationMedium