diff --git a/Data-Structures/Heap/MinPriorityQueue.js b/Data-Structures/Heap/MinPriorityQueue.js index bc4f26f786..5b543ce94f 100644 --- a/Data-Structures/Heap/MinPriorityQueue.js +++ b/Data-Structures/Heap/MinPriorityQueue.js @@ -1,4 +1,3 @@ - /* Minimum Priority Queue * It is a part of heap data structure * A heap is a specific tree based data structure diff --git a/Dynamic-Programming/SudokuSolver.js b/Dynamic-Programming/SudokuSolver.js index 75f174a318..b077f6ec18 100644 --- a/Dynamic-Programming/SudokuSolver.js +++ b/Dynamic-Programming/SudokuSolver.js @@ -1,4 +1,3 @@ - const isValid = (board, row, col, k) => { for (let i = 0; i < 9; i++) { const m = 3 * Math.floor(row / 3) + Math.floor(i / 3) diff --git a/Dynamic-Programming/UniquePaths.js b/Dynamic-Programming/UniquePaths.js index 4b3d67a1a3..a37049b2f4 100644 --- a/Dynamic-Programming/UniquePaths.js +++ b/Dynamic-Programming/UniquePaths.js @@ -1,4 +1,3 @@ - /* * * Unique Paths diff --git a/Project-Euler/Problem011.js b/Project-Euler/Problem011.js index 4135702c8e..190295c8ae 100644 --- a/Project-Euler/Problem011.js +++ b/Project-Euler/Problem011.js @@ -1,4 +1,3 @@ - /* * * In the 20×20 grid below, four numbers along a diagonal line have been marked in red. diff --git a/Recursive/BinarySearch.js b/Recursive/BinarySearch.js index 4c9a2d78a7..ba622daaa1 100644 --- a/Recursive/BinarySearch.js +++ b/Recursive/BinarySearch.js @@ -1,4 +1,3 @@ - /** * @function BinarySearch * @description Search the integer inside the sorted integers array using Binary Search Algorithm. diff --git a/Recursive/FibonacciNumberRecursive.js b/Recursive/FibonacciNumberRecursive.js index 4b32e9cb43..911d078e91 100644 --- a/Recursive/FibonacciNumberRecursive.js +++ b/Recursive/FibonacciNumberRecursive.js @@ -1,4 +1,3 @@ - /** * @function Fibonacci * @description Function to return the N-th Fibonacci number. diff --git a/Sorts/TopologicalSort.js b/Sorts/TopologicalSort.js index 5890449533..72487615ba 100644 --- a/Sorts/TopologicalSort.js +++ b/Sorts/TopologicalSort.js @@ -1,4 +1,3 @@ - export function TopologicalSorter () { const graph = {} let isVisitedNode pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy