LaVivien

CryptoSystem

Implement Merkle-Hellman Knapsack cryptosystem algorithm using doubly linked list.

grokking_data_structures

LegoMania

Create a Swing GUI application that displays the graphics of lego blocks. Use Java JFrame in swing.

PolynomialsInLinkedList

Implement polynomial arithmetic using double liked list. The polynomial has add, subtract, product, quotient, and remainder methods.

RoundRobinTournament

Implement Round-robin tournament in Java.

SpellingCorrector

Implement spelling corrector using trie (data structure) and edit distance(Dynamic Programming).

LaVivien/RoundRobinTournament

Implement Round-robin tournament in Java.

LaVivien/SpellingCorrector

Implement spelling corrector using trie (data structure) and edit distance(Dynamic Programming).

LaVivien/CryptoSystem

Implement Merkle-Hellman Knapsack cryptosystem algorithm using doubly linked list.

LaVivien/grokking_data_structures

LaVivien/HauntedHouse

Java implementation of haunted house adventure. Navigate the rooms in the haunted house with Java swing and abstract factory.

LaVivien/LegoMania

Create a Swing GUI application that displays the graphics of lego blocks. Use Java JFrame in swing.

LaVivien/PolynomialsInLinkedList

Implement polynomial arithmetic using double liked list. The polynomial has add, subtract, product, quotient, and remainder methods.

LaVivien/WebScraperAndParser

Example of using HttpURLConnection, Jsoup, Gson, Selenium with chrome headless to retrieve and parse web data.

LaVivien/HangmanGUI

Implement Hangman game with GUI for user to enter letter with keyboard. The progress bar will show the number of tries left.

LaVivien/MinimumSpanningTree

Create Minimum Spanning Tree using Union Find and Kruskal algorithms.

LaVivien/BlackoutMath

Solve the blackout math puzzle using two stacks.

LaVivien/CalculateAreaOfCircleNotUsePi

Calculate the area of circle, ellipse without using the formula, ie πr2 or πab.

LaVivien/ChutesAndLadders

Implement game "chutes and ladders" in Java

LaVivien/ConvertGraphToTree

The basic idea of converting graph to tree is to detect whether there is cycle in graph first, then take out one edge in the cycle.

LaVivien/DrawGraphics

Draw geometric shapes using Java swing and awt.

LaVivien/GraphCutBasedPartition

Implement BFS, DFS and ford fulkerson algorithms for maximum flow, minimum cut problem in Graph (flow network)

LaVivien/GroupChatRoom

Implement a network protocol ChattyChatChat using socket. It simulates chat room with multiple users.

LaVivien/illustrated_data_structures

LaVivien/JAXRSJsonExample

Develop Restful web services using JAX-RS. Endpoints includes add item and return all items in Json. Use design pattern Factory, DAO, Singleton and DTO.

LaVivien/LevenshteinDistance

Implement Levenshtein distance edit algorithm. You need to print the path for each step.

LaVivien/LexicalAnalyzerAndParser

Implement Lexical Analyzer and parser for given grammer and expressions.

LaVivien/RealtyBST

Implement binary search tree with parent pointer and its iterator with Java.

LaVivien/RestaurantDeliveryService

Implement a restaurant delivery service using multi-treading, locks and semaphore.

LaVivien/SpringLoginWithMath

Create login form with JSP. User answers a simple math question to login. Using Spring Boot.

LaVivien/TicTacToe

Implement 2-players Tic Tac Toe in Java. The board should be a default 3x3 but can be made larger.

LaVivien/TwitterBot

Generate tweet based on the training data using Markov chain.