Alex Nikonov nikonov91-dev
nikonov91-dev
/ ts
Created
April 21, 2023 18:00
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| extends, typeof, keyof - https://www.youtube.com/watch?v=L1ONtRnIxcY |
nikonov91-dev
/ Symfony
Last active
May 12, 2023 20:47
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| course: udemy.com/course/symfony-framework-hands-on/ | |
| Plugins (search for them on the Extensions tab): | |
| Auto Close Tags | |
| PHP Intelephense | |
| PHP Namespace Resolver | |
| Rainbow Brackets | |
| Twig | |
| Themes | |
| One Dark Pro |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function translate(speech: string, vocabulary: string[]): string { | |
| const candidates = speech.matchAll(/[\*|\w]+/g); | |
| for (let c of candidates) { | |
| } | |
| const sortedByAsteriskAmmount = [...candidates].sort((p,n) => { | |
| const pAstr = [...p[0].matchAll(/\*/g)].length; | |
| const nAstr = [...n[0].matchAll(/\*/g)].length; | |
| return pAstr === nAstr ? 0 : (pAstr > nAstr ? 1 : -1) | |
| }) |
nikonov91-dev
/ array-movement kata
Last active
May 7, 2022 19:00
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function survivors(movs: number[], pws: number[][]): number[] { | |
| const final:number[] = pws.reduce((acc:number[],n:number[],jj:number):number[] => { | |
| const sum = n.reduce((s,nxt) => s + nxt, movs[jj]); | |
| console.log(sum,jj, n.length-1, movs[jj]) | |
| const checkMovement = (n.length === 0 && sum > 0) || (sum-n.length > 0); | |
| return checkMovement ? [...acc, jj] : acc | |
| }, []) | |
| return final | |
| } |
nikonov91-dev
/ substring. Codewar kudos task
Last active
May 5, 2022 16:41
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // 1 цель: надо собрать перебрать подстроки по макс. | |
| // длине подстроки с неважно каким порядком, главное не алфавитное сортировка | |
| // а максимально подборка неповторимых букв с возможным повторение друг за другом | |
| const ss1 = 'ab'; | |
| const ss2 = 'cba'; | |
| const ss3 = 'ccabb'; | |
| const temp = 'abccbbacaaaba'; | |
| type indexes = { |
nikonov91-dev
/ anagrams. Codewar kudos task
Created
April 5, 2022 17:02
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function funWithAnagrams(text) { | |
| let arr = [text[0]]; | |
| const areTheSameAnagram = (a,b) => | |
| a.split('').sort().join('') === b.split('').sort().join(''); | |
| text.forEach( e => | |
| !arr.find(ee => areTheSameAnagram(e, ee)) && arr.push(e) | |
| ) | |
| return arr.sort() |
nikonov91-dev
/ add index to name. Codewar kudos task
Last active
April 5, 2022 16:35
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function deviceNamesSystem(dn) { | |
| dn.push('kuojoa{-truncated-}'); | |
| dn.push('fmgnwjjsfayewzpxslt1'); | |
| dn.push('mixer'); | |
| dn.push('mixer'); | |
| const updatedDN = []; | |
| let newName = ''; | |
| let countMax = []; | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| необходимо чтобы на сходе давать команду и на выходе после расчета нужно показать позицию и ориентацию. | |
| суть в том что есть газонокосилка ездящая налево\направо\прямо и передвигаться она может ездить туда-сюда без гранично | |
| и вот | |
| const _d = { | |
| r: 'r', | |
| l: 'l' | |
| }; | |
| class Mower { |
nikonov91-dev
/ PS
Last active
October 25, 2020 16:36
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| win mac | |
| Поместить связанные - shift+ctrl+t shift+cmd+d | |
| Слой - смарт-объект - повторно связать слои - f2 | |
| файл - экспорт в png - cmnd+e | |
| edit - flip horizontal - cmd+f |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| (объект) Разъединить - d | |
| (объект) Поместить в контейнер - t | |
| (объект) На уровень вперед - u | |
| (объект) На уровень назад - y | |
| (объект) Редактировать PowerClip - е | |
| (объект) Извлечь содержимое - alt-shift-e | |
| (объект) Удалить фрейм - ctrl-d | |
| (эффекты) Снаружи - a | |
| (панель инструментов) Выбор - v, ctrl+shift+v | |
| (устройства цветовым кругом) Безье - b |
NewerOlder