ЛАЙВКОДІНГ ДЖАВАСКРИПТ | ЗАДАЧІ JAVASCRIPT
🥳 СПІЛЬНОТА АЙТІШНИКІВ 👻
👉 https://t.me/vasin_fr
👽 https://t.me/+iqHJ42ViFPI4ZDg0 НАШ ЧАТ! 😘
Зі мною спілкуватися = / discord 🫦
🤝 ЗА МОЇМ МЕНТОРСТВОМ, ПИШИ СЮДИ:
🔥 / vasin-oleksii
У цьому відео ми розглянемо інтриги та методи вирішення завдань на #CodeWars рівня 6 kyu. Цей рівень передбачає глибоке розуміння програмування та мов програмування, але включає цікаві та цікаві завдання, які допоможуть вам покращити свої навички.
Не пропусти нові випуски! Підписуйся та залишай свій коментар під відео на YouTube, та рекомендуй канал друзям! 📢👍
✨ Timeline:
✔ 0:00 - Привітулі)
✔ 0:39 - АЙТІШНИКИ У ТЕЛЕГРАМ 😸
✔ 0:52 - ТИ НЕ ПІДПИСАН?
✔ 1:18 - Not very secure
In this example you have to validate if a user input string is alphanumeric. The given string is not nil/null/NULL/None, so you don't have to check that.
The string has the following conditions to be alphanumeric:
At least one character ("" is not valid)
Allowed characters are uppercase / lowercase latin letters and digits from 0 to 9
No whitespaces / underscore
✔ 4:00 - Стань програмістом!
✔ 4:45 - Not very secure
✔ 5:15 - Who likes it?
You probably know the "like" system from Facebook and other pages. People can "like" blog posts, pictures or other items. We want to create the text that should be displayed next to such an item.
✔ 11:40 - Simple Pig Latin
Move the first letter of each word to the end of it, then add "ay" to the end of the word. Leave punctuation marks untouched.
✔ 16:55 - Sum of Digits / Digital Root
Digital root is the recursive sum of all the digits in a number.
Given n, take the sum of the digits of n. If that value has more than one digit, continue reducing in this way until a single-digit number is produced. The input will be a non-negative integer.
✔ 21:47 - Find the odd int
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.
[7] should return 7, because it occurs 1 time (which is odd).
[0] should return 0, because it occurs 1 time (which is odd).
[1,1,2] should return 2, because it occurs 1 time (which is odd).
✔ 27:19 - Moving Zeros To The End
Write an algorithm that takes an array and moves all of the zeros to the end, preserving the order of the other elements.
✔ 30:45 - Bit Counting
Write a function that takes an integer as input, and returns the number of bits that are equal to one in the binary representation of that number. You can guarantee that input is non-negative.
Example: The binary representation of 1234 is 10011010010, so the function should return 5 in this case
✔ 34:20 - Multiples of 3 or 5
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
Finish the solution so that it returns the sum of all the multiples of 3 or 5 below the number passed in.
Additionally, if the number is negative, return 0.
Note: If the number is a multiple of both 3 and 5, only count it once.
✔ 37:00 - Став лайк (:
Ось ці задачі будуть в наступному відео (:
Array.diff
Stop gninnipS My sdroW!
Convert string to camel case
Your order, please
✨ Автор курсу:
✔ YouTube: @vasin.fr
✔ Instagram: / vasin.fr
✔ LinkedIn: / vasin-oleksii
✔ GitHub: https://github.com/vasin-fr
✔ Усі соц. мережі: https://linktr.ee/vasin.fr
✨ Підтримати розвиток каналу та стати частиною люксового 💅 клубу: / vasinoleksii