Describe how you could use a single array to implement three stacks.Hint 1. A stack is simply a data structure in which the most recently added elements are removed first. Can you simulate a single stack using an array? Remember there are many possible solutions, and there are tradeoffs of each.Hint 2. We could simulate three stacks in an array by just allocating the first third of the array to the...
Wednesday, September 14, 2016
Monday, September 12, 2016
Return Kth to Last
Implement an algorithm to find the kth to last element of a singly linked list.If we knew the length of the linked list, then we could just subtract k and we would move a pointer length-k times.Here, I think the best way would be to just iterate through the linked list with two pointers. The two nodes start on the head of the linked list. The first pointer would go ahead k steps, and then both would...
Subscribe to:
Posts (Atom)
