10 docs tagged with "Trie"

This is a solution to the Concatenated Words problem on LeetCode.

This document provides a solution to the Implementation of Trie.

Return the kth lexicographically smallest integer.

This is a solution to the maximum xor of two numbers in an array problem on LeetCode.

Solve the problem of finding the maximum bitwise XOR of an element with given elements that do not exceed a specified value using trie and bit manipulation.

Solve the problem of counting the number of words that are subsequences of a given string using various efficient methods.

This is a solution to the Palindrome Pairs problem on LeetCode.

This is a solution to the Replace Words problem on LeetCode.

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.

This document provides a solution to the Word Search II problem, where we need to return all words on the board, given an mXn board of characters and a list of strings words.