Longest Prefix Sequence - Google Top Interview Questions


Problem Statement :


You are given a list of lowercase alphabet strings words. 

Return the length of the longest sequence of words where each previous word is the prefix of the next word and the next word has just one new character appended. 

You can rearrange words in any order.

Constraints

0 ≤ n ≤ 100,000 where n is the length of words

1 ≤ m ≤ 100,000 where m is the length of the longest string in words

Example 1

Input

words = ["abc", "ab", "x", "xy", "abcd"]

Output

3

Explanation

We can form the following sequence: ["ab", "abc", "abcd"].


Solution :



title-img 




                        Solution in C++ :

int solve(vector<string>& words) {
    sort(words.begin(), words.end());
    map<string, int> mp;
    int ret = 1;
    for (auto& word : words) {
        string tmp = word;
        tmp.pop_back();
        if (mp.count(tmp))
            mp[word] = mp[tmp] + 1;
        else
            mp[word] = 1;
        ret = max(ret, mp[word]);
    }
    return ret;
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    public int solve(String[] words) {
        Arrays.sort(words);
        Map<Integer, Integer> map = new HashMap<>();

        int res = 0;
        for (String w : words) {
            int prefixes = 0;

            if (w.length() > 1) {
                int prevHash = (w.length() - 1) * 100000 + w.charAt(w.length() - 2);
                if (map.containsKey(prevHash))
                    prefixes += map.get(prevHash);
            }

            int hash = w.length() * 100000 + w.charAt(w.length() - 1);
            map.put(hash, prefixes + 1);
            res = Math.max(res, map.get(hash));
        }

        return res;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, words):
        graph = {word: [] for word in words}

        for word in words:
            prev_word = word[: len(word) - 1]
            if prev_word in graph:
                graph[prev_word].append(word)

        @cache
        def dp(word):
            return 1 + max((dp(successor) for successor in graph[word]), default=0)

        return max((dp(word) for word in words), default=0)


View More Similar Problems

Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

View Solution →

Reverse a linked list

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio

View Solution →

Compare two linked lists

You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis

View Solution →

Merge two sorted linked lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C

View Solution →

Get Node Value

This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t

View Solution →

Delete duplicate-value nodes from a sorted linked list

This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -

View Solution →