Contains the solutions for the programming questions in the CodingNinjas Java+DSA course
-
Updated
Oct 11, 2022 - Java
Contains the solutions for the programming questions in the CodingNinjas Java+DSA course
A Java implementation of the Trie data structure
coding-ninjas-dsa-java-solutions
The project smart text editor was done as part of the Coursera course Data Structure and Performance
Implementing Autocomplete using Tries
Projet d’algorithmie (ALGAV - Master 1 STL, à l'UPMC) : Implémentation et études en Java de tries «Hybrides» et «Arbre de la Briandais» - Note : 19/20
All Leetcode Important Problems Save it for Future Reference
A simple word processor using data structures like tries. This project is a property of Purdue University, and copying any part of the code would be a violation of Purdue's academic honesty code.
This project implements an interactive map of the area surrounding UC Berkeley with routing capabilities. It mainly uses a trie (prefix tree) structure.
Java program for a custom hash trie data structure to calculate shortest path for airplane itinerary
Natural Language Processing algorithms implementation. Current implementation features sentence completion and knowledge building
A Project Management by Jobs scheduling system in Java, done as a part of course (COL106) assignment
Important Data Structure Programs
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.
Provides different Java implementations of tries (prefix trees)
Practicing my Data Structures and algorithms to brush-up my skillset.
My original solutions to all of LeetCode Blind 75 Problems
Add a description, image, and links to the tries topic page so that developers can more easily learn about it.
To associate your repository with the tries topic, visit your repo's landing page and select "manage topics."