1621674240
We are going to write a function called pigIt
that will accept a string, str
, as an argument.
You are given a string and the goal of the function is to translate the string to Pig Latin. To translate the string, you do the following:
That’s it. If the word is only a single letter, skip step number one and just add an “ay” at the end. If the string is a punctuation mark or a number, leave it as is. Leave the cases of the words untouched.
Example:
pigIt('Pig latin is cool'); \\ igPay atinlay siay oolcay
pigIt('Hello world !'); \\ elloHay orldway !
To begin, we will split the string into an array where each word is its own array element. We assign that array to strArr
.
let strArr = str.split(' ');
Next, we will create an empty array called pigLatin
. This is the array we will append each word to after we translate it to Pig Latin.
let pigLatin = [];
#coding #programming #javascript #algorithms
1674793920
This repository contains JavaScript based examples of many popular algorithms and data structures.
Each algorithm and data structure has its own separate README with related explanations and links for further reading (including ones to YouTube videos).
Read this in other languages: 简体中文, 繁體中文, 한국어, 日本語, Polski, Français, Español, Português, Русский, Türkçe, Italiana, Bahasa Indonesia, Українська, Arabic, Tiếng Việt, Deutsch
☝ Note that this project is meant to be used for learning and researching purposes only, and it is not meant to be used for production.
A data structure is a particular way of organizing and storing data in a computer so that it can be accessed and modified efficiently. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.
B
- Beginner, A
- Advanced
B
Linked ListB
Doubly Linked ListB
QueueB
StackB
Hash TableB
Heap - max and min heap versionsB
Priority QueueA
TrieA
TreeA
Binary Search TreeA
AVL TreeA
Red-Black TreeA
Segment Tree - with min/max/sum range queries examplesA
Fenwick Tree (Binary Indexed Tree)A
Graph (both directed and undirected)A
Disjoint SetA
Bloom FilterA
LRU Cache - Least Recently Used (LRU) cacheAn algorithm is an unambiguous specification of how to solve a class of problems. It is a set of rules that precisely define a sequence of operations.
B
- Beginner, A
- Advanced
B
Bit Manipulation - set/get/update/clear bits, multiplication/division by two, make negative etc.B
Binary Floating Point - binary representation of the floating-point numbers.B
FactorialB
Fibonacci Number - classic and closed-form versionsB
Prime Factors - finding prime factors and counting them using Hardy-Ramanujan's theoremB
Primality Test (trial division method)B
Euclidean Algorithm - calculate the Greatest Common Divisor (GCD)B
Least Common Multiple (LCM)B
Sieve of Eratosthenes - finding all prime numbers up to any given limitB
Is Power of Two - check if the number is power of two (naive and bitwise algorithms)B
Pascal's TriangleB
Complex Number - complex numbers and basic operations with themB
Radian & Degree - radians to degree and backwards conversionB
Fast PoweringB
Horner's method - polynomial evaluationB
Matrices - matrices and basic matrix operations (multiplication, transposition, etc.)B
Euclidean Distance - distance between two points/vectors/matricesA
Integer PartitionA
Square Root - Newton's methodA
Liu Hui π Algorithm - approximate π calculations based on N-gonsA
Discrete Fourier Transform - decompose a function of time (a signal) into the frequencies that make it upB
Cartesian Product - product of multiple setsB
Fisher–Yates Shuffle - random permutation of a finite sequenceA
Power Set - all subsets of a set (bitwise, backtracking, and cascading solutions)A
Permutations (with and without repetitions)A
Combinations (with and without repetitions)A
Longest Common Subsequence (LCS)A
Longest Increasing SubsequenceA
Shortest Common Supersequence (SCS)A
Knapsack Problem - "0/1" and "Unbound" onesA
Maximum Subarray - "Brute Force" and "Dynamic Programming" (Kadane's) versionsA
Combination Sum - find all combinations that form specific sumB
Hamming Distance - number of positions at which the symbols are differentB
Palindrome - check if the string is the same in reverseA
Levenshtein Distance - minimum edit distance between two sequencesA
Knuth–Morris–Pratt Algorithm (KMP Algorithm) - substring search (pattern matching)A
Z Algorithm - substring search (pattern matching)A
Rabin Karp Algorithm - substring searchA
Longest Common SubstringA
Regular Expression MatchingB
Linear SearchB
Jump Search (or Block Search) - search in sorted arrayB
Binary Search - search in sorted arrayB
Interpolation Search - search in uniformly distributed sorted arrayB
Bubble SortB
Selection SortB
Insertion SortB
Heap SortB
Merge SortB
Quicksort - in-place and non-in-place implementationsB
ShellsortB
Counting SortB
Radix SortB
Depth-First Search (DFS)B
Breadth-First Search (BFS)B
Depth-First Search (DFS)B
Breadth-First Search (BFS)B
Kruskal’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graphA
Dijkstra Algorithm - finding the shortest paths to all graph vertices from single vertexA
Bellman-Ford Algorithm - finding the shortest paths to all graph vertices from single vertexA
Floyd-Warshall Algorithm - find the shortest paths between all pairs of verticesA
Detect Cycle - for both directed and undirected graphs (DFS and Disjoint Set based versions)A
Prim’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graphA
Topological Sorting - DFS methodA
Articulation Points - Tarjan's algorithm (DFS based)A
Bridges - DFS based algorithmA
Eulerian Path and Eulerian Circuit - Fleury's algorithm - Visit every edge exactly onceA
Hamiltonian Cycle - Visit every vertex exactly onceA
Strongly Connected Components - Kosaraju's algorithmA
Travelling Salesman Problem - shortest possible route that visits each city and returns to the origin cityB
Polynomial Hash - rolling hash function based on polynomialB
Rail Fence Cipher - a transposition cipher algorithm for encoding messagesB
Caesar Cipher - simple substitution cipherB
Hill Cipher - substitution cipher based on linear algebraB
NanoNeuron - 7 simple JS functions that illustrate how machines can actually learn (forward/backward propagation)B
k-NN - k-nearest neighbors classification algorithmB
k-Means - k-Means clustering algorithmB
Seam Carving - content-aware image resizing algorithmB
Weighted Random - select the random item from the list based on items' weightsA
Genetic algorithm - example of how the genetic algorithm may be applied for training the self-parking carsB
Tower of HanoiB
Square Matrix Rotation - in-place algorithmB
Jump Game - backtracking, dynamic programming (top-down + bottom-up) and greedy examplesB
Unique Paths - backtracking, dynamic programming and Pascal's Triangle based examplesB
Rain Terraces - trapping rain water problem (dynamic programming and brute force versions)B
Recursive Staircase - count the number of ways to reach to the top (4 solutions)B
Best Time To Buy Sell Stocks - divide and conquer and one-pass examplesA
N-Queens ProblemA
Knight's TourAn algorithmic paradigm is a generic method or approach which underlies the design of a class of algorithms. It is an abstraction higher than the notion of an algorithm, just as an algorithm is an abstraction higher than a computer program.
B
Linear SearchB
Rain Terraces - trapping rain water problemB
Recursive Staircase - count the number of ways to reach to the topA
Maximum SubarrayA
Travelling Salesman Problem - shortest possible route that visits each city and returns to the origin cityA
Discrete Fourier Transform - decompose a function of time (a signal) into the frequencies that make it upB
Jump GameA
Unbound Knapsack ProblemA
Dijkstra Algorithm - finding the shortest path to all graph verticesA
Prim’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graphA
Kruskal’s Algorithm - finding Minimum Spanning Tree (MST) for weighted undirected graphB
Binary SearchB
Tower of HanoiB
Pascal's TriangleB
Euclidean Algorithm - calculate the Greatest Common Divisor (GCD)B
Merge SortB
QuicksortB
Tree Depth-First Search (DFS)B
Graph Depth-First Search (DFS)B
Matrices - generating and traversing the matrices of different shapesB
Jump GameB
Fast PoweringB
Best Time To Buy Sell Stocks - divide and conquer and one-pass examplesA
Permutations (with and without repetitions)A
Combinations (with and without repetitions)A
Maximum SubarrayB
Fibonacci NumberB
Jump GameB
Unique PathsB
Rain Terraces - trapping rain water problemB
Recursive Staircase - count the number of ways to reach to the topB
Seam Carving - content-aware image resizing algorithmA
Levenshtein Distance - minimum edit distance between two sequencesA
Longest Common Subsequence (LCS)A
Longest Common SubstringA
Longest Increasing SubsequenceA
Shortest Common SupersequenceA
0/1 Knapsack ProblemA
Integer PartitionA
Maximum SubarrayA
Bellman-Ford Algorithm - finding the shortest path to all graph verticesA
Floyd-Warshall Algorithm - find the shortest paths between all pairs of verticesA
Regular Expression MatchingB
Jump GameB
Unique PathsB
Power Set - all subsets of a setA
Hamiltonian Cycle - Visit every vertex exactly onceA
N-Queens ProblemA
Knight's TourA
Combination Sum - find all combinations that form specific sumInstall all dependencies
npm install
Run ESLint
You may want to run it to check code quality.
npm run lint
Run all tests
npm test
Run tests by name
npm test -- 'LinkedList'
Troubleshooting
If linting or testing is failing, try to delete the node_modules
folder and re-install npm packages:
rm -rf ./node_modules
npm i
Also make sure that you're using a correct Node version (>=14.16.0
). If you're using nvm for Node version management you may run nvm use
from the root folder of the project and the correct version will be picked up.
Playground
You may play with data-structures and algorithms in ./src/playground/playground.js
file and write tests for it in ./src/playground/__test__/playground.test.js
.
Then just simply run the following command to test if your playground code works as expected:
npm test -- 'playground'
Big O notation is used to classify algorithms according to how their running time or space requirements grow as the input size grows. On the chart below you may find most common orders of growth of algorithms specified in Big O notation.
Source: Big O Cheat Sheet.
Below is the list of some of the most used Big O notations and their performance comparisons against different sizes of the input data.
Big O Notation | Type | Computations for 10 elements | Computations for 100 elements | Computations for 1000 elements |
---|---|---|---|---|
O(1) | Constant | 1 | 1 | 1 |
O(log N) | Logarithmic | 3 | 6 | 9 |
O(N) | Linear | 10 | 100 | 1000 |
O(N log N) | n log(n) | 30 | 600 | 9000 |
O(N^2) | Quadratic | 100 | 10000 | 1000000 |
O(2^N) | Exponential | 1024 | 1.26e+29 | 1.07e+301 |
O(N!) | Factorial | 3628800 | 9.3e+157 | 4.02e+2567 |
Data Structure | Access | Search | Insertion | Deletion | Comments |
---|---|---|---|---|---|
Array | 1 | n | n | n | |
Stack | n | n | 1 | 1 | |
Queue | n | n | 1 | 1 | |
Linked List | n | n | 1 | n | |
Hash Table | - | n | n | n | In case of perfect hash function costs would be O(1) |
Binary Search Tree | n | n | n | n | In case of balanced tree costs would be O(log(n)) |
B-Tree | log(n) | log(n) | log(n) | log(n) | |
Red-Black Tree | log(n) | log(n) | log(n) | log(n) | |
AVL Tree | log(n) | log(n) | log(n) | log(n) | |
Bloom Filter | - | 1 | 1 | - | False positives are possible while searching |
Name | Best | Average | Worst | Memory | Stable | Comments |
---|---|---|---|---|---|---|
Bubble sort | n | n2 | n2 | 1 | Yes | |
Insertion sort | n | n2 | n2 | 1 | Yes | |
Selection sort | n2 | n2 | n2 | 1 | No | |
Heap sort | n log(n) | n log(n) | n log(n) | 1 | No | |
Merge sort | n log(n) | n log(n) | n log(n) | n | Yes | |
Quick sort | n log(n) | n log(n) | n2 | log(n) | No | Quicksort is usually done in-place with O(log(n)) stack space |
Shell sort | n log(n) | depends on gap sequence | n (log(n))2 | 1 | No | |
Counting sort | n + r | n + r | n + r | n + r | Yes | r - biggest number in array |
Radix sort | n * k | n * k | n * k | n + k | Yes | k - length of longest key |
Folks who are backing this project ∑ = 0
ℹ️ A few more projects and articles about JavaScript and algorithms on trekhleb.dev
Author: trekhleb
Source Code: https://github.com/trekhleb/javascript-algorithms
License: MIT license
1621674240
We are going to write a function called pigIt
that will accept a string, str
, as an argument.
You are given a string and the goal of the function is to translate the string to Pig Latin. To translate the string, you do the following:
That’s it. If the word is only a single letter, skip step number one and just add an “ay” at the end. If the string is a punctuation mark or a number, leave it as is. Leave the cases of the words untouched.
Example:
pigIt('Pig latin is cool'); \\ igPay atinlay siay oolcay
pigIt('Hello world !'); \\ elloHay orldway !
To begin, we will split the string into an array where each word is its own array element. We assign that array to strArr
.
let strArr = str.split(' ');
Next, we will create an empty array called pigLatin
. This is the array we will append each word to after we translate it to Pig Latin.
let pigLatin = [];
#coding #programming #javascript #algorithms
1598015898
Work on real-time JavaScript Snake game project and become a pro
Snake game is an interesting JavaScript project for beginners. Snake game is a single-player game, which we’ve been playing for a very long time. The game mainly consists of two components – snake and fruit. And we just need to take our snake to the food so that it can eat and grow faster and as the number of fruits eaten increases, the length of snake increases which makes the game more interesting. While moving if the snake eats its own body, then the snake dies and the game ends. Now let’s see how we can create this.
To implement the snake game in JavaScript you should have basic knowledge of:
1. Basic concepts of JavaScript
2. HTML
3. CSS
Before proceeding ahead please download source code of Snake Game: Snake Game in JavaScript
HTML builds the basic structure. This file contains some basic HTML tags like div, h1, title, etc. also we’ve used bootstrap (CDN is already included).
index.html:
Code:
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>DataFlair Snake game</title>
<link rel="stylesheet" href="https://stackpath.bootstrapcdn.com/bootstrap/4.5.0/css/bootstrap.min.css" integrity="sha384-9aIt2nRpC12Uk9gS9baDl411NQApFmC26EwAOH8WgZl5MYYxFfc+NcPb1dKGj7Sk" crossorigin="anonymous">
<link rel="stylesheet" href="static/style.css">
</head>
<body>
<div class="container">
<div class ="Jumbotron">
<h1>DataFlair Snake game using vanilla JavaScript</h1>
<h2 class="btn btn-info">
Score: 0
</h2>
<div class="containerCanvas">
<canvas id="canvas" width="500" height="500" class="canvasmain"> </canvas>
</div>
</div>
</div>
<script src="static/fruit.js"></script>
<script src="static/snake.js"></script>
<script src="static/draw.js"></script>
</body>
</html>
We have used simple HTML tags except
#javascript tutorial #javascript project #javascript snake game #simple snake game #javascript
1622036598
JavaScript is unarguablly one of the most common things you’ll learn when you start programming for the web. Here’s a small post on JavaScript compound assignment operators and how we use them.
The compound assignment operators consist of a binary operator and the simple assignment operator.
The binary operators, work with two operands. For example a+b where + is the operator and the a, b are operands. Simple assignment operator is used to assign values to a variable(s).
It’s quite common to modify values stored in variables. To make this process a little quicker, we use compound assignment operators.
They are:
You can also check my video tutorial compound assignment operators.
Let’s consider an example. Suppose price = 5 and we want to add ten more to it.
var price = 5;
price = price + 10;
We added ten to price. Look at the repetitive price variable. We could easily use a compound += to reduce this. We do this instead.
price += 5;
Awesome. Isn’t it? What’s the value of price now? Practice and comment below. If you don’t know how to practice check these lessons.
Lets bring down the price by 5 again and display it.
We use console.log command to display what is stored in the variable. It is very help for debugging.
Debugging let’s you find errors or bugs in your code. More on this later.
price -= 5;
console.log(price);
Lets multiply price and show it.
price *=5;
console.log(price);
and finally we will divide it.
price /=5;
console.log(price);
If you have any doubts, comment below.
#javascript #javascript compound assignment operators #javascript binary operators #javascript simple assignment operator #doers javascript
1606912089
#how to build a simple calculator in javascript #how to create simple calculator using javascript #javascript calculator tutorial #javascript birthday calculator #calculator using javascript and html