原创 Chapter 2 Linked Lists - 2.2

Problem 2.2: Implement an algorithm to find the nth to last element of a singly linked list. The solution on answer pag

原创 Chapter 2 Linked Lists - 2.3

Problem 2.3: Implement an algorithm to delete a node in the middle of a single linked list, given only access to that n

原创 Chapter 3 Stacks and Queues - 3.3

Problem 3.3: Imagine a (literal) stack of plates. If the stack gets too high, it might topple. Therefore, in real life,

原创 Chapter 2 Linked Lists - 2.1

2.1 Write code to remove duplicates from an unsorted linked list. FOLLOW UP How would you solve this problem if a tempo

原创 Chapter 1 Arrays and Strings - 1.8

Problem 1.8: Assume you have a method isSubString which checks if one word is a substring of another. Given two strings