Pattern

Trie

A compact view of archive entries grouped by recurring technique.

Back to library Library RSS

19 entries

19 entries tagged as Trie.

28.05.2026

hard

3093. Longest Common Suffix Queries

Kotlin Rust

Query common suffixes match

Trie

trie arena allocation strings

Full post LeetCode Kotlin Rust YouTube Telegram

21.05.2026

medium

3043. Find the Length of the Longest Common Prefix

Kotlin Rust

Longest prefix of pairs

Trie Array

hash set trie prefix scanning string prefix extraction strings arrays

Full post LeetCode Kotlin Rust YouTube Telegram

30.01.2026

hard

2977. Minimum Cost to Convert String II

Kotlin

Min cost to convert string with transitions of substrings

Dynamic Programming Trie String

trie hash map array dynamic programming floyd-warshall rolling hash

Full post LeetCode Kotlin YouTube Telegram

20.07.2025

hard

1948. Delete Duplicate Folders in System

Kotlin

Remove duplicate folder trees

Trie Tree

trie hash-map dfs longest-prefix-avoidance tree-merging strings

Full post LeetCode Kotlin YouTube Telegram

08.01.2025

easy

3042. Count Prefix and Suffix Pairs I

Kotlin Rust

Count prefix-suffix matched pairs

Trie Hash Map String

HashMap Trie Brute-force String matching Brute-force acceptance Trie traversal

Full post LeetCode Kotlin Rust YouTube Telegram

25.10.2024

medium

1233. Remove Sub-Folders from the Filesystem

Kotlin Rust

Remove empty subfolders

Trie Sorting String

trie hash-map sort linear-scan prefix-check strings

Full post LeetCode Kotlin Rust YouTube Telegram

25.09.2024

hard

2416. Sum of Prefix Scores of Strings

Kotlin Rust

Counts of words with same prefixes

Trie Hash Map

trie hashmap none trie_for_prefix_counting strings graph

Full post LeetCode Kotlin Rust YouTube Telegram

24.09.2024

medium

3043. Find the Length of the Longest Common Prefix

Kotlin Rust

Common digit prefix between all pairs of two num arrays

Trie

HashSet Trie max Prefix Extraction Strings Arrays

Full post LeetCode Kotlin Rust YouTube Telegram

23.09.2024

hard

2707. Extra Characters in a String

Kotlin Rust

Min extra chars to form an s from dictionary programming

Trie Hash Map String

set map dp dfs memoization suffix-comparison

Full post LeetCode Kotlin Rust YouTube Telegram

21.09.2024

medium

386. Lexicographical Numbers

Kotlin Rust

Lexicographical ordered numbers 1..n

Graph Trie Backtracking

Trie List DFS DFS Traversal Trie Construction Strings

Full post LeetCode Kotlin Rust YouTube Telegram

07.06.2024

medium

648. Replace Words

Kotlin Rust

Replace words with suffixes from dictionary

Trie Hash Map String

trie hash-map trie-prefix-matching strings dictionary

Full post LeetCode Kotlin Rust YouTube Telegram

25.05.2024

hard

140. Word Break II

Kotlin Rust

All string splits with dictionary programming

Graph Dynamic Programming Trie

set trie dynamic_programming recursion memoization trie_prefix_search

Full post LeetCode Kotlin Rust YouTube Telegram

22.09.2023

easy

392. Is Subsequence

Kotlin

Is string a subsequence of another

Trie Two Pointers String

string comparison and subsequence check

Full post LeetCode Kotlin Telegram

2.09.2023

medium

2707. Extra Characters in a String

Kotlin

Min count of leftovers after string split by the dictionary

Trie Hash Map String

trie hash-map map dfs dfs-with-memoization strings

Full post LeetCode Kotlin Telegram

04.08.2023

medium

139. Word Break

Kotlin

If a word is a wordDict concatenation

Graph Trie String

Trie Depth-First Search Trie-DFS with memoization (caching) Strings Prefix-string-matching-as-a-tree

Full post LeetCode Kotlin Telegram

19.03.2023

medium

211. Design Add and Search Words Data Structure

Kotlin

Let's try to write it in a Kotlin way, using as little words as possible.

Trie String Array

trie deque none wildcard_handling strings graph

Full post LeetCode Kotlin Telegram

17.03.2023

medium

208. Implement Trie (Prefix Tree)

Kotlin

Let's try to write it Kotlin-way

Tree Trie String

Trie Array Strings

Full post LeetCode Kotlin Telegram

27.01.2023

hard

472. Concatenated Words

Kotlin

first, scan all the words, and fill the Trie

Trie String Array

trie deque none trie_prefix_matching suffix_tracking strings

Full post LeetCode Kotlin Telegram

6.11.2022

hard

Word Search Ii

Kotlin

Use trie + dfs

Graph Trie String

trie set dfs trie_search backtracking graph

Full post LeetCode