D Tripp's Projects
a console battleship game written in Java
Recommendation Engine for Books
application for progress tracking in book reading.
Topic Modeling and Natural language processing on problem statements and solutions provided by codechef competitive programming site
Data Structures Implemented in Java
Designed and implemented a database to track air travel related information in PostgreSQL with SQL.
DeepRL algorithms implementation easy for understanding and reading with Pytorch and Tensorflow 2(DQN, REINFORCE, VPG, A2C, TRPO, PPO, DDPG, TD3, SAC)
A minimalistic text-based social media platform with broadcasting of ephemeral messages
A tool that tracks, monitors and locates attackers, in real-time
the odin project
Aminiated clock
Database project with books
A collection of stock market resources and tools
Given a series of mazes encoded as zeros and ones, it was determined which two of the mazes were least similar. To solve, the mazes were converted into graphs and traversed using a depth first search, resulting in a sequence of directions. Sequence similarity was analyzed by evaluating each pair of sequences using a dynamic programming algorithm to find the maximum common subsequence. Of these results, the two mazes with the lowest similarity score were chosen.
An ancient logic game which has been stumping puzzle lovers since 1992. We have coded a logical agent to play (and win) this game. As the agent uncovers squares, it builds a knowledge base and makes inferences about which squares are safe and which squares contain mines. As the agent examines the safe squares, more areas are opened. Sometimes, the agent is unable to determine whether a square is safe or not. In the case, advanced tactics for a probabilistic treatment of forced guesses are employed.
Minima is a one-size-fits-all Jekyll theme for writers.
Mountaincar is a simulation featuring a car on a one-dimensional track, positioned between two “mountains”. The. Goal is to drive up the mountain on the right; however, the car’s engine is not strong enough to scale the mountain in a single pass. Therefore, the only way to succeed is to drive back and forth to build up momentum.
Toy music playlist webapp with flask
The N-Queens chess puzzle is the problem of placing n queens on an n x n chessboard such that no two attack each other. This puzzle was solved using two techniques: Local (Hill-Climbing) Search and a Genetic Algorithm. Local Search finds an optimal solution by systematically evaluating and moving the worst-placed piece to a better square. The genetic algorithm runs several problem instances in parallel and uses elements of randomness to discover a solution. Solved up to n = 14
console application to complete oswestry questionnaire
Production Grade Log-Parsing CLI Application. Employs unit testing, logging, and CI/CD.
A flask app for fitness
Learn how to design large-scale systems. Prep for the system design interview. Includes Anki flashcards.
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent