📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings
37 matches across 4 categories. Click a row to expand file-level details.
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | …nary-search-tree/__test__/BinarySearchTreeNode.test.js | 209 | function removeNotExistingElementFromTree() { |
| LOW | …algorithms/tree/depth-first-search/depthFirstSearch.js | 43 | export function depthFirstSearchRecursive(node, callbacks) { |
| LOW | …thms/linked-list/reverse-traversal/reverseTraversal.js | 11 | function reverseTraversalRecursive(node, callback) { |
| LOW | …lgorithms/graph/depth-first-search/depthFirstSearch.js | 48 | function depthFirstSearchRecursive(graph, currentVertex, previousVertex, callbacks) { |
| LOW | …thms/graph/eulerian-path/__test__/eulerianPath.test.js | 8 | function findEulerianPathInNotEulerianGraph() { |
| LOW | …/detect-cycle/detectUndirectedCycleUsingDisjointSet.js | 8 | export default function detectUndirectedCycleUsingDisjointSet(graph) { |
| LOW | …algorithms/graph/hamiltonian-cycle/hamiltonianCycle.js | 56 | function hamiltonianCycleRecursive({ |
| LOW | …ly-connected-components/stronglyConnectedComponents.js | 8 | function getVerticesSortedByDfsFinishTime(graph) { |
| LOW | …ly-connected-components/stronglyConnectedComponents.js | 119 | export default function stronglyConnectedComponents(graph) { |
| LOW | …ath/euclidean-algorithm/euclideanAlgorithmIterative.js | 7 | export default function euclideanAlgorithmIterative(originalA, originalB) { |
| LOW | …h/fourier-transform/inverseDiscreteFourierTransform.js | 16 | export default function inverseDiscreteFourierTransform( |
| LOW | …ourier-transform/__test__/fastFourierTransform.test.js | 10 | function sequencesApproximatelyEqual(sequence1, sequence2, delta) { |
| LOW | …ommon-subsequence/longestCommonSubsequenceRecursive.js | 9 | export default function longestCommonSubsequenceRecursive(string1, string2) { |
| LOW | …orithms/sets/combinations/combineWithoutRepetitions.js | 6 | export default function combineWithoutRepetitions(comboOptions, comboLength) { |
| LOW | …st-common-supersequence/shortestCommonSupersequence.js | 9 | export default function shortestCommonSupersequence(set1, set2) { |
| LOW | …creasing-subsequence/dpLongestIncreasingSubsequence.js | 8 | export default function dpLongestIncreasingSubsequence(sequence) { |
| LOW | …ithms/sets/permutations/permutateWithoutRepetitions.js | 5 | export default function permutateWithoutRepetitions(permutationOptions) { |
| LOW | …gular-expression-matching/regularExpressionMatching.js | 11 | export default function regularExpressionMatching(string, pattern) { |
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | …graphy/polynomial-hash/__test__/PolynomialHash.test.js | 10 | const text = 'Lorem Ipsum is simply dummy text of the printing and ' |
| LOW | …graphy/polynomial-hash/__test__/PolynomialHash.test.js | 11 | + 'typesetting industry. Lorem Ipsum has been the industry\'s standard ' |
| LOW | …/polynomial-hash/__test__/SimplePolynomialHash.test.js | 8 | const text = 'Lorem Ipsum is simply dummy text of the printing and ' |
| LOW | …/polynomial-hash/__test__/SimplePolynomialHash.test.js | 9 | + 'typesetting industry. Lorem Ipsum has been the industry\'s standard ' |
| LOW | …lgorithms/string/rabin-karp/__test__/rabinKarp.test.js | 19 | const text = 'Lorem Ipsum is simply dummy text of the printing and ' |
| LOW | …lgorithms/string/rabin-karp/__test__/rabinKarp.test.js | 20 | + 'typesetting industry. Lorem Ipsum has been the industry\'s standard ' |
| LOW | …lgorithms/string/rabin-karp/__test__/rabinKarp.test.js | 26 | + 'containing Lorem Ipsum passages, and more recently with desktop' |
| LOW | …lgorithms/string/rabin-karp/__test__/rabinKarp.test.js | 32 | expect(rabinKarp(text, 'versions of Lorem Ipsum.')).toBe(549); |
| LOW | …lgorithms/string/rabin-karp/__test__/rabinKarp.test.js | 33 | expect(rabinKarp(text, 'versions of Lorem Ipsum:')).toBe(-1); |
| LOW | …lgorithms/string/rabin-karp/__test__/rabinKarp.test.js | 34 | expect(rabinKarp(text, 'Lorem Ipsum passages, and more recently with')).toBe(446); |
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | …st/reverse-traversal/__test__/reverseTraversal.test.js | 21 | }); |
| LOW | src/algorithms/graph/floyd-warshall/floydWarshall.js | 41 | }); |
| LOW | src/algorithms/math/bits/fullAdder.js | 41 | // The operands of all bitwise operators are converted to signed |
| LOW | src/algorithms/uncategorized/n-queens/nQueensBitwise.js | 21 | // Keeps track of the number of valid solutions. |
| LOW | src/algorithms/uncategorized/n-queens/nQueensBitwise.js | 41 | // queen there. |
| LOW | src/algorithms/string/z-algorithm/zAlgorithm.js | 21 | // Prefix: ab....... |
| LOW | src/algorithms/string/z-algorithm/zAlgorithm.js | 61 | // Calculate corresponding Z box shift. Because we want to copy the values |
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | …algorithms/graph/hamiltonian-cycle/hamiltonianCycle.js | 68 | // Now we need to check if it is cycle or not. |
| LOW | …gular-expression-matching/regularExpressionMatching.js | 107 | * we need to check if there was a match for the pattern and for the |