Statement

Until now I’ve lacked a guide who would help me to find myself in IT and to move on. I really hope RSSchool courses will become such a guid fo me!

Kate Blazhko

Junior frontend developer

Pro skill

  • HTML/CSS
  • JavaScript Basics
  • Git, GitHub
  • VS Code
  • Node JS
  • TypeScript

Language

  • Russian - native speaker
  • English - A2

Contacts

Work experience

2019
Vileika
Since 2019 I’ve been on maternity leave and I’ve realized this is my chance for self-development, the opportunity to find my place in this multifaceted field. I’ve started studying English with a teacher, to learn the basics of web development, programming and databases on my own.
2013
Hospital, Vileika
My responsibilities included providing maintenance, repair and procurement of different medical equipment for the needs of the hospital. That job was new for me and I had to independently search for all the necessary information about various medical equipment (types, purpose, manufacturers, evaluation criteria). I also had to contact a large number of specialists from other departments and other organizations as well. As a matter of fact Procurement legislation is constantly changing. So it was necessary to adjust all the time and to change the work order according to the new conditions. I believe that thanks to working together with my coworkers I managed to successfully cope with my duties.
2011
Ryazan
My main task was to develop design documentation from scratch in a small but fast growing company. Under the pressure of time it was necessary to think over and implement the system of design documentation understandable for everyone. As a result I managed to establish contacts with all the departments of the company, collect all the necessary information, opinions of some other employees and to solve the problem.

Education

2022
RSSchool
Free beginner's course
2011
Ryazan
Faculty of Computer Science, department of Computer Aided Design of Computing Facilities

Projects

Code example


function quickSort(arr) {

if (arr.length < 2) return arr

const sortArr =arr.slice()
const point = Math.floor(Math.random() * sortArr.length)
const lessArr = [];
const biggerArr = [];

sortArr.forEach(item => {

if (item < sortArr[point]) lessArr.push(item)
if (item > sortArr[point]) biggerArr.push(item)
});

return [...quickSort(lessArr),
        sortArr[point],
        ...quickSort(biggerArr)]

}