I found web development when I was looking for the way to change my profession to more intellectual, demanded and well-paid one. Though I don't have a commercial experience of developing websites, I love creating solutions to problems and taking deep dives into projects improving and making them work.
In my spare time I like to listen to music, play guitar and cook cakes and pies.
This HTML/CSS project is a company home page that was inspired by the puzzles which my friends made. Designed and developed by me.
Tamino fan community
This HTML/CSS project is dedicated to the fan community of singer-songwriter Tamino. Designed and developed by me.
The layout for this HTML/CSS project was designed by Codecademy and developed by me to learn responsive design.
Credit card checker
Besides the function using Luhn algorithm for validating credit card numbers, this code also contains some helpful functions for optimizing the verification process to handle multiple credit cards at a time:
- the function that checks through an array of card numbers for which numbers are invalid, and return an array of invalid cards;
- the function that returns an array of companies which have issued these invalid numbers;
- the function that accepts a string and converts it into an array of numbers to make it easier to test credit card numbers;
- the function that converts invalid numbers into valid numbers.
Objects created with this factory function have some methods useful for the research:
- the method simulating the high rate of mutation that randomly selects a base in the object’s DNA and changes the current base to a different base;
- the method that compares two objects and computes the percentage of DNA the two objects have in common;
- the method computing if an object has likelier chance of survival (if its DNA is made up of at least 60% 'C' or 'G' bases);
- the method that returns the complementary DNA strand.
Also I declared and tested the function that creates 30 instances of this organism and store them in an array. And in the end I created the algorithm to find the two most related instances.
Find your hat
Users are prompted for input to indicate which direction they'd like to move. The field of the game is always generated randomly. Besides the main game scenario the code also contains following extensions.
- The generated field is always checked by the field validator to ensure that the field can actually be solved. It was based on the Hoshen–Kopelman algorithm for labeling clusters on a grid.
- A user can also play the game in the hard mode when one more hole is added after every three turns. Every time a new hole is added, the field is checked for passability again.