Trie

You are given a 0-indexed string array words.

Write a function to find the longest common prefix string amongst an array of strings.

You are given a 0-indexed integer array nums.

Given an array of strings queries and a string pattern, return a boolean array answer where answer[i] is true if queries[i] matches pattern, and false otherwise.

You are given a 0-indexed string s and a dictionary of words dictionary.

You are given two arrays with positive integers arr1 and arr2.

Given an integer array nums and two integers k and p, return the number of distinct subarrays, which have at most k elements that are divisible by p.

Given an integer n, return all the numbers in the range [1, n] sorted in lexicographical order.

Given an array of strings words representing an English Dictionary, return the longest word in words that can be built one character at a time by other words in words.

Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n.

You are given an array of strings words and a string target.

Given a string s and an array of strings words, return the number of words[i] that is a subsequence of s.

Given a string s, partition it into unique segments according to the following procedure: Return an array of strings segments, where segments[i] is the ith segment created.

Given a list of folders folder, return the folders after removing all sub-folders in those folders.

In English, we have a concept called root, which can be followed by some other word to form another longer word - let's call this word derivative.

You are given an array of strings products and a string searchWord.

A valid encoding of an array of words is any reference string s and array of indices indices such that: Given an array of words, return the length of the shortest reference string...

You are given an array arr of size n consisting of non-empty strings.

Given an array of strings words and an integer k, return the k most frequent strings.

Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.

You are given two string arrays, queries and dictionary.

Given an array of strings words (without duplicates), return all the concatenated words in the given list of words.

Given a (0-indexed) integer array nums and two integers low and high, return the number of nice pairs.

You are given a 0-indexed string array words.

Due to a bug, there are many duplicate folders in a file system.

Return the number of distinct non-empty substrings of text that can be written as the concatenation of some string with itself (i.e.

Given two integers n and k, return the kth lexicographically smallest integer in the range [1, n].

You are given an array of strings words and an integer k.

You are given two arrays of strings wordsContainer and wordsQuery.

There is a rooted tree consisting of n nodes numbered 0 to n - 1.