Oscar's Projects
Adventure game created in Java.
Algorithms and Data Structures in JavaScript
A curated list of awesome places to learn and/or practice algorithms.
Big Integer Multiplication in C.
Big Integer Multiplication using Linked Lists, written in C.
Binary Tree in C
Searching and sorting based on birthdates in C.
Caesar cipher program created in Java.
An O(n) algorithm that will take in an array and calculate the lowest possible result that any subset of the array CANNOT sum to.
:mortar_board: Codecademy.com exercise answers
Classic FizzBuzz program in Java, with two solutions.
A demo weather app made to present for folks that are interested in learning to program.
A simple game wheel.
Generic Binary Search Tree in Java.
Config files for my GitHub profile.
Hill Cipher program in Java. A more advanced cipher.
Prints every Kth element from an array. The code takes input from the user, first the length of the array, then the actual values to be stored in the array, and lastly the value for k.
Program in C that permutes people and matches them together, a small version of a "dating-app".
Program that takes in the parameters "width" and "height" and randomly generates a maze. This program is built with several methods which allows the maze to be generated with the wanted dimensions.
Program in Java that finds the way through a given Maze.
šØāš» Plugins and packages for Flutter framework
Plugins for Flutter maintained by the Flutter team
Sierpinski triangle in Java. Not sure if it was ever finished...
The open source Firebase alternative. Follow to stay updated about our public Beta.
A quite challenging program completed in the class System Software. Its combining a Tokenizer, Scanner, Parser, and Virtual Machine.
Program that reads in file(s) and determines if a topological path exists. It orders the graph's vertices in a way such that it simultaneously correspond to a valid path in the graph and a valid topological sort. The solution to this problem is executed in O(n*n) time.
Program that reads in file(s) and determines whether an arbitrary directed graph has a valid topological sort in which some vertex, in this case, X, comes before another vertex, Y.
An implementation of a treap - a binary tree combined with a heap that works with probabilistic data structure and implements tree rotations. This program will calculate the size and height, as well as keeping track of the various traversals of a treap with respect to its data and priority.