Skills

PHP

90%

Mathematics

30%

Magic

0%

Experience

 
 
 
 
 

Software Engineer

Ibuildings

January 2018 – Present Vlissingen
Responsibilities include:

  • Software development
  • Leading tactical meetings
  • Deploying
 
 
 
 
 

Intern

Ibuildings

September 2017 – January 2018 Vlissingen
During my internship I worked on the call for papers application for the Dutch PHP conference

Accomplish­ments

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Coursera Apr 2019
The fourth of a four part series on algorithms, focusing on NP complete problems.
See certificate

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Coursera Mar 2019
The third of a four part series on algorithms, focusing on greedy algorithms and dynamic programming.
See certificate

Graph Search, Shortest Paths, and Data Structures

Coursera Feb 2019
The second of a four part series on algorithms, focusing on graphs algorithms and data structures.
See certificate

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

Coursera Feb 2019
The first of a four part series on algorithms, focusing on divide and conquer algorithms
See certificate

Recent Posts

PHP is already strictly typed, in the same way that JavaScript is. Not through the language itself, but with the help of tooling. …
2 min read PHP

The tools a modern PHP developer needs to strive.
7 min read PHP

Big O is used to notate the ‘time and space complexity’ of algorithms. It provides us with key insights into how fast an …
5 min read math

$\sqrt{x} = \frac{x}{\sqrt{x}}$ Seeing the above equation may look completely logical, or not. When i saw it a few days ago, i thought …
1 min read math

Chances are, if you are writing software, you have some dependencies on other peoples code. There is no reason to reinvent the wheel, …

3 min read
See all posts

Tags

big-o code-review comparison deployment edge-cases error-handling extensions github infection mutation-testing noop polyfills semver switch-case tests travis update

Contact