Create README.md

Author: JawadSher

21 - Trie Data Structure Problems/README.md

@@ -0,0 +1,34 @@
+<h1 align='center'>TRIE - DATA STRUCTURE - PROBLEMS</h1>
+
+<p>This repository contains a curated collection of problems based on the <b>Trie (Prefix Tree)</b> data structure. It is designed to help developers and students enhance their understanding of Trie and its real-world applications in solving various string and search-related problems. The repository includes beginner-friendly explanations, optimized solutions, and links to corresponding LeetCode and GeeksforGeeks problems. </p>
+
+### Features
+- **Comprehensive Problem Set**: A variety of problems to strengthen your knowledge of Trie data structure.
+- **Structured Repository**: Each problem has its dedicated folder with code, explanations, and references.
+- **Cross-Platform Links**: Includes links to problems on LeetCode and GeeksforGeeks for additional practice.
+- **Beginner to Advanced**: Problems range from basic implementations to more complex real-world use cases.
+
+### Use Case
+This repository is ideal for:
+- Students preparing for technical interviews.
+- Developers wanting to learn or refine their Trie implementation skills.
+- Anyone interested in exploring efficient search operations and prefix-related algorithms.
+
+
+## Repository Content
+
+<p>
+<img src="https://img.shields.io/badge/problems%20count-02-orange?logo=leetcode" alt="LeetCode">
+<img src="https://img.shields.io/badge/problems%20count-01-darkgreen?logo=geeksforGeeks" alt="GeeksforGeeks">
+<img src="https://img.shields.io/badge/total%20problems%20count-04-blue" alt="Problem Count"> 
+</p>
+
+| No. | Problem Name                              | Description                                | LeetCode    | GFG    |
+|-----|------------------------------------------|--------------------------------------------|------------------|-------------|
+| 01  | [Example](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/21%20-%20Trie%20Data%20Structure%20Problems/01%20-%20Example) | An example problem demonstrating trie basics. | Non             | Non        |
+| 02  | [Implement Trie](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/21%20-%20Trie%20Data%20Structure%20Problems/02%20-%20Implement%20Trie) | Implement basic operations (insert, search, startsWith) for a trie. | [Link](https://leetcode.com/problems/implement-trie-prefix-tree/) | Non |
+| 03  | [Longest Common Prefix](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/21%20-%20Trie%20Data%20Structure%20Problems/03%20-%20Longest%20Common%20Prefix) | Find the longest common prefix among an array of strings. | [Link](https://leetcode.com/problems/longest-common-prefix/) | Non        |
+| 04  | [Phone Directory](https://github.com/JawadSher/DSA-LeetCode-GFG-Problems-Repository/tree/main/21%20-%20Trie%20Data%20Structure%20Problems/04%20-%20Phone%20Directory) | Search and suggest contacts in a phone directory. | Non             | [Link](https://practice.geeksforgeeks.org/problems/phone-directory/0) |
+
+---
+Happy Coding! 😊