Alex's Projects
Ask-me-for-a-weekday is a nodeJS based command line application that asks you for the day of the week of a particular date.
π§ A list of awesome Linux softwares
battleship is a 100%-Javascript battleship game.
Bernoulli is a small python program to calculate a bernoulli trial or a bernoulli process.
A very simple algorithm that calculates the total bitcoin supply after a given block
Dynamic-Programming solution of the "Box stacking"-Problem: Given a set of N rectangular 3-D boxes. What is the highest possible stack you can create with them? Only strictly smaller boxes are allowed on top of each other (2D-based); rotation is allowed.
A Firefox Add-on that clones the active tab with just 1 click on the icon or with "Ctrl+Alt+D" / "Cmd+Alt+D".
A simple jsfiddle/jsbin like tool for testing and sharing small HTML, Js, CSS snippets
Compares counting inversions in an array via the Exhaustive Approach and via Divide and Conquer (Python)
Calculating the day of the week of any date is not hard! This Blazor-Webassembly app supports you learning it and improving yourself.
A web site that helps you discover awesome .NET open source and community resources
A simple Ethereum transaction (Web3)
A simple Ethereum-based conflip-smart contract (Web3)
A simple Ethereum-based escrow-smart contract (Web3)
A simple Ethereum-based hello world-smart contract (Web3)
How to submit a raw Ethereum transaction (Web3)
Fluent Random Picker is a nice, performant, fluent way to pick random values. Probabilities can be specified, values can be weighted.
A list of SaaS, PaaS and IaaS offerings that have free tiers of interest to devops and infradev
Dynamic Programming solution for the gold-mine problem
Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. It's usually implemented via a greedy approach.
A Set implementation for JavaScript
Working with graphs in Java
JSON-Auflistung mit 500 mΓ€nnlichen & 500 weiblichen Vornamen, sowie 2000 Nachnamen
Dynamic-Programming solution of the "Kadene's Algorithm"/"Maximum Sum Subarray Problem": Given an array "a" of N integers. Find the contiguous sub-array with maximum sum.
Divide and Conquer algorithm to multiply n-bit numbers in O(n^1.58).. This implementation works completely without using Python's "*"-operator; just "+", "-", bitwise operations and a lookup table.
Dynamic-Programming solution of the "Largest square formed in a matrix"-Problem: Given a binary matrix: What is the maximum size square sub-matrix with all 1s? (and additional: What is the maximum size square sub-matrix with all 1s at the border?)
Simple Markdown CV / Resume