algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-07 19:17:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: Test running overhaul, switch to Prettier & reformat everything (#1407)

Browse Source 
* chore: Switch to Node 20 + Vitest

* chore: migrate to vitest mock functions

* chore: code style (switch to prettier)

* test: re-enable long-running test

Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime!

see #1193

* chore: code style

* chore: fix failing tests

* Updated Documentation in README.md

* Update contribution guidelines to state usage of Prettier

* fix: set prettier printWidth back to 80

* chore: apply updated code style automatically

* fix: set prettier line endings to lf again

* chore: apply updated code style automatically

---------

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
This commit is contained in:
Roland Hummel
2023-10-03 23:08:19 +02:00
committed by GitHub
parent 0ca18c2b2c
commit 86d333ee94
392 changed files with 5849 additions and 16622 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Dynamic-Programming/Sliding-Window/LongestSubstringWithoutRepeatingCharacters.js
View File

@ -10,7 +10,7 @@
* @description Get the length of the longest substring without repeating characters
* @param {String} s - The input string
*/
export function LongestSubstringWithoutRepeatingCharacters (s) {
export function LongestSubstringWithoutRepeatingCharacters(s) {
let maxLength = 0
let start = 0
let end = 0

6
Dynamic-Programming/Sliding-Window/PermutationinString.js
View File

@ -12,7 +12,7 @@
* @return {boolean} - Returns true if s2 contains a permutation of s1, or false otherwise.
*/
export function PermutationinString (s1, s2) {
export function PermutationinString(s1, s2) {
if (s1.length > s2.length) return false
let start = 0
let end = s1.length - 1
@ -35,11 +35,11 @@ export function PermutationinString (s1, s2) {
}
return false
}
function equals (a, b) {
function equals(a, b) {
return JSON.stringify(a) === JSON.stringify(b)
}
function SetHash () {
function SetHash() {
const set = new Set()
const alphabets = 'abcdefghijklmnopqrstuvwxyz'
for (let i = 0; i < alphabets.length; i++) {