Create Design Add and Search Words Data Structure.py#238
Create Design Add and Search Words Data Structure.py#238Pradeepsingh61 merged 2 commits intoPradeepsingh61:mainfrom
Conversation
|
🎉 Welcome to Hacktoberfest 2025, @Vijayaa21! 🎃 Thank you for your first contribution to our DSA repository! Here's what happens next: 🔍 Automatic Checks
📋 Next Steps🎁 What You Get
💡 Tips for Success
Welcome to the community! 🚀 |
🤖 Automated PR Status🔍 Code Validation✅ Passed - File naming and structure look good! 🧪 Compilation Tests❌ Failed - Please fix compilation errors and try again. 📋 Overall Status
This comment was generated automatically. Checks will re-run when you push new commits. |
|
🎉 Welcome to Hacktoberfest 2025, @Vijayaa21! 🎃 Thank you for your first contribution to our DSA repository! Here's what happens next: 🔍 Automatic Checks
📋 Next Steps🎯 Great job! Your code compiled successfully. Maintainers @Karanjot786 and @Pradeepsingh61 will review your PR soon. 🎁 What You Get
💡 Tips for Success
Welcome to the community! 🚀 |
🤖 Automated PR Status🔍 Code Validation✅ Passed - File naming and structure look good! 🧪 Compilation Tests✅ Passed - All code compiles successfully! 📋 Overall Status🎉 Ready for Review - Your PR has passed all automated checks! This comment was generated automatically. Checks will re-run when you push new commits. |
Karanjot786
left a comment
There was a problem hiding this comment.
@Pradeepsingh61 now you can merge it
Space Complexity
Each node stores a dictionary of children.
In worst case (all words unique):
O(N × L), where N = number of words, L = average word length.
Each TrieNode uses space for:
children dictionary (up to 26 entries for lowercase).
is_word boolean.
So, Space = O(N × L).