Implement a Trie with insert and exact search

Approach

• Each node stores children map and isEnd flag.
• Insert walks characters, creating nodes as needed.
• Search returns true only if path exists and isEnd at last char.

Java Solution

public class TrieNode {
    Map<Character, TrieNode> children = new HashMap<>();
    boolean isEnd;
}

pu…