Asked Questions:

Maximum running sum, for example for an array N1...Nk, find out the range that results in the maximum sum.

1. Dining philosophers problem (see wiki) In computer science, the dining philosophers problem is an illustrative example of a common computing problem in concurrency. It is a classic multi-process synchronization problem.

In 1965, Edsger Dijkstra set an examination question on a synchronization problem where five computers competed for access to five shared tape drive peripherals. Soon afterwards, the problem was retold by Tony Hoare as the dining philosophers problem.

This is a theoretical explanation of deadlock and resource starvation by assuming that each philosopher takes a different fork as a first priority and then looks for another.

1. Maximum Common Subsequence I answered using dynamic programming.

2. And some brain teasers.

Maximum Common Subsequence