Similar Topics

20.6k+ articles

6.3k+ articles

3k+ articles

1.6k+ articles

1.3k+ articles

1.2k+ articles

970+ articles

Pattern Searching

570+ articles

Advanced Data Structure

460+ articles

440+ articles

Trie

70+ posts

Popular articles

Recent articles

Check if the given string of words can be formed from words present in the dictionary

Last updated: 13 July 2023

Given a string array of M words and a dictionary of N words. The task is to check if the given string of words can be formed from words present in the dictionary.Examples: ...read more

Advanced Data Structure

C-String-Question

Advantages of Trie Data Structure

Last updated: 27 February 2023

Introduction:Trie (also known as prefix tree) is a tree-based data structure that is used to store an associative array where the keys are sequences (usually strings). Som ...read more

Advanced Data Structure

Most frequent word in an array of strings

Last updated: 10 January 2023

Given an array of words arr[], The task is to find the most occurring word in arr[].Examples:Input : arr[] = {"geeks", "for", "geeks", "a", "portal", "to", "lea ...read more

Similar Topics

20.6k+ articles

6.3k+ articles

3k+ articles

1.6k+ articles

1.3k+ articles

1.2k+ articles

970+ articles

Pattern Searching

570+ articles

Advanced Data Structure

460+ articles

440+ articles

Word Break Problem | (Trie solution)

Last updated: 18 January 2023

Given an input string and a dictionary of words, find out if the input string can be segmented into a space-separated sequence of dictionary words. See following examples ...read more

Auto-complete feature using Trie

Last updated: 20 February 2023

We are given a Trie with a set of strings stored in it. Now the user types in a prefix of his search query, we need to give him all recommendations to auto-complete his qu ...read more

Advanced Data Structure

Palindrome pair in an array of words (or strings)

Last updated: 13 September 2023

Given a list of words, find if any of the two words can be joined to form a palindrome.Examples:Input : list[] = {"geekf", "geeks", "or", "kee ...read more

Advanced Data Structure

Boggle using Trie

Last updated: 20 April 2023

Given a dictionary, a method to do a lookup in the dictionary and a M x N board where every cell has one character. Find all possible words that can be formed by a sequenc...read more

Advanced Data Structure

Minimum XOR Value Pair

Last updated: 17 March 2023

Given an array of integers. Find the pair in an array that has a minimum XOR value.Examples :Input : arr[] = {9, 5, 3}Output : 6 All pair with xor value (9 ^ 5) = ...read more

Construct a unique matrix n x n for an input n

Last updated: 18 November 2022

Given an odd integer n, find a matrix of size n x n with the following conditions:Each cell contains an integer from 1 and n (inclusive).No integer appears twice in the sa ...read more

Implement a Phone Directory

Last updated: 02 March 2023

Given a list of contacts that exist in a phone directory. The task is to implement a search query for the phone directory. The search query on a string ‘str’ displays all ...read more

Advanced Data Structure

Technical Scripter

Longest Common Prefix using Trie

Last updated: 15 February 2023

Given a set of strings, find the longest common prefix.Input : {“geeksforgeeks”, “geeks”, “geek”, “geezer”}Output : "gee"Input : {"apple", "ape", "april"}Output : "ap"Pr...read more

Advanced Data Structure

Longest Common Prefix

Overview of Graph, Trie, Segment Tree and Suffix Tree Data Structures

Last updated: 09 February 2023

Introduction:Graph: A graph is a collection of vertices (nodes) and edges that represent relationships between the vertices. Graphs are used to model and analyze networks,...read more

Advanced Data Structure

Pattern Searching using a Trie of all Suffixes

Last updated: 20 February 2023

Problem Statement: Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]. You m...read more

Pattern Searching

Advanced Data Structure

Trie | (Delete)

Last updated: 21 February 2023

In the previous post on trie we have described how to insert and search a node in trie. Here is an algorithm how to delete a node from trie.During delete operation we dele ...read more

Advanced Data Structure

Trie | (Insert and Search)

Last updated: 20 February 2023

What is Trie?Trie is a type of k-ary search tree used for storing and searching a specific key from a set. Using Trie, search complexities can be brought to optimal limit ...read more

Advanced Data Structure