How to solve JS algorithm and data structures

preview_player
Показать описание
📝 Description

It is the second part about solving algorithms from freeCodeCamp.

In this episode we do few things Caesars Cipher and Cash Register.
In cryptography, a Caesar cipher, also known as Caesar's cipher, the shift cipher, Caesar's code or Caesar shift, is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a left shift of 3, D would be replaced by A, E would become B, and so on. The method is named after Julius Caesar, who used it in his private correspondence

Cash Register about solving the problem with counting and returning the status of operation.
It helps to remember how to work with different types of data and do mathematical operations.

Enjoy this episode, more will be soon.

--------------------------------------------------------------------------------------------------------------------------

❤ Socials

--------------------------------------------------------------------------------------------------------------------------

Timecodes:
00:00:00 - Introduction
00:01:24 - Palindrome problem
00:12:30 - Romanic number converter
00:30:50 - Summary

#JavaScript #programming #development #html5 #css #scss #js #angular #nodejs #rxjs #ngrx #typescript #tutorial #guide #nestjs #freeCodeCamp
Рекомендации по теме
welcome to shbcf.ru