πŸ‘¨β€πŸ’»
Cracking-Interview
search
⌘Ctrlk
πŸ‘¨β€πŸ’»
Cracking-Interview
  • Data Structures and Algorithms
  • Arrays
  • Linked List
  • Strings
  • Binary Tree
  • Stack and Queue
  • Hash Table
  • Binary Search
  • Binary Search Tree
  • Bit manipulation
  • Graph
  • Disjoint Sets(Union-Find)
  • Heap and Priority Queue
  • Trie
    • 1. Implement Trie (Prefix Tree)
    • 2. Replace Words
    • 3.Design Add and Search Words Data Structure
    • 4. Search Suggestions System
  • Dynamic Programming
  • Greedy Algorithms
  • Backtracking
  • Sub Array and Sliding Window Problems
  • Design
  • Maths
  • Sorting-Algorithms
    • Merge Sort
    • Quick Sort
    • Heap Sort
    • Selection Sort
    • Bubble Sort
    • Insertion Sort
  • Expected Interview MCQ and Questions c++
  • Concepts in C++
  • System Design Questions
  • πŸ’ΎDBMS
    • Introduction
    • RBMS
    • JOINS
    • SQL
  • πŸ–₯️OS
    • OS and Its Types
    • Process Concept and Threads
    • Process Synchronization
    • Deadlock in Operating System
    • Memory Management
    • Imp Questions of OS for Interviews
  • πŸš™OOPS
    • Introduction and Definitions
  • πŸ“¨COMPUTER-NETWORKS
    • OSI | TCP IP Model
    • Topology
    • Network Devices
    • IP Address
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

Trie

Trie Data Structure
1. Implement Trie (Prefix Tree)chevron-right2. Replace Wordschevron-right3.Design Add and Search Words Data Structurechevron-right4. Search Suggestions Systemchevron-right

Previous13. Smallest range in K listschevron-leftNext1. Implement Trie (Prefix Tree)chevron-right

Last updated 4 years ago