Hi, I'm Maryia Huchkova; I'm beginner front-end;
{ My goal is to become a professional in my field }


{About me}
I chose to be a programmer because I would like to constantly develop, comprehend new technologies.
It is important for me to cooperate and exchange experience with other countries, to be in a friendly and intelligent team.
In turn, I am hardworking and responsible. I try to complete my task as efficiently as possible and treat my colleagues in a friendly and respectful manner, observing subordination.
I love what I do
{Skills}

I work with passion.
- [HTML]
- [CSS]
- [JavaScript]
- [Git]
- [GitHub]
- [React]
- [Redux Toolkit]
{Code example}
Given an array of integers, find the one that appears an odd number of times. There will always be only one integer that appears an odd number of times.
[1,2,2,3,3,3,4,3,3,3,2,2,1] should return 4, because it appears 1 time (which is odd).
function findOdd(numbers) {
const counters = new Map();
for (const number of numbers) {
if (counters.has(number)) {
let counter = counters.get(number);
counter++;
counters.set(number, counter);
} else {
counters.set(number, 1);
}
}
for (const number of counters.keys()) {
let counter = counters.get(number);
if (counter % 2 === 1) {
return number;
}
}
}
Write a function toWeirdCase (weirdcase in Ruby) that accepts a string, and returns the same string with all even indexed characters in each word upper cased, and all odd indexed characters in each word lower cased. The zero-ith index is even and you need to start over for each word.
toWeirdCase( "Weird string case" ); // => returns "WeIrD StRiNg CaSe"
function toWeirdCase(string){
let words = [];
let newStr = "";
words = string.split(" ");
for (let word of words) {
for (let i = 0; i < word.length; i++) {
if (i % 2 === 0) {
newStr += word[i].toString().toUpperCase();
} else {
newStr += word[i].toString();
}
if (i === word.length - 1) {
newStr += " ";
}
}
}
return newStr.trim();
}
Given a lottery ticket (ticket), represented by an array of 2-value arrays, you must find out if you've won the jackpot. To do this, you must first count the 'mini-wins' on your ticket. Each subarray has both a string and a number within it. If the character code of any of the characters in the string matches the number, you get a mini win. Note you can only have one mini win per sub array.
bingo([['ABC', 65], ['HGR', 74], ['BYHT', 74]], 1); // => 'Winner!'
function bingo(ticket, win) {
let countWin = 0;
for (let i = 0; i < ticket.length; i++) {
let str = "";
str = ticket[i][0];
for (let j = 0; j < str.length; j++) {
if (str.charCodeAt(j) == ticket[i][1]) {
countWin += 1;
break;
}
}
}
if (countWin >= win) {
return "Winner!";
} else {
return "Loser!";
}
}
{My projects}
...and the most important part
[Portfolio]
- photographer's portfolio landing page.
[Movie App]
- an application that displays information about movies at the request of the user.
[Memory Game]
- a game with a set of pairs of identical cards that are displayed face down.
{Education}
- [RS Schools Course "JavaScript/Pre-School" (completed)];
- [RS Schools Course "JavaScript/Front-end" (completed)];
- [RS Schools Course "JavaScript/React" (completed)];
- [Lessons with a native English speaker on the international online educational platform "Preply" (in process)];
{Hobbies}
- [Science]
- [Running]
- [Cycling]
- [Books]
- [Travels]
console.log("I love sports");