Google: arrangement of blocks: You are given N blocks of height 1â€¦N. In how many ways can you arrange these blocks...
There are four people who want to cross a bridge; they all begin on the same side. You have 17 minutes to get them all across to the other side. It is night, and they have one flashlight. A maximum of two people
can cross the bridge at one time. Any party that crosses, either one or
two people, must have the flashlight with them. The flashlight must be walked back and forth; it cannot be thrown, for example. Person 1 takes 1 minute to cross the bridge, person 2 takes 2 minutes, person 3 takes 5 minutes, and person 4 takes 10 minutes. A pair must walk together at the rate of the slower personâ€™s pace. For example, if person 1 and person 4 walk across first, 10 minutes have elapsed when they get to the other side of the bridge. If person 4 returns the flashlight, a total of 20 minutes have passed and you have failed the mission.
What pointer type is used to implement the heterogeneous linked list in C?
What is the minimum number of queues needed to implement the priority queue?
Which data structure is used to perform recursion?
What are some of the applications for the tree data structure?