Core programming Questions-3

continuing from part1, part2


1) Multiple by 8 without using multiplication or addition. Now do the same with 7.
2) Write routines to read and write a bounded buffer.
3) Write routines to manage a heap using an existing array.
4) Implement an algorithm to take an array and return one with only unique elements in it.
5) Implement an algorithm that takes two strings as input, and returns the intersection of the two, with each letter represented at most once. Now speed it up. 6) Implement an algorithm to print out all files below a given root node.
7) How would you find a cycle in a linked list?
8) Give me an algorithm to shuffle a deck of cards, given that the cards are stored in an array of ints.

next >>