🤹🏻 Skills and Proficiency:

icon	skills
	GIT, GITHUB, GITLAB
	HTML5, CSS3 (preprocessor SASS) , BEM methodology
	JavaScript, TypeScript (basics)
	Basic python
	Basic knowledge or relational database SQL and non-relational database MONGODB (mongoose)
	Basic concepts of node.js
	Basic C (pointers and memory allocation)
	react (basic hooks, react router)
	basic tailwind, bootstrap
	backend: express (basics)

🤓 Interesting problem that I solved using JS (Project Euler):

Problem 12: Highly divisible triangular number The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be: 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ... Let us list the factors of the first seven triangle numbers: We can see that 28 is the first triangle number to have over five divisors. What is the value of the first triangle number to have over n divisors?

        
          
            function* genTriangleNum() {
              let k = 1;
              while (true) {
                yield (k * (k + 1) / 2)
                k++
              }
            }
          
            function checkDivisors(num) {
              let count = 0
              for (let i = 1; i <= Math.sqrt(num); i++) {
                if (num % i === 0) {
                  count += (i * i === num) ? 1 : 2
                }
              }
              return count
            }
            
            function divisibleTriangleNumber(n) {
              const gen = genTriangleNum()
              let triangle
              while (true) {
                triangle = gen.next().value
                if (checkDivisors(triangle) > n) {
                  return triangle
                }
              }
            }