[{"data":1,"prerenderedAt":1148},["ShallowReactive",2],{"$fBtOnZHAGIMn8AF7m6Srb1JKpZ0nU-JW1GvG_n4locdc":3,"$f-KhKwB8J0md5Q3U1oyqNCQbHxVpirjaanlJWCGo_ht4":87,"$fkVWEWXZHbLy86BhC78gDVDJ_00TY4k_DsdZD3Mz6ZO0":90,"$fqGwjmVbyPxmA5lnsLz9nF3m-ncS8WzLIlTsTA85cuZA":95,"$fVMSX_HWVzVkzv-u5ATHiOgClblPaIGZfXUn_Cq8LKn4":441,"$fw0tI3d-iV2W3zZtbRjyPNNRSgXGobrmwsMU7a1fynls":662,"mdc-1ln1n9-key":682,"mdc-3gaw7z-key":727,"mdc--9s4fbd-key":781,"mdc-y5mug4-key":803,"mdc--ez2qx4-key":851,"mdc-m9qktz-key":876,"mdc--ytb9zz-key":939,"mdc--x22dud-key":1140},{"content":4,"livecodingContent":55,"type":77,"pageMeta":78},[5,9,13,16,20,23,27,30,34,38,42,45,49,52],{"id":6,"value":7,"isTypeH1":8},"1995","Сжатие строк",true,{"id":10,"value":11,"anchor":12,"isTypeH2":8},"4641","Теория: что такое RLE","theory-what-is-rle",{"id":14,"value":15,"isTypeParagraph":8},"10699","RLE (run-length encoding) — это подход, при котором строка рассматривается как набор «групп» одинаковых подряд символов.  \nНапример, строка `AAABCC` разбивается на группы `AAA`, `B`, `CC`, и из них формируется запись вроде `A3BC2` (число добавляется только если повторов больше одного).",{"id":17,"value":18,"anchor":19,"isTypeH3":8},"4698","Почему учитываются только подряд идущие повторы","why-only-consecutive-repeats",{"id":21,"value":22,"isTypeParagraph":8},"10700","Повторы считаются только подряд: в строке `ABABA` нет групп длинее 1, поэтому результат остаётся почти таким же.  \nЭто важное свойство задачи: одинаковые символы, разделённые другими символами, относятся к разным группам и не объединяются.",{"id":24,"value":25,"anchor":26,"isTypeH2":8},"4642","Теория: алгоритм по шагам","theory-algorithm-step-by-step",{"id":28,"value":29,"isTypeParagraph":8},"10701","Ниже показана простая «модель» работы алгоритма: берётся текущая позиция, определяется длина группы одинаковых символов, затем группа записывается в ответ.\n\n```\nВход:  A V V V B B B V V X D H J F F F F\nГруппы: A | VVV | BBB | VV | X | D | H | J | FFFF\nВыход:  A   V3    B3    V2   X   D   H   J   F4\n```\n\nПоследовательность действий (общая идея для всех вариантов):\n- Выбирается символ текущей группы.\n- Подсчитывается, сколько раз он повторяется подряд.\n- В результат добавляется буква и (если нужно) число повторов.\n- Переход выполняется к началу следующей группы и процесс повторяется.",{"id":31,"description":32,"titleAlert":33,"isTypeAlertInfo":8},"716","Вариант с двумя указателями (`i` и `j`) удобен тем, что «правый» указатель двигается только вперёд, поэтому вся строка просматривается линейно.",null,{"id":35,"value":36,"anchor":37,"isTypeH2":8},"4643","Практика: проверки, ошибки, сложность","practice-tests-errors-complexity",{"id":39,"value":40,"anchor":41,"isTypeH3":8},"4699","Крайние случаи","edge-cases",{"id":43,"value":44,"isTypeParagraph":8},"10702","- Пустая строка: возвращается пустая строка.\n- Строка без повторов: возвращается исходная строка (например, `ABC` → `ABC`).\n- Строка из одного символа: возвращается этот символ (например, `A` → `A`).\n- Нестрочный аргумент: выбрасывается `TypeError`, чтобы ошибка была явной и понятной.",{"id":46,"value":47,"anchor":48,"isTypeH3":8},"4700","Таблица: как строится результат","table-how-result-built",{"id":50,"value":51,"isTypeParagraph":8},"10703","| Вход | Группы | Выход |\n|---|---|---|\n| `AVBV` | `A` `V` `B` `V` | `AVBV` |\n| `AVBVV` | `A` `V` `B` `VV` | `AVBV2` |\n| `FFFF` | `FFFF` | `F4` |\n| `DDDDDD` | `DDDDDD` | `D6` |\n\n- Сложность по времени: O(n), потому что каждый символ участвует в сравнении ограниченное число раз.  \n- Сложность по памяти: O(n) на результирующую строку, так как в неё накапливается ответ.",{"id":53,"value":54,"isTypeParagraph":8},"10704","Кратко: задача RLE решается линейным проходом по строке с подсчётом длины каждой группы одинаковых подряд символов; в результат добавляется буква и количество повторений только для групп длиной больше 1, а для несовпадающих тестов может применяться режим «всегда добавлять число».",{"id":56,"functionTestData":57,"functionName":73,"functionTemplateCode":74,"solution":75,"description":76},"436",[58,62,66,69],[59,61],[60],"AVVVBBBVVXDHJFFFFDDDDDDHAAAAJJJDDSLSSSDDDD","AV3B3V2XDHJF4D6HA4J3D2SLS3D4",[63,65],[64],"AVBVVXDHJFFDDDDDDHAAAAJJJDDSLSSSD","AVBV2XDHJF2D6HA4J3D2SLS3D",[67,68],[68],"AVBV",[70,72],[71],"AVBVV","AVBV2","rle","function rle(str) {\n    // ваш код здесь\n}","**Вариант 1**: while + два указателя\n\n```\nfunction rle(str) {\n  if (typeof str !== 'string') {\n    throw new TypeError('Argument must be a string');\n  }\n  if (str.length === 0) return '';\n\n  let result = '';\n  let i = 0;\n\n  while (i \u003C str.length) {\n    const ch = str[i];\n    let j = i + 1;\n\n    while (j \u003C str.length && str[j] === ch) {\n      j++;\n    }\n\n    const count = j - i;\n\n    result += ch;\n    if (count > 1) {\n      result += String(count);\n    }\n\n    i = j;\n  }\n\n  return result;\n}\n```\n\n**Вариант 2**: for...of\n\nЭтот вариант хранит «предыдущий символ» и счётчик текущей группы; при смене символа группа записывается в результат.\n\n```\nfunction rle(str) {\n  if (typeof str !== 'string') {\n    throw new TypeError('Argument must be a string');\n  }\n  if (str.length === 0) return '';\n\n  let result = '';\n  let prev = null;\n  let count = 0;\n\n  for (const ch of str) {\n    if (ch === prev) {\n      count++;\n    } else {\n      if (prev !== null) {\n        result += prev;\n        if (count > 1) result += String(count);\n      }\n      prev = ch;\n      count = 1;\n    }\n  }\n\n  result += prev;\n  if (count > 1) result += String(count);\n\n  return result;\n}\n```","Дана строка:\n\n```\n const str = AVVVBBBVVXDHJFFFFDDDDDDHAAAAJJJDDSLSSSDDDD\n```\n\nНеобходимо реализовать функцию, принимающую в аргументах строку, состоящую из букв и вернуть новую строку, в которой повторяющиеся буквы заменены количеством повторений.\n\nПримеры: \n\n```\nrle('AVVVBBBVVXDHJFFFFDDDDDDHAAAAJJJDDSLSSSDDDD'); // => 'AV3B3V2XDHJF4D6HA4J3D2SLS3D4';\nrle('AVBVVXDHJFFDDDDDDHAAAAJJJDDSLSSSD'); // => 'AV1B1V2XDHJF2D6HA4J3D2SLS3D1';\nrle('AVBV'); // => 'AVBV';\nrle('AVBVV'); // => 'AVBV2';\n```","livecoding",{"title":7,"description":79,"ogTitle":7,"ogDescription":79,"ogImageUrl":80,"canonical":33,"ogLocale":81,"ogSiteName":82,"ogImageType":83,"ogImageWidth":84,"ogImageHeight":85,"ogType":86,"ogUrl":33},"Реализовать функцию, принимающую строку, состоящую из букв и вернуть строку, в которой повторяющиеся буквы заменены количеством повторений","/og-image.png","ru_RU","goodwebjob.ru","image_jpeg","1200","630","article",{"siteName":88,"siteUrl":89},"GOOD WEB JOB!","https://goodwebjob.ru",[91],{"label":92,"slug":93,"to":94},"Подготовка к тех.интервью","technical-interview","/technical-interview/where-to-begin",{"navigationList":96,"navigationSublist":105},[97,101],{"path":94,"isActive":98,"name":99,"icon":100,"isNavbarMobileDisabled":8},false,"С чего начать?","material-symbols:visibility-outline-rounded",{"path":102,"isActive":8,"name":103,"icon":104,"isNavbarMobileDisabled":98},"/technical-interview/tasks","Сборник задач","material-symbols:task-outline",[106,115,142,154,160,300,324,333,339,402,423,429],{"title":107,"list":108,"isOpened":98},"Bash",[109,112],{"name":110,"path":111,"isActive":98},"Дан фрагмент bash-скрипта: cd ~; mkdir foo... Что в нем происходит?","/technical-interview/tasks/here-is-a-fragment-of-a-bash-script-cd-mkdir-foo-what-is-happening-in-this-script",{"name":113,"path":114,"isActive":98},"Дан фрагмент bash-скрипта: target=$(ps -Af | grep $1 | head -n 1)...","/technical-interview/tasks/here-is-a-fragment-of-a-bash-script-target-ps-af-grep-1-head-n-1",{"title":116,"list":117,"isOpened":98},"CSS",[118,121,124,127,130,133,136,139],{"name":119,"path":120,"isActive":98},"Дан HTML-код. Какой будет цвет у текста «Some dummy text»?","/technical-interview/tasks/the-html-code-is-given-what-will-be-the-color-of-the-some-dummy-text",{"name":122,"path":123,"isActive":98},"Есть шаблон HTML и CSS кода. Какой будет цвет у текста «Таким образом, постоянное»?","/technical-interview/tasks/there-is-a-template-for-html-and-css-code-what-color-will-the-text-thus-constant-have",{"name":125,"path":126,"isActive":98},"Есть шаблон вложенного HTML кода. Какой будет цвет у текста «One more dummy text»?","/technical-interview/tasks/there-is-a-template-for-embedded-html-code-what-will-be-the-color-of-the-one-more-dummy-text",{"name":128,"path":129,"isActive":98},"Есть шаблон вложенного HTML кода. Будет ли display:block у body влиять на span?","/technical-interview/tasks/there-is-a-template-for-embedded-html-code-will-there-be-a-display-does-bodys-block-affect-span",{"name":131,"path":132,"isActive":98},"Есть HTML код. Будет ли font-weight на span влиять?","/technical-interview/tasks/there-is-an-html-code-will-font-weight-affect-span",{"name":134,"path":135,"isActive":98},"Flexbox и Grid, чем отличаются друг от друга?","/technical-interview/tasks/what-are-the-differences-between-flexbox-and-grid",{"name":137,"path":138,"isActive":98},"Заменяют ли Flexbox и Grid друг друга?","/technical-interview/tasks/do-flexbox-and-grid-replace-each-other",{"name":140,"path":141,"isActive":98},"Есть CSS и JS анимация. Какая между ними разница, что быстрее, что более удобно?","/technical-interview/tasks/there-are-css-and-js-animations-what-is-the-difference-between-them-and-which-is-faster-and-more-convenient",{"title":143,"list":144,"isOpened":98},"Git",[145,148,151],{"name":146,"path":147,"isActive":98},"Разрабатывал, взял закоммитил, запушил. Оказалось, что запушил не в ту ветку, точнее, коммит не в ту ветку. Какие действия?","/technical-interview/tasks/developed-it-committed-it-and-launched-it-it-turned-out-that-i-had-pushed-it-to-the-wrong-branch-or-rather-the-commit-was-in-the-wrong-branch-what-actions",{"name":149,"path":150,"isActive":98},"В git есть несколько вариантов слияния веток, какие? Чем отличаются?","/technical-interview/tasks/git-has-several-options-for-merging-branches-which-ones-how-are-they-different",{"name":152,"path":153,"isActive":98},"Какие существуют стратегии ветвления для работы команды? Что это такое?","/technical-interview/tasks/what-are-the-branching-strategies-for-the-team-what-is-it",{"title":155,"list":156,"isOpened":98},"HTML",[157],{"name":158,"path":159,"isActive":98},"Что такое HTML?","/technical-interview/tasks/what-is-html",{"title":161,"list":162,"isOpened":98},"JavaScript",[163,166,169,172,175,178,181,184,187,190,193,196,199,202,205,208,211,214,217,220,223,226,229,232,235,238,241,244,247,250,253,256,259,262,265,268,271,274,277,280,283,286,289,292,294,297],{"name":164,"path":165,"isActive":98},"Какие логические значения в console.log будут получены?","/technical-interview/tasks/prototype-what-logical-values-will-be-received-in-console-log",{"name":167,"path":168,"isActive":98},"Почему опасно писать прямо в прототипы базовых типов?","/technical-interview/tasks/why-is-it-dangerous-to-write-directly-to-the-prototypes-of-basic-types",{"name":170,"path":171,"isActive":98},"Что вернёт следующий код? Object.create(null).hasOwnProperty('toString')","/technical-interview/tasks/what-will-the-following-code-return-object-create-null-has-own-property-to-string",{"name":173,"path":174,"isActive":98},"Какое значение выведет консоль с object.property?","/technical-interview/tasks/what-value-will-the-console-output-with-object-property",{"name":176,"path":177,"isActive":98},"Что выведется в console.log([arr[0](), arr[0]()])?","/technical-interview/tasks/what-will-be-displayed-in-console-log-arr-0-arr-0",{"name":179,"path":180,"isActive":98},"Что выведет console.log в результате выполнения цикла while?","/technical-interview/tasks/what-will-console-log-output-as-a-result-of-executing-the-while-loop",{"name":182,"path":183,"isActive":98},"Есть функция и объект. Напишите все известные вам способы, чтобы вывести в консоли значение x из объекта, используя функцию","/technical-interview/tasks/there-is-a-function-and-an-object-write-all-the-ways-you-know-to-output-the-value-of-x-from-an-object-in-the-console-using-the-function",{"name":185,"path":186,"isActive":98},"Что вернёт метод book.getUpperName()?","/technical-interview/tasks/what-will-the-book-get-upper-name-method-return",{"name":188,"path":189,"isActive":98},"Переменные объявлены следующим образом: a=3; b=«hello»;. Укажите правильное утверждение","/technical-interview/tasks/variables-are-declared-as-follows-specify-the-correct-statement",{"name":191,"path":192,"isActive":98},"Что выведет консоль в случае присвоения свойства массиву по строковому положительному индексу?","/technical-interview/tasks/what-will-the-console-display-if-a-property-is-assigned-to-an-array-using-a-positive-string-index",{"name":194,"path":195,"isActive":98},"Что выведет консоль в случае присвоения свойства массиву по строковому отрицательному индексу?","/technical-interview/tasks/what-will-the-console-display-if-a-property-is-assigned-to-an-array-using-a-negative-string-index",{"name":197,"path":198,"isActive":98},"Что выведет консоль в случае удаления элемента массива с помощью оператора delete?","/technical-interview/tasks/what-will-the-console-output-if-an-array-element-is-deleted-using-the-delete-operator",{"name":200,"path":201,"isActive":98},"Что вернёт этот код: typeof (function(){})()","/technical-interview/tasks/what-this-code-will-return-typeof-function",{"name":203,"path":204,"isActive":98},"Что получится в результате передачи объекта как аргумента в функцию и выполнения кода?","/technical-interview/tasks/what-will-happen-when-an-object-is-passed-as-an-argument-to-a-function-and-the-code-is-executed",{"name":206,"path":207,"isActive":98},"Какие способы объявления функции есть в JavaScript?","/technical-interview/tasks/what-are-the-ways-to-declare-a-function-in-javascript",{"name":209,"path":210,"isActive":98},"Что такое this в JavaScript?","/technical-interview/tasks/what-is-this-in-javascript",{"name":212,"path":213,"isActive":98},"Что такое Event Loop, как работает?","/technical-interview/tasks/what-is-an-event-loop-and-how-does-it-work",{"name":215,"path":216,"isActive":98},"Что будет, если вызвать typeof на необъявленной переменной?","/technical-interview/tasks/what-happens-if-you-call-typeof-on-an-undeclared-variable",{"name":218,"path":219,"isActive":98},"Что показывает оператор typeof в JavaScript?","/technical-interview/tasks/what-does-the-typeof-operator-show-in-javascript",{"name":221,"path":222,"isActive":98},"Какие типы данных существует в JavaScript?","/technical-interview/tasks/what-types-of-data-exist-in-javascript",{"name":224,"path":225,"isActive":98},"Какую структуру использовать для хранения упорядоченного списка строк в JavaScript?","/technical-interview/tasks/what-is-the-best-structure-to-use-for-storing-an-ordered-list-of-strings-in-javascript",{"name":227,"path":228,"isActive":98},"Что вернет typeof для массива?","/technical-interview/tasks/what-will-typeof-return-for-an-array",{"name":230,"path":231,"isActive":98},"Почему оператор typeof, применённый к массиву, возвращает объект?","/technical-interview/tasks/why-does-the-typeof-operator-applied-to-an-array-return-an-object",{"name":233,"path":234,"isActive":98},"Если нужно хранить список уникальных строк, какую структуру данных выбрать?","/technical-interview/tasks/if-you-need-to-store-a-list-of-unique-strings-which-data-structure-should-i-choose",{"name":236,"path":237,"isActive":98},"Что возвращает typeof для new Set в JavaScript?","/technical-interview/tasks/what-does-typeof-return-for-new-set-in-javascript",{"name":239,"path":240,"isActive":98},"Почему в JavaScript два объекта с одинаковым содержимым при сравнении возвращают false?","/technical-interview/tasks/why-do-two-objects-with-the-same-content-return-false-when-compared-in-javascript",{"name":242,"path":243,"isActive":98},"В чем разница между микро- и макро-тасками в JavaScript?","/technical-interview/tasks/what-is-the-difference-between-micro-and-macro-tasks-in-javascript",{"name":245,"path":246,"isActive":98},"arr.push(0) повлияет на массив так же, как если бы мы выполнили...","/technical-interview/tasks/arr-push-0-will-affect-the-array-in-the-same-way-as-if-we-performed",{"name":248,"path":249,"isActive":98},"Вернуть массив от 1 до n, где числа, кратные 3, заменены на 'fizz', кратные 5 - на 'buzz', а кратные и 3, и 5 одновременно - на 'fizzbuzz'","/technical-interview/tasks/returns-an-array-from-1-to-n-replacing-numbers-that-are-multiples-of-3-with-fizz-numbers-that-are-multiples-of-5-with-buzz-and-numbers-that-are-multiples-of-both-3-and-5-with-fizzbuzz",{"name":251,"path":252,"isActive":98},"Дана строка: 'one.two.three.four.five'. Необходимо из строки сделать вложенный объект","/technical-interview/tasks/the-string-one-two-three-four-five-is-given-it-is-necessary-to-make-a-nested-object-out-of-the-string",{"name":254,"path":255,"isActive":98},"Дано дерево (вложенный объект), надо найти сумму всех вершин","/technical-interview/tasks/given-a-tree-nested-object-it-is-necessary-to-find-the-sum-of-all-vertices",{"name":257,"path":258,"isActive":98},"Для каждого вложенного объекта нужно добавить свойство level, которое равняется числу - номер вложенности","/technical-interview/tasks/for-each-nested-object-you-need-to-add-the-level-property-which-is-equal-to-a-number-the-nesting-number",{"name":260,"path":261,"isActive":98},"Для каждой ветви дерева записать номер вложенности данной ветви","/technical-interview/tasks/for-each-branch-of-the-tree-write-down-the-nesting-number-of-this-branch",{"name":263,"path":264,"isActive":98},"Есть массив, в котором лежат объекты с датами, необходимо отсортировать даты по возрастанию","/technical-interview/tasks/there-is-an-array-containing-objects-with-dates-that-need-to-be-sorted-by-date",{"name":266,"path":267,"isActive":98},"Есть слова в массиве, необходимо определить, состоят ли они из одних и тех же букв","/technical-interview/tasks/there-are-words-in-the-array-it-is-necessary-to-determine-whether-they-consist-of-the-same-letters",{"name":269,"path":270,"isActive":98},"Есть строка, состоящая из разных скобок, необходимо проверить, закрыты ли все","/technical-interview/tasks/there-is-a-string-consisting-of-different-brackets-it-is-necessary-to-check-whether-all-are-closed",{"name":272,"path":273,"isActive":98}," Найти в массиве неповторяющиеся числа","/technical-interview/tasks/find-non-repeating-numbers-in-an-array",{"name":275,"path":276,"isActive":98},"Напишите функцию, который сделает из массива объект","/technical-interview/tasks/write-a-function-that-will-make-an-object-out-of-an-array",{"name":278,"path":279,"isActive":98},"Необходимо проверить, являются ли две строки анаграммами друг друга","/technical-interview/tasks/checks-whether-two-strings-are-anagrams-of-each-other",{"name":281,"path":282,"isActive":98},"Нечётные числа должны отсортироваться по возрастанию, а чётные должны остаться на своих местах","/technical-interview/tasks/odd-numbers-should-be-sorted-in-ascending-order-and-even-numbers-should-remain-in-their-original-positions",{"name":284,"path":285,"isActive":98},"Определить, является ли слово палиндромом","/technical-interview/tasks/determines-whether-a-word-is-a-palindrome",{"name":287,"path":288,"isActive":98},"«Расплющивание» массива","/technical-interview/tasks/flattening-the-array",{"name":290,"path":291,"isActive":98},"Реализовать функцию, принимающую аргументы \"*\", \"1\", \"b\", \"1c\" и возвращающую строку \"1*b*1c\"","/technical-interview/tasks/implement-a-function-that-accepts-arguments-1-b-1c-and-the-return-string-1-b-1c",{"name":7,"path":293,"isActive":98},"/technical-interview/tasks/string-compression",{"name":295,"path":296,"isActive":98},"Уникализация значений в массиве","/technical-interview/tasks/unifying-values-in-an-array",{"name":298,"path":299,"isActive":98},"Числа от 1 до 100 находятся в массиве, они хаотично перемешанные, но в нём не хватает одного числа из этой последовательности. Необходимо найти его","/technical-interview/tasks/the-numbers-from-1-to-100-are-in-the-array-they-are-randomly-mixed-but-it-lacks-one-number-from-this-sequence-it-is-necessary-to-find-him",{"title":301,"list":302,"isOpened":98},"React",[303,306,309,312,315,318,321],{"name":304,"path":305,"isActive":98},"Для чего нужен React, какие он решает проблемы?","/technical-interview/tasks/what-is-react-used-for-and-what-problems-does-it-solve",{"name":307,"path":308,"isActive":98},"Какой механизм лежит в основе оптимизации обновлений DOM в React?","/technical-interview/tasks/what-is-the-underlying-mechanism-for-optimizing-dom-updates-in-react",{"name":310,"path":311,"isActive":98},"Если убрать в React VDOM/Fiber, и вручную изменять DOM, разве это не оптимально?","/technical-interview/tasks/if-you-remove-the-vdom-fiber-in-react-and-manually-change-the-dom-isn-t-that-optimal",{"name":313,"path":314,"isActive":98},"Есть блок кода. Что в реальном DOM изменится после нажатия на кнопку?","/technical-interview/tasks/there-is-a-block-of-code-what-changes-in-the-real-dom-after-clicking-the-button",{"name":316,"path":317,"isActive":98},"Есть код, в котором список и кнопка. Что в реальном DOM изменится после нажатия на кнопку?","/technical-interview/tasks/there-is-a-code-in-which-there-is-a-list-and-a-button-what-will-change-in-the-real-dom-after-clicking-on-the-button",{"name":319,"path":320,"isActive":98},"Зачем нужен Redux (Mobx/Effector)? Зачем нужен менеджер состояния? Какие проблемы решает?","/technical-interview/tasks/why-do-we-need-redux-mobx-effector-why-do-we-need-a-state-manager-what-problems-does-it-solve",{"name":322,"path":323,"isActive":98},"Что мешает организовать централизованное состояние без менеджера состояния? Если организовать состояние механизмами реакта: контекстом, стейтом, в чем проблема? Что менеджеры состояния привносят?","/technical-interview/tasks/what-prevents-you-from-organizing-a-centralized-state-without-a-state-manager-if-you-organize-the-state-using-react-context-and-state-mechanisms-what-is-the-problem-what-do-state-managers-add",{"title":325,"list":326,"isOpened":98},"Алгоритмы",[327,330],{"name":328,"path":329,"isActive":98},"Что такое алгоритмическая сложность?","/technical-interview/tasks/what-is-algorithmic-complexity",{"name":331,"path":332,"isActive":98},"Какая алгоритмическая сложность у \"быстрой сортировки\"?","/technical-interview/tasks/what-is-the-algorithmic-complexity-of-quick-sort",{"title":334,"list":335,"isOpened":98},"Дебаггинг",[336],{"name":337,"path":338,"isActive":98},"Как диагностировать и исправить нежелательное изменение цвета фона по клику на кнопку, если исходный код сайта запутан и недоступен для прямого чтения?","/technical-interview/tasks/how-can-diagnose-and-fix-unwanted-background-color-changes-when-clicking-on-a-button-if-the-source-code-of-the-site-is-confusing-and-inaccessible-to-direct-reading",{"title":340,"list":341,"isOpened":98},"Компьютерные сети",[342,345,348,351,354,357,360,363,366,369,372,375,378,381,384,387,390,393,396,399],{"name":343,"path":344,"isActive":98},"Как браузер после ввода домена понимает, откуда брать сайт?","/technical-interview/tasks/how-does-the-browser-know-where-to-get-the-website-after-entering-the-domain",{"name":346,"path":347,"isActive":98},"Что такое DNS, как DNS находит нужный IP-адрес?","/technical-interview/tasks/what-is-dns-and-how-does-dns-find-the-correct-ip-address",{"name":349,"path":350,"isActive":98},"Как домен попадает в DNS в таблицу соответствия: домен – ip","/technical-interview/tasks/how-does-a-domain-get-into-the-dns-mapping-table-domain-ip",{"name":352,"path":353,"isActive":98},"Как браузер решает, какое соединение ему открывать, TCP или UDP?","/technical-interview/tasks/how-does-a-browser-decide-whether-to-open-a-tcp-or-udp-connection",{"name":355,"path":356,"isActive":98},"Ключевые отличия TCP и UDP","/technical-interview/tasks/key-differences-between-tcp-and-udp",{"name":358,"path":359,"isActive":98},"\"TCP/IP\" - кем является TCP, а кем IP в данном случае?","/technical-interview/tasks/tcp-ip-who-is-tcp-and-who-is-ip-in-this-case",{"name":361,"path":362,"isActive":98},"Что такое HTTP и из чего состоит?","/technical-interview/tasks/what-is-http-and-what-does-it-consist-of",{"name":364,"path":365,"isActive":98},"Что такое заголовки в HTTP и зачем они нужны?","/technical-interview/tasks/what-are-http-headers-and-why-do-we-need-them",{"name":367,"path":368,"isActive":98},"Что такое параметры в HTTP?","/technical-interview/tasks/what-are-http-parameters",{"name":370,"path":371,"isActive":98},"Где находится HTML-код в структуре HTTP-ответа?","/technical-interview/tasks/where-is-the-html-code-located-in-the-http-response-structure",{"name":373,"path":374,"isActive":98},"Чем отличаются 1.0, 1.1, 2.0, 3.0 версии HTTP?","/technical-interview/tasks/what-are-the-differences-between-http-versions-1-0-1-1-2-0-and-3-0",{"name":376,"path":377,"isActive":98},"Пользователь авторизован на сайте. Как сервер узнает об этом с последующими другими заходами, что «я – авторизованный пользователь»?","/technical-interview/tasks/the-user-is-logged-in-on-the-website-how-does-the-server-know-that-i-am-an-authorized-user-when-the-user-logs-in-again",{"name":379,"path":380,"isActive":98},"Что такое cookie?","/technical-interview/tasks/what-is-a-cookie",{"name":382,"path":383,"isActive":98},"Кто является инициатором записи cookie в браузере?","/technical-interview/tasks/who-initiates-the-cookie-recording-in-the-browser",{"name":385,"path":386,"isActive":98},"Есть ли возможность с клиента (с браузера) управлять cookie?","/technical-interview/tasks/is-it-possible-to-manage-cookies-from-the-client-browser",{"name":388,"path":389,"isActive":98},"Верно ли утверждение, что злоумышленник, контролирующий роутер и прослушивающий трафик, может получить логины и пароли от сайтов, на которые заходит клиент?","/technical-interview/tasks/is-it-true-that-an-attacker-who-controls-a-router-and-listens-to-traffic-can-obtain-logins-and-passwords-from-websites-that-a-client-visits",{"name":391,"path":392,"isActive":98},"Всё, что идет по HTTPS – оно защищено?","/technical-interview/tasks/is-everything-that-goes-through-https-secure",{"name":394,"path":395,"isActive":98},"Все данные зашифрованы, используется https. Хакер взламывает dns и делает подмену одного ip на другой, на фишинговый сайт. В этом случае, злоумышленник может получить данные (логин \\ пароль)?","/technical-interview/tasks/all-data-is-encrypted-https-is-used-let-s-assume-a-hacker-hacks-the-dns-and-makes-a-substitution-of-one-ip-for-another-a-phishing-site",{"name":397,"path":398,"isActive":98},"Есть веб-приложение. Помимо HTTP, какие протоколы того же уровня (Application Layer) можно дополнительно использовать в веб-приложении в браузере?","/technical-interview/tasks/there-is-a-web-application-in-addition-to-http-what-other-protocols-of-the-same-level-application-layer-can-be-used-in-the-web-application-in-browser",{"name":400,"path":401,"isActive":98},"Каким способом может выполняться авторизация пользователя на сайте?","/technical-interview/tasks/how-can-a-user-be-authorized-on-a-website",{"title":403,"list":404,"isOpened":98},"Отрисовка в браузере",[405,408,411,414,417,420],{"name":406,"path":407,"isActive":98},"Что происходит, когда HTTP прислал HTML? Что браузер дальше делает c HTML с учетом того, что она валидная?","/technical-interview/tasks/what-happens-when-http-sends-html-what-does-the-browser-do-with-this-html-given-that-it-is-valid",{"name":409,"path":410,"isActive":98},"Как браузер парсит JavaScript и изображения при рендеринге?","/technical-interview/tasks/how-the-browser-parses-javascript-and-images-when-rendering",{"name":412,"path":413,"isActive":98},"Что в браузере блокирует рендеринг страницы?","/technical-interview/tasks/what-is-blocking-the-page-rendering-in-the-browser",{"name":415,"path":416,"isActive":98},"Что такое DOM в браузере? Что такое CSSOM?","/technical-interview/tasks/what-is-dom-in-a-browser-what-is-cssom",{"name":418,"path":419,"isActive":98},"Что является узлами в DOM?","/technical-interview/tasks/what-are-nodes-in-the-dom",{"name":421,"path":422,"isActive":98},"Из чего состоит CSSOM?","/technical-interview/tasks/what-does-cssom-consist-of",{"title":424,"list":425,"isOpened":98},"Ревью кода",[426],{"name":427,"path":428,"isActive":98},"По каким характеристикам, ревьюер понимает, что данный код - хороший, а этот код - плохой?","/technical-interview/tasks/how-does-a-reviewer-know-which-code-is-good-and-which-code-is-bad",{"title":430,"list":431,"isOpened":98},"Теория вероятности",[432,435,438],{"name":433,"path":434,"isActive":98},"В комнате три человека. Какова вероятность того, что хотя бы двое из них одного пола? То есть два и более.","/technical-interview/tasks/there-are-three-people-in-the-room-what-is-the-probability-that-at-least-two-of-them-are-of-the-same-sex-that-is-two-or-more",{"name":436,"path":437,"isActive":98},"Есть монета. Ее подбрасывают пять раз подряд. Каждый раз записывается, что выпало - орел или решка. Сколько разных последовательностей орлов и решек может при этом получиться?","/technical-interview/tasks/there-is-a-coin-it-is-tossed-five-times-in-a-row-each-time-it-is-recorded-whether-it-lands-on-heads-or-tails-how-many-different-sequences-of-heads-and-tails-can-be-obtained",{"name":439,"path":440,"isActive":98},"Как гарантированно найти лёгкую фальшивую монету среди 8 за минимальное число взвешиваний на чашечных весах?","/technical-interview/tasks/how-can-you-guarantee-to-find-an-easy-fake-coin-among-8-in-the-minimum-number-of-weighings-on-a-balance-scale",{"slugs":442},[443,446,448,450,452,455,458,460,462,464,466,468,471,473,475,477,479,481,483,485,487,489,491,493,495,497,499,501,503,505,507,509,511,513,515,517,519,521,523,525,527,529,531,533,535,537,539,541,543,545,547,549,551,553,555,557,559,561,563,565,567,569,571,573,575,577,579,581,583,585,587,589,591,593,595,597,599,601,603,605,607,609,611,613,615,617,619,621,623,625,627,629,631,633,635,637,639,641,643,645,647,649,651,652,654,656,658,660],{"name":444,"value":445},"Теоретические задания","theoretical-tasks",{"name":200,"value":447},"what-this-code-will-return-typeof-function",{"name":99,"value":449},"where-to-begin",{"name":167,"value":451},"why-is-it-dangerous-to-write-directly-to-the-prototypes-of-basic-types",{"name":453,"value":454},"Backend","backend",{"name":456,"value":457},"Frontend","frontend",{"name":164,"value":459},"prototype-what-logical-values-will-be-received-in-console-log",{"name":281,"value":461},"odd-numbers-should-be-sorted-in-ascending-order-and-even-numbers-should-remain-in-their-original-positions",{"name":272,"value":463},"find-non-repeating-numbers-in-an-array",{"name":245,"value":465},"arr-push-0-will-affect-the-array-in-the-same-way-as-if-we-performed",{"name":251,"value":467},"the-string-one-two-three-four-five-is-given-it-is-necessary-to-make-a-nested-object-out-of-the-string",{"name":469,"value":470},"Реализовать функцию, похоже как в Jquery","implement-a-function-similar-to-jquery",{"name":257,"value":472},"for-each-nested-object-you-need-to-add-the-level-property-which-is-equal-to-a-number-the-nesting-number",{"name":173,"value":474},"what-value-will-the-console-output-with-object-property",{"name":176,"value":476},"what-will-be-displayed-in-console-log-arr-0-arr-0",{"name":248,"value":478},"returns-an-array-from-1-to-n-replacing-numbers-that-are-multiples-of-3-with-fizz-numbers-that-are-multiples-of-5-with-buzz-and-numbers-that-are-multiples-of-both-3-and-5-with-fizzbuzz",{"name":278,"value":480},"checks-whether-two-strings-are-anagrams-of-each-other",{"name":284,"value":482},"determines-whether-a-word-is-a-palindrome",{"name":263,"value":484},"there-is-an-array-containing-objects-with-dates-that-need-to-be-sorted-by-date",{"name":290,"value":486},"implement-a-function-that-accepts-arguments-1-b-1c-and-the-return-string-1-b-1c",{"name":254,"value":488},"given-a-tree-nested-object-it-is-necessary-to-find-the-sum-of-all-vertices",{"name":260,"value":490},"for-each-branch-of-the-tree-write-down-the-nesting-number-of-this-branch",{"name":266,"value":492},"there-are-words-in-the-array-it-is-necessary-to-determine-whether-they-consist-of-the-same-letters",{"name":298,"value":494},"the-numbers-from-1-to-100-are-in-the-array-they-are-randomly-mixed-but-it-lacks-one-number-from-this-sequence-it-is-necessary-to-find-him",{"name":269,"value":496},"there-is-a-string-consisting-of-different-brackets-it-is-necessary-to-check-whether-all-are-closed",{"name":275,"value":498},"write-a-function-that-will-make-an-object-out-of-an-array",{"name":179,"value":500},"what-will-console-log-output-as-a-result-of-executing-the-while-loop",{"name":182,"value":502},"there-is-a-function-and-an-object-write-all-the-ways-you-know-to-output-the-value-of-x-from-an-object-in-the-console-using-the-function",{"name":194,"value":504},"what-will-the-console-display-if-a-property-is-assigned-to-an-array-using-a-negative-string-index",{"name":197,"value":506},"what-will-the-console-output-if-an-array-element-is-deleted-using-the-delete-operator",{"name":295,"value":508},"unifying-values-in-an-array",{"name":287,"value":510},"flattening-the-array",{"name":185,"value":512},"what-will-the-book-get-upper-name-method-return",{"name":7,"value":514},"string-compression",{"name":191,"value":516},"what-will-the-console-display-if-a-property-is-assigned-to-an-array-using-a-positive-string-index",{"name":203,"value":518},"what-will-happen-when-an-object-is-passed-as-an-argument-to-a-function-and-the-code-is-executed",{"name":343,"value":520},"how-does-the-browser-know-where-to-get-the-website-after-entering-the-domain",{"name":349,"value":522},"how-does-a-domain-get-into-the-dns-mapping-table-domain-ip",{"name":352,"value":524},"how-does-a-browser-decide-whether-to-open-a-tcp-or-udp-connection",{"name":355,"value":526},"key-differences-between-tcp-and-udp",{"name":358,"value":528},"tcp-ip-who-is-tcp-and-who-is-ip-in-this-case",{"name":361,"value":530},"what-is-http-and-what-does-it-consist-of",{"name":364,"value":532},"what-are-http-headers-and-why-do-we-need-them",{"name":367,"value":534},"what-are-http-parameters",{"name":370,"value":536},"where-is-the-html-code-located-in-the-http-response-structure",{"name":158,"value":538},"what-is-html",{"name":373,"value":540},"what-are-the-differences-between-http-versions-1-0-1-1-2-0-and-3-0",{"name":376,"value":542},"the-user-is-logged-in-on-the-website-how-does-the-server-know-that-i-am-an-authorized-user-when-the-user-logs-in-again",{"name":379,"value":544},"what-is-a-cookie",{"name":382,"value":546},"who-initiates-the-cookie-recording-in-the-browser",{"name":385,"value":548},"is-it-possible-to-manage-cookies-from-the-client-browser",{"name":550,"value":77},"Лайвкодинг",{"name":170,"value":552},"what-will-the-following-code-return-object-create-null-has-own-property-to-string",{"name":391,"value":554},"is-everything-that-goes-through-https-secure",{"name":394,"value":556},"all-data-is-encrypted-https-is-used-let-s-assume-a-hacker-hacks-the-dns-and-makes-a-substitution-of-one-ip-for-another-a-phishing-site",{"name":397,"value":558},"there-is-a-web-application-in-addition-to-http-what-other-protocols-of-the-same-level-application-layer-can-be-used-in-the-web-application-in-browser",{"name":409,"value":560},"how-the-browser-parses-javascript-and-images-when-rendering",{"name":406,"value":562},"what-happens-when-http-sends-html-what-does-the-browser-do-with-this-html-given-that-it-is-valid",{"name":412,"value":564},"what-is-blocking-the-page-rendering-in-the-browser",{"name":415,"value":566},"what-is-dom-in-a-browser-what-is-cssom",{"name":418,"value":568},"what-are-nodes-in-the-dom",{"name":421,"value":570},"what-does-cssom-consist-of",{"name":119,"value":572},"the-html-code-is-given-what-will-be-the-color-of-the-some-dummy-text",{"name":122,"value":574},"there-is-a-template-for-html-and-css-code-what-color-will-the-text-thus-constant-have",{"name":125,"value":576},"there-is-a-template-for-embedded-html-code-what-will-be-the-color-of-the-one-more-dummy-text",{"name":128,"value":578},"there-is-a-template-for-embedded-html-code-will-there-be-a-display-does-bodys-block-affect-span",{"name":131,"value":580},"there-is-an-html-code-will-font-weight-affect-span",{"name":134,"value":582},"what-are-the-differences-between-flexbox-and-grid",{"name":137,"value":584},"do-flexbox-and-grid-replace-each-other",{"name":140,"value":586},"there-are-css-and-js-animations-what-is-the-difference-between-them-and-which-is-faster-and-more-convenient",{"name":103,"value":588},"tasks",{"name":206,"value":590},"what-are-the-ways-to-declare-a-function-in-javascript",{"name":209,"value":592},"what-is-this-in-javascript",{"name":212,"value":594},"what-is-an-event-loop-and-how-does-it-work",{"name":215,"value":596},"what-happens-if-you-call-typeof-on-an-undeclared-variable",{"name":218,"value":598},"what-does-the-typeof-operator-show-in-javascript",{"name":221,"value":600},"what-types-of-data-exist-in-javascript",{"name":224,"value":602},"what-is-the-best-structure-to-use-for-storing-an-ordered-list-of-strings-in-javascript",{"name":227,"value":604},"what-will-typeof-return-for-an-array",{"name":230,"value":606},"why-does-the-typeof-operator-applied-to-an-array-return-an-object",{"name":233,"value":608},"if-you-need-to-store-a-list-of-unique-strings-which-data-structure-should-i-choose",{"name":236,"value":610},"what-does-typeof-return-for-new-set-in-javascript",{"name":304,"value":612},"what-is-react-used-for-and-what-problems-does-it-solve",{"name":310,"value":614},"if-you-remove-the-vdom-fiber-in-react-and-manually-change-the-dom-isn-t-that-optimal",{"name":313,"value":616},"there-is-a-block-of-code-what-changes-in-the-real-dom-after-clicking-the-button",{"name":316,"value":618},"there-is-a-code-in-which-there-is-a-list-and-a-button-what-will-change-in-the-real-dom-after-clicking-on-the-button",{"name":319,"value":620},"why-do-we-need-redux-mobx-effector-why-do-we-need-a-state-manager-what-problems-does-it-solve",{"name":337,"value":622},"how-can-diagnose-and-fix-unwanted-background-color-changes-when-clicking-on-a-button-if-the-source-code-of-the-site-is-confusing-and-inaccessible-to-direct-reading",{"name":146,"value":624},"developed-it-committed-it-and-launched-it-it-turned-out-that-i-had-pushed-it-to-the-wrong-branch-or-rather-the-commit-was-in-the-wrong-branch-what-actions",{"name":149,"value":626},"git-has-several-options-for-merging-branches-which-ones-how-are-they-different",{"name":152,"value":628},"what-are-the-branching-strategies-for-the-team-what-is-it",{"name":427,"value":630},"how-does-a-reviewer-know-which-code-is-good-and-which-code-is-bad",{"name":110,"value":632},"here-is-a-fragment-of-a-bash-script-cd-mkdir-foo-what-is-happening-in-this-script",{"name":113,"value":634},"here-is-a-fragment-of-a-bash-script-target-ps-af-grep-1-head-n-1",{"name":328,"value":636},"what-is-algorithmic-complexity",{"name":331,"value":638},"what-is-the-algorithmic-complexity-of-quick-sort",{"name":239,"value":640},"why-do-two-objects-with-the-same-content-return-false-when-compared-in-javascript",{"name":400,"value":642},"how-can-a-user-be-authorized-on-a-website",{"name":242,"value":644},"what-is-the-difference-between-micro-and-macro-tasks-in-javascript",{"name":433,"value":646},"there-are-three-people-in-the-room-what-is-the-probability-that-at-least-two-of-them-are-of-the-same-sex-that-is-two-or-more",{"name":436,"value":648},"there-is-a-coin-it-is-tossed-five-times-in-a-row-each-time-it-is-recorded-whether-it-lands-on-heads-or-tails-how-many-different-sequences-of-heads-and-tails-can-be-obtained",{"name":439,"value":650},"how-can-you-guarantee-to-find-an-easy-fake-coin-among-8-in-the-minimum-number-of-weighings-on-a-balance-scale",{"name":92,"value":93},{"name":388,"value":653},"is-it-true-that-an-attacker-who-controls-a-router-and-listens-to-traffic-can-obtain-logins-and-passwords-from-websites-that-a-client-visits",{"name":346,"value":655},"what-is-dns-and-how-does-dns-find-the-correct-ip-address",{"name":188,"value":657},"variables-are-declared-as-follows-specify-the-correct-statement",{"name":307,"value":659},"what-is-the-underlying-mechanism-for-optimizing-dom-updates-in-react",{"name":322,"value":661},"what-prevents-you-from-organizing-a-centralized-state-without-a-state-manager-if-you-organize-the-state-using-react-context-and-state-mechanisms-what-is-the-problem-what-do-state-managers-add",{"cooperation":663,"copyright":666,"reportError":667,"socialNetwork":669},{"link":664,"title":665},"https://t.me/baurinanton","Сотрудничество","© “GOOD WEB JOB!”",{"label":668,"link":664},"Сообщить об ошибке",{"label":670,"socialNetworkList":671},"Мы в соцсетях:",[672,675,678],{"icon":33,"link":673,"title":674},"https://max.ru/u/f9LHodD0cOKMaukdnnahTeL5pwvjrPfUaZ4S8_1rsNy9I9qsmc9Ar3kP_y8","Max",{"icon":676,"link":664,"title":677},"ic:baseline-telegram","Telegram",{"icon":679,"link":680,"title":681},"ri:vk-fill","https://vk.com/baurinanton","VK",{"data":683,"body":684},{},{"type":685,"children":686},"root",[687,695,708,713,718],{"type":688,"tag":689,"props":690,"children":691},"element","p",{},[692],{"type":693,"value":694},"text","Дана строка:",{"type":688,"tag":696,"props":697,"children":701},"pre",{"className":698,"code":700,"language":693},[699],"language-text"," const str = AVVVBBBVVXDHJFFFFDDDDDDHAAAAJJJDDSLSSSDDDD\n",[702],{"type":688,"tag":703,"props":704,"children":706},"code",{"__ignoreMap":705},"",[707],{"type":693,"value":700},{"type":688,"tag":689,"props":709,"children":710},{},[711],{"type":693,"value":712},"Необходимо реализовать функцию, принимающую в аргументах строку, состоящую из букв и вернуть новую строку, в которой повторяющиеся буквы заменены количеством повторений.",{"type":688,"tag":689,"props":714,"children":715},{},[716],{"type":693,"value":717},"Примеры:",{"type":688,"tag":696,"props":719,"children":722},{"className":720,"code":721,"language":693},[699],"rle('AVVVBBBVVXDHJFFFFDDDDDDHAAAAJJJDDSLSSSDDDD'); // => 'AV3B3V2XDHJF4D6HA4J3D2SLS3D4';\nrle('AVBVVXDHJFFDDDDDDHAAAAJJJDDSLSSSD'); // => 'AV1B1V2XDHJF2D6HA4J3D2SLS3D1';\nrle('AVBV'); // => 'AVBV';\nrle('AVBVV'); // => 'AVBV2';\n",[723],{"type":688,"tag":703,"props":724,"children":725},{"__ignoreMap":705},[726],{"type":693,"value":721},{"data":728,"body":729},{},{"type":685,"children":730},[731],{"type":688,"tag":689,"props":732,"children":733},{},[734,736,740,742,748,750,756,758,764,765,771,773,779],{"type":693,"value":735},"RLE (run-length encoding) — это подход, при котором строка рассматривается как набор «групп» одинаковых подряд символов.",{"type":688,"tag":737,"props":738,"children":739},"br",{},[],{"type":693,"value":741},"\nНапример, строка ",{"type":688,"tag":703,"props":743,"children":745},{"className":744},[],[746],{"type":693,"value":747},"AAABCC",{"type":693,"value":749}," разбивается на группы ",{"type":688,"tag":703,"props":751,"children":753},{"className":752},[],[754],{"type":693,"value":755},"AAA",{"type":693,"value":757},", ",{"type":688,"tag":703,"props":759,"children":761},{"className":760},[],[762],{"type":693,"value":763},"B",{"type":693,"value":757},{"type":688,"tag":703,"props":766,"children":768},{"className":767},[],[769],{"type":693,"value":770},"CC",{"type":693,"value":772},", и из них формируется запись вроде ",{"type":688,"tag":703,"props":774,"children":776},{"className":775},[],[777],{"type":693,"value":778},"A3BC2",{"type":693,"value":780}," (число добавляется только если повторов больше одного).",{"data":782,"body":783},{},{"type":685,"children":784},[785],{"type":688,"tag":689,"props":786,"children":787},{},[788,790,796,798,801],{"type":693,"value":789},"Повторы считаются только подряд: в строке ",{"type":688,"tag":703,"props":791,"children":793},{"className":792},[],[794],{"type":693,"value":795},"ABABA",{"type":693,"value":797}," нет групп длинее 1, поэтому результат остаётся почти таким же.",{"type":688,"tag":737,"props":799,"children":800},{},[],{"type":693,"value":802},"\nЭто важное свойство задачи: одинаковые символы, разделённые другими символами, относятся к разным группам и не объединяются.",{"data":804,"body":805},{},{"type":685,"children":806},[807,812,821,826],{"type":688,"tag":689,"props":808,"children":809},{},[810],{"type":693,"value":811},"Ниже показана простая «модель» работы алгоритма: берётся текущая позиция, определяется длина группы одинаковых символов, затем группа записывается в ответ.",{"type":688,"tag":696,"props":813,"children":816},{"className":814,"code":815,"language":693},[699],"Вход:  A V V V B B B V V X D H J F F F F\nГруппы: A | VVV | BBB | VV | X | D | H | J | FFFF\nВыход:  A   V3    B3    V2   X   D   H   J   F4\n",[817],{"type":688,"tag":703,"props":818,"children":819},{"__ignoreMap":705},[820],{"type":693,"value":815},{"type":688,"tag":689,"props":822,"children":823},{},[824],{"type":693,"value":825},"Последовательность действий (общая идея для всех вариантов):",{"type":688,"tag":827,"props":828,"children":829},"ul",{},[830,836,841,846],{"type":688,"tag":831,"props":832,"children":833},"li",{},[834],{"type":693,"value":835},"Выбирается символ текущей группы.",{"type":688,"tag":831,"props":837,"children":838},{},[839],{"type":693,"value":840},"Подсчитывается, сколько раз он повторяется подряд.",{"type":688,"tag":831,"props":842,"children":843},{},[844],{"type":693,"value":845},"В результат добавляется буква и (если нужно) число повторов.",{"type":688,"tag":831,"props":847,"children":848},{},[849],{"type":693,"value":850},"Переход выполняется к началу следующей группы и процесс повторяется.",{"data":852,"body":853},{},{"type":685,"children":854},[855],{"type":688,"tag":689,"props":856,"children":857},{},[858,860,866,868,874],{"type":693,"value":859},"Вариант с двумя указателями (",{"type":688,"tag":703,"props":861,"children":863},{"className":862},[],[864],{"type":693,"value":865},"i",{"type":693,"value":867}," и ",{"type":688,"tag":703,"props":869,"children":871},{"className":870},[],[872],{"type":693,"value":873},"j",{"type":693,"value":875},") удобен тем, что «правый» указатель двигается только вперёд, поэтому вся строка просматривается линейно.",{"data":877,"body":878},{},{"type":685,"children":879},[880],{"type":688,"tag":827,"props":881,"children":882},{},[883,888,908,926],{"type":688,"tag":831,"props":884,"children":885},{},[886],{"type":693,"value":887},"Пустая строка: возвращается пустая строка.",{"type":688,"tag":831,"props":889,"children":890},{},[891,893,899,901,906],{"type":693,"value":892},"Строка без повторов: возвращается исходная строка (например, ",{"type":688,"tag":703,"props":894,"children":896},{"className":895},[],[897],{"type":693,"value":898},"ABC",{"type":693,"value":900}," → ",{"type":688,"tag":703,"props":902,"children":904},{"className":903},[],[905],{"type":693,"value":898},{"type":693,"value":907},").",{"type":688,"tag":831,"props":909,"children":910},{},[911,913,919,920,925],{"type":693,"value":912},"Строка из одного символа: возвращается этот символ (например, ",{"type":688,"tag":703,"props":914,"children":916},{"className":915},[],[917],{"type":693,"value":918},"A",{"type":693,"value":900},{"type":688,"tag":703,"props":921,"children":923},{"className":922},[],[924],{"type":693,"value":918},{"type":693,"value":907},{"type":688,"tag":831,"props":927,"children":928},{},[929,931,937],{"type":693,"value":930},"Нестрочный аргумент: выбрасывается ",{"type":688,"tag":703,"props":932,"children":934},{"className":933},[],[935],{"type":693,"value":936},"TypeError",{"type":693,"value":938},", чтобы ошибка была явной и понятной.",{"data":940,"body":941},{},{"type":685,"children":942},[943,1127],{"type":688,"tag":944,"props":945,"children":946},"table",{},[947,971],{"type":688,"tag":948,"props":949,"children":950},"thead",{},[951],{"type":688,"tag":952,"props":953,"children":954},"tr",{},[955,961,966],{"type":688,"tag":956,"props":957,"children":958},"th",{},[959],{"type":693,"value":960},"Вход",{"type":688,"tag":956,"props":962,"children":963},{},[964],{"type":693,"value":965},"Группы",{"type":688,"tag":956,"props":967,"children":968},{},[969],{"type":693,"value":970},"Выход",{"type":688,"tag":972,"props":973,"children":974},"tbody",{},[975,1023,1069,1098],{"type":688,"tag":952,"props":976,"children":977},{},[978,987,1015],{"type":688,"tag":979,"props":980,"children":981},"td",{},[982],{"type":688,"tag":703,"props":983,"children":985},{"className":984},[],[986],{"type":693,"value":68},{"type":688,"tag":979,"props":988,"children":989},{},[990,995,997,1003,1004,1009,1010],{"type":688,"tag":703,"props":991,"children":993},{"className":992},[],[994],{"type":693,"value":918},{"type":693,"value":996}," ",{"type":688,"tag":703,"props":998,"children":1000},{"className":999},[],[1001],{"type":693,"value":1002},"V",{"type":693,"value":996},{"type":688,"tag":703,"props":1005,"children":1007},{"className":1006},[],[1008],{"type":693,"value":763},{"type":693,"value":996},{"type":688,"tag":703,"props":1011,"children":1013},{"className":1012},[],[1014],{"type":693,"value":1002},{"type":688,"tag":979,"props":1016,"children":1017},{},[1018],{"type":688,"tag":703,"props":1019,"children":1021},{"className":1020},[],[1022],{"type":693,"value":68},{"type":688,"tag":952,"props":1024,"children":1025},{},[1026,1034,1061],{"type":688,"tag":979,"props":1027,"children":1028},{},[1029],{"type":688,"tag":703,"props":1030,"children":1032},{"className":1031},[],[1033],{"type":693,"value":71},{"type":688,"tag":979,"props":1035,"children":1036},{},[1037,1042,1043,1048,1049,1054,1055],{"type":688,"tag":703,"props":1038,"children":1040},{"className":1039},[],[1041],{"type":693,"value":918},{"type":693,"value":996},{"type":688,"tag":703,"props":1044,"children":1046},{"className":1045},[],[1047],{"type":693,"value":1002},{"type":693,"value":996},{"type":688,"tag":703,"props":1050,"children":1052},{"className":1051},[],[1053],{"type":693,"value":763},{"type":693,"value":996},{"type":688,"tag":703,"props":1056,"children":1058},{"className":1057},[],[1059],{"type":693,"value":1060},"VV",{"type":688,"tag":979,"props":1062,"children":1063},{},[1064],{"type":688,"tag":703,"props":1065,"children":1067},{"className":1066},[],[1068],{"type":693,"value":72},{"type":688,"tag":952,"props":1070,"children":1071},{},[1072,1081,1089],{"type":688,"tag":979,"props":1073,"children":1074},{},[1075],{"type":688,"tag":703,"props":1076,"children":1078},{"className":1077},[],[1079],{"type":693,"value":1080},"FFFF",{"type":688,"tag":979,"props":1082,"children":1083},{},[1084],{"type":688,"tag":703,"props":1085,"children":1087},{"className":1086},[],[1088],{"type":693,"value":1080},{"type":688,"tag":979,"props":1090,"children":1091},{},[1092],{"type":688,"tag":703,"props":1093,"children":1095},{"className":1094},[],[1096],{"type":693,"value":1097},"F4",{"type":688,"tag":952,"props":1099,"children":1100},{},[1101,1110,1118],{"type":688,"tag":979,"props":1102,"children":1103},{},[1104],{"type":688,"tag":703,"props":1105,"children":1107},{"className":1106},[],[1108],{"type":693,"value":1109},"DDDDDD",{"type":688,"tag":979,"props":1111,"children":1112},{},[1113],{"type":688,"tag":703,"props":1114,"children":1116},{"className":1115},[],[1117],{"type":693,"value":1109},{"type":688,"tag":979,"props":1119,"children":1120},{},[1121],{"type":688,"tag":703,"props":1122,"children":1124},{"className":1123},[],[1125],{"type":693,"value":1126},"D6",{"type":688,"tag":827,"props":1128,"children":1129},{},[1130,1135],{"type":688,"tag":831,"props":1131,"children":1132},{},[1133],{"type":693,"value":1134},"Сложность по времени: O(n), потому что каждый символ участвует в сравнении ограниченное число раз.",{"type":688,"tag":831,"props":1136,"children":1137},{},[1138],{"type":693,"value":1139},"Сложность по памяти: O(n) на результирующую строку, так как в неё накапливается ответ.",{"data":1141,"body":1142},{},{"type":685,"children":1143},[1144],{"type":688,"tag":689,"props":1145,"children":1146},{},[1147],{"type":693,"value":54},1775575822759]