Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 6debd5c

Browse files
chore: πŸ€– remove extra lines (#1330)
I ran the command yarn style and that got failed, so I fixed that
1 parent 1666c3a commit 6debd5c

7 files changed

Lines changed: 0 additions & 7 deletions

File tree

β€ŽData-Structures/Heap/MinPriorityQueue.jsβ€Ž

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,3 @@
1-
21
/* Minimum Priority Queue
32
* It is a part of heap data structure
43
* A heap is a specific tree based data structure

β€ŽDynamic-Programming/SudokuSolver.jsβ€Ž

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,3 @@
1-
21
const isValid = (board, row, col, k) => {
32
for (let i = 0; i < 9; i++) {
43
const m = 3 * Math.floor(row / 3) + Math.floor(i / 3)

β€ŽDynamic-Programming/UniquePaths.jsβ€Ž

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,3 @@
1-
21
/*
32
*
43
* Unique Paths

β€ŽProject-Euler/Problem011.jsβ€Ž

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,3 @@
1-
21
/*
32
*
43
* In the 20Γ—20 grid below, four numbers along a diagonal line have been marked in red.

β€ŽRecursive/BinarySearch.jsβ€Ž

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,3 @@
1-
21
/**
32
* @function BinarySearch
43
* @description Search the integer inside the sorted integers array using Binary Search Algorithm.

β€ŽRecursive/FibonacciNumberRecursive.jsβ€Ž

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,3 @@
1-
21
/**
32
* @function Fibonacci
43
* @description Function to return the N-th Fibonacci number.

β€ŽSorts/TopologicalSort.jsβ€Ž

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,3 @@
1-
21
export function TopologicalSorter () {
32
const graph = {}
43
let isVisitedNode

0 commit comments

Comments
Β (0)