
Lizaveta Dondysh
Design enthusiast and Frontend newcomer from Vilnius
Always ready to chat about studying at RSS and collaborate on projects here
Contact information
- Email lizadondysh@icloud.com
- GitHub @haslie22
- Telegram @haslie22
- Discord @haslie
- Location Vilnius, Lithuania
- LeetCode haslie22
About Me
I’m a frontend developer with a solid foundation in building accessible, user-friendly web applications and over five years of experience as a UX/UI and graphic designer. My design background gives me a strong eye for usability, consistency and visual detail, which I carry into development.
I’ve also contributed to an open-source educational platform used by thousands of students, where I improved usability, added new features to enhance the learning experience and created study materials on front-end development and core programming concepts.
Skills
Frontend Development
- Languages & Core HTML, CSS, JavaScript, TypeScript
- Styling & UI CSS Modules, Sass, Material UI, Angular Material, Ant Design
- Frameworks & Libraries React, React Router, Next.js, Angular, RxJS
- Build & Bundling Tools Webpack, Vite
- Testing React Testing Library, Jest
Backend Development
- Languages & Frameworks Node.js, Nest.js
- APIs & Data GraphQL, REST, Prisma, Swagger / OpenAPI
- Databases PostgreSQL
- Authentication & Security JWT
- Containerization Docker
Accessibility & Performance
- WCAG 2.2
- VoiceOver
- Browser DevTools (Chrome, Firefox, Safari)
Development Tools
- Visual Studio Code
- Postman
- ESLint, Prettier
Version Control & Collaboration
- Git, GitHub, GitLab
- Jira, Confluence, Trello
Design Tools
- Figma
- Adobe Photoshop, Illustrator, InDesign
- Tilda, Wix
E-commerce Platforms
- Commercetools
Code Example from LeetCode
Given an unsorted integer array nums. Return the smallest positive integer that is not present in nums.
- Algorithm must run in O(n) time.
- Must use O(1) auxiliary space.
-
Input: nums = [1,2,0]
Output: 3
Explanation: The numbers in the range [1,2] are all in the array. -
Input: nums = [3,4,-1,1]
Output: 2
Explanation: 1 is in the array but 2 is missing. -
Input: nums = [7,8,9,11,12]
Output: 1
Explanation: The smallest positive integer 1 is missing.
function firstMissingPositive(nums) {
const l = nums.length;
for (let i = 0; i < l; i++) {
if (nums[i] < 1) nums[i] = l + 2;
}
for (let i = 0; i < l; i++) {
const index = Math.abs(nums[i]) - 1;
if (index < l) nums[index] = -Math.abs(nums[index]);
}
for (let i = 0; i < l; i++) {
if (nums[i] > 0) return i + 1;
}
return l + 1;
}
Work Experience
-
Frontend Developer Intern
EPAM Systems
July 2025 – Present
-
Activist, Developer
Rolling Scopes School
March 2023 – Present
-
UX/UI Designer, Graphic Designer
Freelance
October 2020 – September 2025
Education & Courses
-
Information Resources Management
Belarusian State University
-
React Course
Hexlet
-
NodeJS Course
Rolling Scopes School
-
JS/FE Course
Rolling Scopes School
-
JS/FE Pre-School Course
Rolling Scopes School
-
Interface Design Course
CIDR
-
Digital Design Course
CIDR
Take a look at the projects I’m proud of
-
E-commerce App
Frontend project
-
Node.js REST Service
Backend project
Languages
-
Russian: Native
-
Belarusian: Native
-
English: B2+ (EPAM English Test result)
-
Italian: B2
-
Lithuanian: A1+