Trie a learning!!

Trie

What is a Trie 

A trie is a data structure used to store multiple words and makes it easy to iterate and find a word inside it.
It can be used instead of storing Strings inside an Arraylist and then using contains function. It is helpful if we want to store multiple words and find them easily.

How does it work

It is a basic tree strucure having multiple child nodes, each node represents a character and have child nodes which also represent characters.

like if we want to store a single word "and" the tree will be like

a->n->d   but if we want to add a word ant inside the trie then it will be like
a->n->d
      \->t    
the node n will have multiple child nodes. Each node can also represent a flag end_of_word which denotes if the current node can be considered end of a word or not. If it is true then all the characters from root to this node can form a word.

Implementation


Single class Implementation

Comments

Post a Comment

Popular posts from this blog

Lowest common ancestor in a binary Tree

Approach Define a recursive function rec that takes three parameters: root (the current node), p (first node to find the lowest common ancestor for), and q (second node to find the lowest common ancestor for). Check if the current node root is null or if it is either p or q . If any of these conditions is true, return the current node root as the lowest common ancestor. Recursively call the rec function for the left subtree of the current node and assign the result to a variable l . Recursively call the rec function for the right subtree of the current node and assign the result to a variable r . Check if both l and r are not null. If so, it means that p and q are found on different subtrees of the current node, and the current node root is their lowest common ancestor. Return the current node root . If l is null, it means that both p and q are on the right subtree (or not present in the tree). Return r . If none of the above conditions are met, it means ...
Read more

Interview

  follow this link Stages of an interview Report Issue Most algorithmic interview rounds are between 45 - 60 minutes. The interviews can be broken down into stages, and at each stage, there are multiple things you should do to maximize your chances of success. Let's break it down. 1. Introductions At the start of the interview, most of the time your interviewer will briefly introduce themselves and their role at the company, then ask you to introduce yourself. Prepare and rehearse a brief introduction of yourself. It should summarize your education, work experience, and interests in 30-60 seconds. Smile and speak with a confident voice. When the interviewer is talking about their work at the company, pay attention - it will help to ask questions about it later. If the interviewer mentioned anything that you are also interested in, whether it be their work or a hobby, mention it. 2. Problem statement After introductions, your interviewer will give you a problem stat...
Read more

30. Substring with Concatenation of All Words

Problem Statement You are given a string s and an array of strings words. All the strings of words are of the same length. A concatenated substring in s is a substring that contains all the strings of any permutation of words concatenated. For example, if words = ["ab","cd","ef"], then "abcdef", "abefcd", "cdabef", "cdefab", "efabcd", and "efcdab" are all concatenated strings. "acdbef" is not a concatenated substring because it is not the concatenation of any permutation of words. Return the starting indices of all the concatenated substrings in s. You can return the answer in any order. Example 1: Input: s = "barfoothefoobarman", words = ["foo","bar"] Output: [0,9] Explanation: Since words.length == 2 and words[i].length == 3, the concatenated substring has to be of length 6. The substring starting at 0 is "barfoo". It is the concaten...
Read more