3.5. Code Implementation of Dynamic Programming Algorithm

Try these first

1. 1.

   What is a subword?

   Hint

   Think of words divided into smaller parts.

2. 2.

   Explain the brute-force method in finding common subwords in a sentence.

   Hint

   How would you compare different starting points?

3. 3.

   What is the main focus of the longest common subword problem?

   • Finding the longest segment
   • Sorting characters
   • Counting total letters

   Hint

   Consider the term 'longest common' in the problem.

4. 4.

   True or False: The brute-force algorithm is efficient for long sequences.

   • True
   • False

   Hint

   Think about the number of checks needed for long words.

5. 5.

   Given two strings, 'abcdef' and 'acefg', write a dynamic programming algorithm to find and print the length of the longest common subword. Also describe how you handle overlaps.

   Hint

   Focus first on building the table according to matching conditions.

6. 6.

   How can you optimize the space complexity of the dynamic programming solution for the longest common subword problem when dealing with very long strings?

   Hint

   Consider how many rows you truly need to compute the final answer.