o Credits for the Algorith Design Manual

Third Edition Credits

Omar Amin
Omar Amin
Emily Barker
Emily Barker
Michael Alvin
Michael Alvin
Jack Zheng
Jack Zheng
Also thanks to all the people who helped develop the first and second editions of the book.

Chapter 1
1.8Parberry, section 5.2 problem 267
and section 6.2 problem 305
1.12Parberry, section 2.1 problem 1
1.13Parberry, section 2.1 problem 2
1.14Parberry, section 2.1 problem 3
1.15Parberry, section 2.1 problem 6
1.16Parberry, section 2.1 problem 9
1.17Parberry, section 2.1 problem 12
1.18Parberry, section 2.4 problem 27
1.19Parberry, section 2.11 problem 76
1.20Brassard and Bratley, problem 1.21
1.21Schaffer, chapter 2 problem 2.21
1.22Shaffer, chapter 2 problem 2.22
1.23Shaffer, chapter 2 problem 2.23
1.24Shaffer, chapter 2 problem 2.24
1.25Shaffer, chapter 2 problem 2.18
1.26http://www.rethinkstudying.com/estimation-interview-questions/
1.27https://medium.com/@wcsendom/pm-interview-cheat-sheet-f09b73b20d51
1.28Shaffer, chapter 2 problem 2.20
1.29Brassard and Bratley, problem 2.6
1.34http://www.techinterviews.com/?p=325
1.35http://www.gamedev.net/community/
forums/topic.asp?topic_id=299692
1.36http://www.acetheinterview.com/
questions/cats/index.php/
microsoft_google/page/2/
1.37http://www.acetheinterview.com/
questions/cats/index.php/
microsoft_google/page/4/
1.38http://www.acetheinterview.com/
questions/cats/index.php/
microsoft_google/page/4/
Chapter 2
2.1Parberry, section 6.1, problem 280
2.2Parberry, section 6.1 problem 281
2.3Parberry, section 6.1 problem 282
2.4Parberry, section 6.1 problem 283
2.5https://cs.nyu.edu/home/phd/algorithms_exams/
algorithms_2016fall_exam.pdf
2.6Baase, problem 1.13
2.7Parberry, section 5.1 problem 260
2.8CLR, problem 2.1-4
2.9Shaffer, chapter 3, problem 3.8
2.10Parberry, section 3.1 problem 100-107
2.11http://web.stanford.edu/class/archive/cs/cs161/
cs161.1166/homework/hw0.pdf
2.12Parberry, section 3.3 problem 139
2.13Parberry, section 3.3 problem 140
2.14https://www5.in.tum.de/
lehre/vorlesungen/fundalg/WS03/midterm.pdf
2.15Jon Kleinberg and Éva Tardos, Algorithm Design, pg 67
2.16Jon Kleinberg and Éva Tardos, Algorithm Design, pg 67
2.17Parberry, section 3.3 problem 165,
166,168
2.18Parberry, section 3.4 problem 171
2.19Parberry , section 3.4 problem 172
2.20Parberry, section 3.4 problem 177
2.21Parberry, section 3.3 problem 135
2.22CLR, problem 2.1-2
2.23Baase, problem 1.16
2.24https://courses.csail.mit.edu/
6.006/fall11/exams/quiz1-sol.pdf
2.25Omar Amin
2.26Parberry, section 3.1 problem 1
2.27Parberry, section 3.6 problem 197-200
2.28Parberry, section 3.3 problem 110
2.29Parberry, section 3.2 problem 127
2.37Manber problem 2.11
2.44Brassard and Bratley, problem 1.15
2.45Baase, problem 1.27
2.46Parberry, section 2.13 problem 92
2.47Skiena, problem 2-8
2.52http://www.techinterviews.com/?p=325
2.53http://www.ocf.berkeley.edu/~wwu/
cgi-bin/yabb/YaBB.cgi?board=riddles_cs;
action=display;num=1163814740
Chapter 3
3.1Shaffer, chapter 1 problem 1.13
3.2https://www.techiedelight.com/find-length-longest-balanced-parenthesis-string/
3.3Manber problem 4.2
3.4https://www.techiedelight.com/design-stack-which-returns-minimum-element-constant-time/
3.5Modified from Shaffer, problem 14.16
3.6Skiena
3.7Skiena
3.8unknown
3.9https://challenges.wolfram.com/challenge/telephone-word
3.10TechieDelight: https://www.techiedelight.com/determine-if-two-strings-are-anagram-or-not/
3.11Parberry, section 11.5 problem 565
3.12LeetCode, Problem: 104
3.13https://leetcode.com/problems/recover-binary-search-tree/
3.14https://www.techiedelight.com/merge-two-bsts-into-doubly-linked-list-sorted-order/
3.15https://www.techiedelight.com/construct-height-balanced-bst-from-unbalanced-bst/
3.16Shaffer, chapter 5 problem 5.4
3.17https://leetcode.com/problems/balanced-binary-tree/description/
3.20Parberry, section 11.5 problem 567
3.21Manber, problem 4.19
3.22https://leetcode.com/problems/find-median-from-data-stream/
3.23Inspired by https://challenges.wolfram.com/challenge/words-with-a-given-prefix
3.24https://www.techiedelight.com/find-duplicates-within-given-range-array/
3.25Parberry, section 11.5 problem 570
3.26Parberry, section 11.5 problem 575-576
3.27Manber, problem 5.21
3.28Manber, problem 4.27
3.29Manber problem 4.28
3.30MIT final
3.34http://www.techinterviews.com/?p=325
3.35http://www.techinterviews.com/?p=325
3.36http://www.ocf.berkeley.edu/~wwu/
cgi-bin/yabb/YaBB.cgi?board=riddles_cs;
action=display;num=1163814740
3.37http://www.ocf.berkeley.edu/~wwu/
cgi-bin/yabb/YaBB.cgi?board=riddles_cs;
action=display;num=1163814740
3.38www.sellsbrothers.com/fun/msiview/
question.htm
3.39www.sellsbrothers.com/fun/msiview/
question.htm
3.42www.sellsbrothers.com/fun/msiview/
question.htm
3.44http://gurus.wordpress.com/2007/06/28/
algorithm-challenge-1-no-division/
Chapter 4
4.7Leetcode 274
4.8Baase, problem 2.30
4.10Manber, problem 6.22
4.11Manber, problem 6.61 and
Brassard and Bratley, problem 7.35
4.12Manber, problem 6.25
4.13http://web.stanford.edu/class/archive/cs/cs161/
cs161.1166/homework/hw1.pdf
4.14https://leetcode.com/problems/merge-intervals/description/
4.15CSE 373 exam
4.16UVa 10020
4.17Parberry, section 13.1 problem 608
4.18CLR, problem 7.5-6
4.20Baase, problem 1.11 and 3.7
4.22Parberry, section 7.5 problems 344, 345.
4.23Baase, problem 2.38
4.24Baase, problem 2.33
4.25Tim Roughgarden, Algorithms Illuminated Part 1: The basics, Quiz 5.3 pg 140
4.27http://web.stanford.edu/class/archive/cs/cs161/
cs161.1166/homework/hw2.pdf, also my paper with Pinter
4.28Tim Roughgarden, Algorithms Illuminated Part 1:
The basics, problem 1.2 pg 33
4.29Tim Roughgarden, Algorithms Illuminated Part 1:
The basics, problem 1.3 pg 34
4.30Tim Roughgarden, Algorithms Illuminated Part 1:
The basics, problem 1.4 pg 34
4.32Leetcode 324
4.33Parberry, section 13.1 problem 607
4.34Manber, problem 6.32
4.42CSE 373 exam
4.45Shaffer, project 9.3
4.47http://careers.cse.sc.edu/googleinterview
4.48http://www.sellsbrothers.com/fun/msiview
/default.aspx?content=question.htm
4.49www.sellsbrothers.com/fun/msiview/
question.htm
4.51http://www.ocf.berkeley.edu/~wwu/
cgi-bin/yabb/YaBB.cgi?board=riddles_cs;
action=display;num=1163814740
Chapter 5
5.2https://www.techiedelight.com/find-missing-number-array-without-extra-space/
5.3Manber, problem 6.1 and 6.2
5.4Tim Roughgarden, Algorithms Illuminated Part 1: The basics, problem 3.2 pg 91
5.7Baase, problem 2.41
5.9Folklore
5.10CSE 373 exam
5.11Skiena original
5.12Robert Piche and https://math.stackexchange.com/questions/13551/is-it-possible-to-convert-a-polynomial-into-a-recurrence-relation-if-so-how
5.13Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, exercise 2.1 pg 83
5.14Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, exercise 2.5 pg 83
Chapter 6
6.1http://www.cs.cmu.edu/afs/cs/academic/class/15750-s11/www/pracfinal1.pdf
6.2Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, exercise 6.10 pg 193
6.3Baase, problem 2.9
6.5A Steven Skiena original
6.7https://leetcode.com/problems/lru-cache/description/
6.8https://challenges.wolfram.com/challenge/rotodromes
6.9LeetCode: Problem 528
6.10LeetCode: Problem 470
6.11Tim Roughgarden, Algorithms Illuminated Part 1:
The basics, problem 5.2 pg 151
6.12Robert Piche'
Chapter 7
7.1Steven Skiena -- August 28, 1999
7.2Steven Skiena -- August 28, 1999
7.3Ian Parberry, section 2.11 problem 80
7.4Baase, problem 4.23
7.5Baase, problem 9.16
7.6Algorithms, S. Dasgupta, C.H. Papadimitriou,
and U.V. Vazirani, exercise 5.3 pg 161
7.13https://www.geeksforgeeks.org/snake-ladder-problem-2/
7.14Yimin Zhu
7.15https://ocw.mit.edu/courses/
electrical-engineering-and-computer-science/
6-006-introduction-to-algorithms-fall-2011/
exams/MIT6_006F11_final.pdf
7.16CLR, problem 23.1-5
7.17Manber, problem 7.108 and 7.109. and CLR, problem 37.1-3
7.19Manber, problem problem 7.113
7.21Baase, problem 8.24
7.22FROM GASARCH
7.23FROM GASARCH
7.25Manber, problem 7.42
7.26Manber, problem 7.82
7.27Algorithms, S. Dasgupta, C.H. Papadimitriou,
and U.V. Vazirani, exercise 3.5 pg 107
7.28Parberry, section 13.6 problem 667-668
7.30Yimin Zhu
7.31CSE 373 exam
7.32Corman new edition
7.33Algorithms, S. Dasgupta, C.H. Papadimitriou,
and U.V. Vazirani, exercise 3.11 pg 108
7.35Baase, problem 4.57
7.36https://cs.nyu.edu/home/phd/algorithms_exams/
algorithms_2006fall_exam.pdf
7.37Parberry, section 2.10 problem 68 and
Brassard and Bratley, problem 9.39
7.41http://web.stanford.edu/class/archive/cs/cs161/
cs161.1166/homework/hw4.pdf
7.42google-questions.txt
7.43google-questions.txt
Chapter 8
8.1Parberry, section 9.3 problem 438-440
8.4Shaffer, chapter 7 problem 7.20
8.5Shaffer, chapter 7 problem 7.22
8.6CSE 373 exam
8.11Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, exercise 5.22 pg 162
8.12Manber, problem 7.71 and 7.72.
8.14Parberry, section 11.4 problem 562
8.15Shaffer, chapter 7 problem 7.13
8.16Manber, problem 7.7
8.17Manber, problem 7.12
8.18Parberry, section 9.3 problem 448
8.19Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, exercise 4.14 pg 133
8.21Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, exercise 4.11 pg 133
8.22MIT algorithms problem set via Cristina Mata
8.23Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, exercise 4.10 pg 133
8.24Parberry, section 9.2 problem 436
8.25Manber, problem 7.50
8.26Manber, problem 7.48
8.27Parberry, section 8,5 problem 416
8.28Manber, problem 7.95
8.29Manber, problem 7.107
Chapter 9
9.3https://www.techiedelight.com/find-combinations-of-elements-satisfies-given-constraints/
9.5Unknown
9.6https://leetcode.com/problems/unique-binary-search-trees-ii/
9.7McDowell, 8.9
9.8https://www.techiedelight.com/find-all-possible-topological-orderings-of-dag/
9.9UVa 574 - Sum It Up
9.11CSE 373 exam
9.12Inspired by https://challenges.wolfram.com/challenge/forbidden-substrings
9.13https://www.techiedelight.com/k-partition-problem-print-all-subsets/
9.14UVa 190
9.17https://www.techiedelight.com/print-possible-knights-tours-chessboard/
9.18https://www.techiedelight.com/generate-list-of-possible-words-from-a-character-matrix/ and https://www.cs.oberlin.edu/~rhoyle/17f-cs151/lab09/index.html
9.19From Wolfram{https://challenges.wolfram.com/challenge/babbage-squares
9.28http://careers.cse.sc.edu/googleinterview
9.29google-questions.txt
9.30google-questions.txt
9.31google-questions.txt
9.32http://www.techinterviews.com/?p=325
9.33google-questions.txt
Chapter 10
10.1McDowell, problem 8.1
10.2Yao Li and https://leetcode.com/problems/house-robber/
10.3Inspired by https://challenges.wolfram.com/
challenge/getting-a-basketball-score
10.4Inspired by https://challenges.wolfram.com/
challenge/getting-a-basketball-score
10.5CSE 373 exam
10.7Baase, problem 6.17
10.8Baase, problem 6.16
10.9Manber, problem 6.51
10.10Arch Robison
10.11Brassard and Bratley, problem 6.21
10.14Parberry, section 9.5 problem 473
10.15https://www.geeksforgeeks.org/cutting-a-rod-dp-13/
and Danny Guo
10.16https://ocw.mit.edu/courses/
electrical-engineering-and-computer-science/
6-006-introduction-to-algorithms-fall-2011/
exams/MIT6_006F11_final.pdf
10.17LeetCode, problem 279
10.18Folklore, and https://challenges.wolfram.com/
challenge/maximal-contiguous-sum
10.19UVa 10664
10.21Baase, problem 6.18
10.22Bill Gasarch
10.23Parberry, section 8.5 problem 410
10.25Bill Gasarch
10.26Bill Gasarch
10.29McDowell, problem 8.13
10.32McDowell, problem 8.13
10.33Unknown
10.34https://cs.nyu.edu/home/phd/algorithms_exams/
algorithms_2014fall_exam.pdf
10.35MIT Problem Set 5 Spring 2017 from
C. Daskalakis, P. Indyk, and S. Smith via Cristina Mata
10.38Bill Gasarch
10.39http://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi?board=riddles_cs;action=display;num=1163814740
10.40google-questions.txt
10.41google-questions.txt
Chapter 11
11.1Manber, problem 11.4
11.2Manber, problem 11.5
11.3Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, exercise 8.8 pg 279
11.4CSE 373 exam
11.13Steven Skiena
11.14CSE 373 exam
11.15Yimin Zhu and Steven Skiena
11.19Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, exercise 8.15 pg 280
11.20Yao Li from Rob Patro's CSE 373 HW
11.21Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, exercise 8.19 pg 280
11.22Garey and Johnson, pg. 64
11.23Garey and Johnson, pg. 64
11.24Garey and Johnson, pg. 75
11.25Garey and Johnson, pg. 75
11.26Garey and Johnson, pg. 75
11.28Garey and Johnson, pg. 75
11.29Garey and Johnson, pg. 75
11.30Unknown
11.32Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, exercise 8.4 pg 278
Chapter 12
12.1https://web.cs.dal.ca/~nzeh/Teaching/3110/Assignments/sample-final.pdf
12.2http://www.cs.cmu.edu/afs/cs/academic/class/15750-s11/www/practice1soln.pdf
12.3CSE 373 exam
12.6Vazirani, problem 2.1
12.8Vazirani 9.1
12.9Algorithms, S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, exercise 9.4 pg 306
12.10Vazirani, problem 2.6