450

DSA Notes

450 Problems

  • []Array
    36
  • [[]]Matrix
    10
  • "s"String
    43
  • ?Searching & Sorting
    36
  • ->LinkedList
    36
  • /\Binary Trees
    35
  • <>BST
    22
  • $Greedy
    35
  • <-BackTracking
    19
  • ||Stacks & Queues
    38
  • /\Heap
    18
  • o-oGraph
    44
  • TTrie
    6
  • DPDynamic Programming
    60
  • 01Bit Manipulation
    10
Home/Category/Trie
6 Problems

Trie

Master trie problems with detailed brute force and optimal solutions.

01
Construct a trie from scratch
Click to view brute force and optimal solutions
02
Find shortest unique prefix for every word in a given list
Click to view brute force and optimal solutions
03
Word Break Problem (Trie solution)
Click to view brute force and optimal solutions
04
Given a sequence of words, print all anagrams together
Click to view brute force and optimal solutions
05
Implement a Phone Directory
Click to view brute force and optimal solutions
06
Print unique rows in a given boolean matrix
Click to view brute force and optimal solutions