Step through efficient trie implementations to optimize search suggestions, word replacements, and common prefix finding.

Coding

Organizes data in a tree structure where each node represents a character, enabling efficient insertion, deletion, and search operations for words.

Trie

Efficiently prepare for coding interviews with strategies from FAANG engineers. Avoid the LeetCode grind and simplify your interview prep with real-world questions from top companies.

The ultimate guide to the System Design Interview – developed by Meta & Google engineers. Master distributed system fundamentals, and practice with real-world interview questions & mock interviews.

System Design

The essential guide to API Design & Product Design Interviews – developed by FAANG engineers. Master product design fundamentals & get hands-on with real-world APIs.

API Design

A battle-tested guide to Object Oriented Design Interviews – developed by FAANG engineers. Master OOD fundamentals & practice real-world interview questions.

Low Level Design Interview Using OOD Principles

Your essential EM Interview crash course. Learn strategies from FAANG hiring managers to demonstrate your leadership skills & experience to interviewers.

Engineering Management and Leadership Interviews

The ultimate guide to behavioral interviews. Developed by FAANG engineers. Use real-world questions, video recording, and structured strategies to get interview-ready in just a few hours.

Behavioral

Given the inputs below, what is the output?

`wordsContainer` = ["abxyz", "bxyz", "xyz"]

`wordsQuery` = ["abxyz", "bxyz", "xyz"]

Given the inputs below, what is the output?
<code>wordsContainer</code> = [“abxyz”, “bxyz”, “xyz”]
<code>wordsQuery</code> = [“abxyz”, “bxyz”, “xyz”]

Given the inputs below, what is the output? 

`wordsContainer` = ["mint", "corgi", "plane"] 

`wordsQuery` = ["alpha", "beta", "gamma"]

Given the inputs below, what is the output?
<code>wordsContainer</code> = [“mint”, “corgi”, “plane”]
<code>wordsQuery</code> = [“alpha”, “beta”, “gamma”]

Given the inputs below, what is the output?

`wordsContainer` = ["xyz", "wxyz", "vwxyz"]

`wordsQuery` = ["vwxyz", "wxyz", "xyz"]

Given the inputs below, what is the output?
<code>wordsContainer</code> = [“xyz”, “wxyz”, “vwxyz”]
<code>wordsQuery</code> = [“vwxyz”, “wxyz”, “xyz”]

Longest Common Suffix Queries

Longest Common Suffix Queries

"# Quick Fix \nYou are Edward, a Senior Software Engineer who specializes in coding interview patterns, data structures and algorithms, and is great at debugging issues in code. \n- Edward, please keep in mind that you do not have to print the data of the placeholders. Also, do not mention anything about yourself. \nEdward, you are given the following data in the placeholders: \n- Function name: `stringIndices` \n- User’s submitted solution code: USER_CODE \n- Error: ERROR_DESCRIPTION \n- Failed test case: FAILED_TEST_CASE \n- Coding language: Python \n\n- Edward, your task is to understand the type of error that is occurring in the coding language provided. \n- Once you understand the error using the error’s description, and why the test case failed. You will suggest how the learner can improve their solution code to fix the error. \n- Edward, you will not give the corrected code, just a hint on what the error tells, and how to fix it. \n- Edward, please limit your response strictly to 100 words. No more words than the limit."

"# Review Code \nEdward, your current task is to review the `stringIndices` function(s) and the other function(s) invoked in it/them.  \n-Take your time and review the user’s solution code. \n- Do not review any extra/helper files or functions not invoked in the solution function `stringIndices`. \n- Do not review the code of data structure objects instantiated like a binary tree, linked list, trie, union find, etc., in the solution functions. Just review the solution/algorithm function of the problem.  \n- Also, if the solution code doesn’t use the coding pattern stated above, then please encourage the user to reattempt the problem, to correctly use the coding pattern."

"# Review time complexity \n- Please provide a brief time complexity analysis of the function(s) `stringIndices`.  \n- While calculating time complexity, include the time complexity of built-in Python functions invoked by the code.  \n- The answer should be to the point and in a few lines."

"# Review space complexity \n- Please provide a brief space complexity analysis of the function(s) `stringIndices`.  \n- While calculating space complexity, include the space complexity of built-in Python functions invoked by the code.  \n- Do not include the space used for the input parameters and the space used for just returning an output (not used as a scratch space).  \n- The answer should be to the point and in a few lines."

def evaluate_results(self) -> object:
        """
        self.__inputs is the list of inputs that are passed as input to function
        self.__actual_output is a list of outputs that is produced by the learner's code
        return : self.__edu__result object
        """
        def stringIndices(wordsContainer, wordsQuery):
            """
            :type wordsContainer: List[str]
            :type wordsQuery: List[str]
            :rtype: List[int]
            """
            trie = {}
        
            # Build the reversed trie
            for index, word in enumerate(wordsContainer):
                currentNode = trie
        
                # Update best candidate at root
                if None not in currentNode or currentNode[None][1] > len(word):
                    currentNode[None] = (index, len(word))
        
                for char in reversed(word):
                    if char not in currentNode:
                        currentNode[char] = {}
                    currentNode = currentNode[char]
        
                    # Update best candidate at this node
                    if None not in currentNode or currentNode[None][1] > len(word):
                        currentNode[None] = (index, len(word))
        
            # Query phase
            result = []
            for queryWord in wordsQuery:
                currentNode = trie
                for char in reversed(queryWord):
                    if char not in currentNode:
                        break
                    currentNode = currentNode[char]
                result.append(currentNode[None][0])
        
            return result
        # multiple outputs will be added at each index respectively for a single test_case
        expected_outputs = []
        expected = stringIndices(self.__inputs[0], self.__inputs[1])
        # store the 1st expected output that should be displayed to the user 
        expected_outputs.append(expected)

        if json.dumps(expected) == json.dumps(self.__actual_outputs[0]):
            self.__edu_result.store_result(expected_outputs, TestCaseResult.PASS)
        else:
            self.__edu_result.store_result(expected_outputs, TestCaseResult.FAIL)

        return self.__edu_result

def stringIndices(wordsContainer, wordsQuery):
    
    # Replace this placeholder return statement with your code
    return []

suffix_testcases.yaml

testcases:
  - name: "testcase 1"
    inputs:
    - 1 : ["mango", "ango", "xango"]
    - 2 : ["go", "ango", "xyz"]
    output: 
    - 1 : [1, 1, 1]
  - name: "testcase 2"
    inputs:
    - 1 : ["starting", "sting", "ring"]
    - 2 : ["ring", "ing", "random"]
    output: 
    - 1 : [2, 2, 2]
  - name: "testcase 3"
    inputs:
    - 1 : ["alpha", "beta", "gamma"]
    - 2 : ["ta", "eta", "zeta"]
    output: 
    - 1 : [1, 1, 1]
  - name: "testcase 4"
    inputs:
    - 1 : ["respect", "aspect", "spect"]
    - 2 : ["spect", "ect", "detect"]
    output: 
    - 1 : [2, 2, 2]
  - name: "testcase 5"
    inputs:
    - 1 : ["abcdefgh", "poiuygh", "ghghgh"]
    - 2 : ["gh","acbfgh","acbfegh"]
    output: 
    - 1 : [2, 0, 2]
  

def sum(input_1, input_2):
    return input_1+input_2

def validate_inputs(self) -> None:
 """
 Validates:
 - wordsContainer and wordsQuery are lists of strings
 - Each string is lowercase letters only and length ≤ 5000
 - Length of each list ≤ 10^4
 - Total length of all strings ≤ 5 * 10^5
 """
 try:
 wordsContainer = self.__inputs[0]
 wordsQuery = self.__inputs[1]
 
 # Type checks
 if not isinstance(wordsContainer, list) or not isinstance(wordsQuery, list):
 self.store_result("Both inputs must be lists", ValidationFunction.FAIL)
 return
 
 if not all(isinstance(word, str) for word in wordsContainer + wordsQuery):
 self.store_result("All elements must be strings", ValidationFunction.FAIL)
 return
 
 # Length of lists
 if not (1 <= len(wordsContainer) <= 10**4):
 self.store_result("wordsContainer length must be between 1 and 10^4", ValidationFunction.FAIL)
 return
 
 if not (1 <= len(wordsQuery) <= 10**4):
 self.store_result("wordsQuery length must be between 1 and 10^4", ValidationFunction.FAIL)
 return
 
 # Constraints on each word and total length
 total_len_container = 0
 total_len_query = 0
 
 for word in wordsContainer:
 if not word.islower() or not word.isalpha():
 self.store_result("wordsContainer must only have lowercase English letters", ValidationFunction.FAIL)
 return
 if len(word) > 5000:
 self.store_result("Each word in wordsContainer must be ≤ 5000 characters", ValidationFunction.FAIL)
 return
 total_len_container += len(word)
 
 for word in wordsQuery:
 if not word.islower() or not word.isalpha():
 self.store_result("wordsQuery must only have lowercase English letters", ValidationFunction.FAIL)
 return
 if len(word) > 5000:
 self.store_result("Each word in wordsQuery must be ≤ 5000 characters", ValidationFunction.FAIL)
 return
 total_len_query += len(word)
 
 if total_len_container > 5 * 10**5:
 self.store_result("Total length of wordsContainer exceeds 5 * 10^5", ValidationFunction.FAIL)
 return
 
 if total_len_query > 5 * 10**5:
 self.store_result("Total length of wordsQuery exceeds 5 * 10^5", ValidationFunction.FAIL)
 return
 
 # Passed all checks
 self.store_result("", ValidationFunction.PASS)
 
 except Exception as e:
 self.store_result(f"Unexpected error: {str(e)}", ValidationFunction.FAIL)

Try to solve the Longest Common Suffix Queries problem.

Problem: Longest Common Suffix Queries

Statement

Examples

Understand the problem

Figure it out!