This is practice repository of DSA
-
Updated
Apr 5, 2022 - C++
This is practice repository of DSA
A database for elements in the periodic table where the user can browse through all the elements, with different UI layouts available to use.
Implemented suffix array for different tasks, trie and external merge sort
Using a trie we predict the next closest words to the input.
During the Data Structure II - DCC012B course, we developed a program that performs the reading, processing and manipulation of a collection of books: through such implementations it was possible to capture the 50 words that are most repeated in each book, as well as the 50 most repeated words among all the books in the collection. In short, eve…
A simple implementation of a Trie data structure to auto-complete words.
This is implementation of trie to make a library management system
Trie is a data structure which is used for storage or querying in dictionaries or documents. It is basically a tree with a 26 children that corresponds to every character or letter in the English language. In this exercise most of the operations for Trie is shown in the cpp and header files.
PhoneBook is a C++ Console Application. Using Hash Table and Trie Data Structure.
A Complete Solution of the well known 'Striver SDE Sheet ' in C++.
A compression algorithm using huffman method
Simple database engine written in C++.
Spellchecking using Trie ADT. Users can manipulate the trie by adding, deleting words and finding similar words (imitation of spell recommendations feature)).
Add a description, image, and links to the trie topic page so that developers can more easily learn about it.
To associate your repository with the trie topic, visit your repo's landing page and select "manage topics."