If you haven’t read the previous part 1, please do so, or else some things will not make sense in this blog post! As always, if you do not understand something, just search it up. There are many sources online that do in-depth explanations much better than me. Also, my code is available here on GitHub.
Let’s get started with some cool data structures and algorithms! Read more
It has been a very long time since I have written any posts because I’ve been doing a ton of competitive programming and school work. However, I am going to start a series on mostly advanced algorithms for competitive programming. The first topic I am going to cover is range updates and queries! Read more
This uses my neural network Java library that can be found here. The trained weights can also be found in the GitHub repository. Read more
My Java machine learning library is now on GitHub. It contains a basic neural network that can be trained using backpropagation and gradient descent (Adam, Adagrad, or SGD). Read more
Levenshtein distance is a metric for the distance between two strings. It is defined by three different types of edits: substitution, insertion, and deletion. The Levenshtein distance between two strings is the minimum number of edits to get from one string to the other. Read more
Over the summer, I’ve been working on a bioinformatics tool for my internship. It does preprocessing for the genotyping by sequencing (GBS) pipeline and parses .fastq files so that the processed sequences can later be aligned or base called or analyzed.
I’m starting to learn some Machine Learning (just learned Python). My first project is a simple machine learning addition program. Read more
The Knapsack problem is a Dynamic Programming problem. We have to maximize the total value of the items, while making sure the total weight of the items is lower than a specific value. There are two variations to this problem:
2D maze solver written in Java. Has a Swing GUI and it contains eight methods for solving mazes: BFS, DFS, Best-First BFS, Dijkstra’s, Bellman-Ford, Floyd-Warshall, A*, and simulate hand on right wall.