Finding the valid letter sequence [reviewed]

Problem 

There's a new language which uses the latin alphabet. However, you don't know the order among letters.

  You receive a list of words lexicographically sorted by the rules of this new language. From this list, derive one valid particular ordering of letters in the language.

 For example, given list of words, {"abcdefo", "begz", "hijk", "abcedefgh", "ikom"}

One valid sequence would be {abcdefom}.
Before, reasoning about the algorithm. Let think about what we would do to understand the sequence  among letters, given list of words. Drawing the following diagram on the paper would give us more clear picture.


Basically, we first need to build the directed graph and choose the one node and following each node's edge and print out its value until we encounter the node without any outgoing edges.


Here is the complete code running in $O( N log N)$, where N is the total number of letters in the array.




However, if the question is to print out the valid sequence starting from the first letter. We need to know the topological sequence as well, which leads to the following code.



Practice statistic

30:26 : to write up the code.
7:57: to verify the correctness
11:16: fix up the code again

Overcomplicated the solution adding unnecessary topological DFS, and sorting.


UPDATE(2019-07-26): solve this problem again, using graph and DFS w/o backtracking.

Here is the python version of solution.

Statistics:

9:00: to come up with algorithm
15:00: to write the code. (incomplete test code)
1:00: to finish the test code

Comments

Post a Comment

Popular posts from this blog

Planting flowers with no adjacent flower plots

Image
Problem Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die. Given a flowerbed (represented as an array containing booleans), return if a given number of new flowers can be planted in it without violating the no-adjacent-flowers rule  Sample inputs  Input: 1,0,0,0,0,0,1,0,0  3 => true  4 => false  Input: 1,0,0,1,0,0,1,0,0  1 => true  2 => false  input: 0  1 => true  2 => false  public boolean canPlaceFlowers(List flowerbed, int numberToPlace) {  // Implementation here  }
Read more
  Given an array of  intervals  where  intervals[i] = [start i , end i ] , merge all overlapping intervals, and return  an array of the non-overlapping intervals that cover all the intervals in the input . Example 1: Input: intervals = [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlap, merge them into [1,6]. Example 2: Input: intervals = [[1,4],[4,5]] Output: [[1,5]] Explanation: Intervals [1,4] and [4,5] are considered overlapping.   Constraints: 1 <= intervals.length <= 10 4 intervals[i].length == 2 0 <= start i <= end i <= 10 4
Read more

Find the maximum number of bomb that can be detonated

  Problem You are given a list of bombs. The range of a bomb is defined as the area where its effect can be felt. This area is in the shape of a circle with the center as the location of the bomb. The bombs are represented by a 0-indexed 2D integer array bombs where bombs[i] = [xi, yi, ri]. xi and yi denote the X-coordinate and Y-coordinate of the location of the ith bomb, whereas ri denotes the radius of its range. You may choose to detonate a single bomb. When a bomb is detonated, it will detonate all bombs that lie in its range.  These bombs will further detonate the bombs that lie in their ranges. Given the list of bombs, return the maximum number of bombs that can be detonated if you are allowed to detonate only one bomb. Input: bombs = [[2,1,3],[6,1,4]] Output: 2 Explanation: The above figure shows the positions and ranges of the 2 bombs. If we detonate the left bomb, the right bomb will not be affected. But if we detonate the right bomb, both bombs will be detonated. So...
Read more