Three rounds were conducted in total for this role. The interview was off-campus.

The interview process was very tough. The questions asked were easy in the first round, then the difficulty increased with the second round. The third round was completely core-based and managerial.

• 2 technical rounds
• 1 technical+managerial round

No system design round was conducted.

You are given an array of words, where each word consists of lowercase English letters. Word A is a predecessor of word B if and only if we can insert exactly one letter anywhere in word A, without changing the order of the other characters, to make it equal to word B. For example, "abc" is a predecessor of "abac", while "cba" is not a predecessor of "bcad".

A word chain is a sequence of words [word1, word2, ..., wordk] with k ≥ 1, where word1 is a predecessor of word2, word2 is a predecessor of word3, and so on. A single word is trivially a word chain with k = 1.

Return the length of the longest possible word chain with words chosen from the given list of words.

Example 1: Input: words = ["a","b","ba","bca","bda","bdca"] Output: 4