My implementation of 85+ popular data structures and algorithms and interview questions in Python 3 and C++

Natural Language Processing (NLP) library for Crystal

Data Structures & Algorithms. Includes solutions for Cracking the Coding Interview 6th Edition

Lua algorithms library that covers commonly used data structures and algorithms

This will have solutions to all the problems that are included in Coding Ninja's 2020 Java Course. Star the repo if you like it.

A Java implementation of the Trie data structure

A simple word completion program using tries.

This is the repository which contains all Data Structures completely developed in C++

A simple implementation of a Trie data structure to auto-complete words.

Implementing Autocomplete using Tries

Implementation of a Patricia/radix tree data structure, storing a dictionary.

Efficient and reliable memoization using WeakMaps and tries

My implementations of Basic to Advanced data structures and Algorithms in python

A command line autocomplete suggestion application using Java

Repository for course project, Data Structures & Algorithms - Spring 2017.

The tree data structure is a versatile object ; This offering offers the Trie tree - And Binary tree - Data tree. Information can be save at nodes of the tree Trees can be Printed to Tree-view Control / Function Insert / Find Prefix / Find Word a Start Character is used and Stop Character is used. the Trie tree Can store Characters as nodes; Used for Faster String matching! The binary is numerical addressing ; given a numerical value / find the node in the tree to store the value; Sentences can be added to the Search Tree; As well as finding prefixes and suffixes of sentences in the trie

The project smart text editor was done as part of the Coursera course Data Structure and Performance

Great coding challenges using many programming languages

Contains code written during implementation and use of different data structures during Data Structures course at Coding Ninjas

Backup for Advanced Data Structures class labs

Provides different Java implementations of tries (prefix trees)

Contains CPP code for prefix searching using Trie (n-ary trees)

Contains solutions to the May LeetCoding Challenge

Random word generation using Random Markov Processes

Predictive text editor using tries

These are some of the codes I have written in C++. I have done the implementation of many data structures - Trees(Binary + BST + Generic), Hashmaps(problems + implementation), Tries, Graphs, some popular algorithms(Dijkstra's, Prim's..), PriorityQueues(implementation + problems), some codes relating to OOPS as well.

A Trie data structure which can be searched using wild characters.

This repository contains the implementation of Data Structures - LinkedList, Heaps, Trees and Stacks and several important Algorithms - Searching, Sorting, Recursion, Binary Search Trees, Graph Algorithms, Dynamic Programming from scratch in Java.