A Language Classifier powered by Recurrent Neural Network(RNN) implemented in Python without AI libraries.
The classifier classifies a word in English, Spanish, Finnish, Dutch, or Polish. The classifier outputs correctly at a rate of approximately 85%.
It is purely implemented with numpy and built-in libraries.
Prefix sum is a powerful pre-processing/caching technique for algorithm problems. The idea is to calculate/store the consecutive totals of the elements in an array in O(n).
A Pygame implementation of classic Flappy-Bird game controlled by Neuroevolutional AI.
A Java implementation of Chiness Chess Game using Swing.
This project is developed with React to help people to view algorithmic processes intuitively and entertainingly.
You may visit the page at jasonfenggit.github.io/Visualizer/ with Chrome.
There are N network nodes, labelled 1 to N.
Given times, a list of travel times as directed edges times[i] = (u, v, w), where u is the source node, v is the target node, and w is the time it takes for a signal to travel from source to target.
Now, we send a signal from a certain node K. How long will it take for all nodes to receive the signal? If it is impossible, return -1.
This problem is from my Discrete Mathematics Course.
In the game of gumdrops, two players are on alternative turns with Player 1 going first. The player has to choose any gumdrop on a grid with arbitrary width and length on each turn. The player then eats the gumdrop as well as all gumdrops above and to the right of it. The player who is forced to eat the poisoned lower-left corner one loses.
