## Program for assigning usernames using Trie

Suppose there is a queue of n users and your task is to assign a username to them. The system works in the following way.… Read More »

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

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… Read More »

## Advantages of Trie Data Structure

Tries is a tree that stores strings. Maximum number of children of a node is equal to size of alphabet. Trie supports search, insert and… Read More »

## Sorting array of strings (or words) using Trie | Set-2 (Handling Duplicates)

Given an array of strings, print them in alphabetical (dictionary) order. If there are duplicates in input array, we need to print all the occurrences.… Read More »

## Minimum Word Break

Given a string s, break s such that every substring of the partition can be found in the dictionary. Return the minimum break needed. Examples:… Read More »

## Maximum possible XOR of every element in an array with another array

Two arrays A and B consisting of N elements are given. The task is to compute the maximum possible XOR of every element in array… Read More »

## Most frequent word in an array of strings

Given an array of words find the most occurring word in it Examples: Input : arr[] = {“geeks”, “for”, “geeks”, “a”, “portal”, “to”, “learn”, “can”,… Read More »

## Trie memory optimization using hash map

We introduced and discussed an implementation in below post. Trie | (Insert and Search) – GeeksforGeeks The implementation used in above post uses an array… Read More »

## Word Break Problem | (Trie solution)

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.… Read More »

## Sorting array of strings (or words) using Trie

Given an array of strings, print them in alphabetical (dictionary) order. If there are duplicates in input array, we need to print them only once.… Read More »

## Find duplicate rows in a binary matrix

Given a binary matrix whose elements are only 0 and 1, we need to print the rows which are duplicate of rows which are already… Read More »

## Frequency of a string in an array of strings

You are given a collection of strings and a list of queries. For every query there is a string given. We need to print the… Read More »

## Microsoft Interview Experience Set 128 | (On-Campus for Internship)

Coding Test Platform: CoCubes Format: 3 coding questions Time: 75 minutes They had a pool of questions and three questions(2 + 3 + 5 marks)… Read More »

## Counting the number of words in a Trie

A Trie is used to store dictionary words so that they can be searched efficiently and prefix search can be done. The task is to… Read More »

## Subarray with XOR less than k

Given an array of n numbers and a number k. You have to write a program to find the number of subarrays with xor less… Read More »