mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 15:39:42 +08:00
chore: 🤖 remove extra lines (#1330)
I ran the command yarn style and that got failed, so I fixed that
This commit is contained in:
@ -1,4 +1,3 @@
|
||||
|
||||
/* Minimum Priority Queue
|
||||
* It is a part of heap data structure
|
||||
* A heap is a specific tree based data structure
|
||||
|
@ -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)
|
||||
|
@ -1,4 +1,3 @@
|
||||
|
||||
/*
|
||||
*
|
||||
* Unique Paths
|
||||
|
@ -1,4 +1,3 @@
|
||||
|
||||
/*
|
||||
*
|
||||
* In the 20×20 grid below, four numbers along a diagonal line have been marked in red.
|
||||
|
@ -1,4 +1,3 @@
|
||||
|
||||
/**
|
||||
* @function BinarySearch
|
||||
* @description Search the integer inside the sorted integers array using Binary Search Algorithm.
|
||||
|
@ -1,4 +1,3 @@
|
||||
|
||||
/**
|
||||
* @function Fibonacci
|
||||
* @description Function to return the N-th Fibonacci number.
|
||||
|
@ -1,4 +1,3 @@
|
||||
|
||||
export function TopologicalSorter () {
|
||||
const graph = {}
|
||||
let isVisitedNode
|
||||
|
Reference in New Issue
Block a user